Submission #1996057
Source Code Expand
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <functional>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <deque>
#include <sys/timeb.h>
#include <fstream>
using namespace std;
#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFL 1100000000000000000LL
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295
typedef long long ll;
typedef pair<int, int> Pi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<Pi> > vvPi;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi> > pqlP;
struct Edge {
int from, to, cost;
bool operator<(Edge e) {
return cost < e.cost;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
template <class T>
using vec = vector<T>;
template<class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
template<class T>
struct augEdge {
T from, to;
int cost;
bool operator<(augEdge e) { return cost < e.cost; }
bool operator>(augEdge e) { return cost > e.cost; }
};
template<class T>
using augGraph = vector<augEdge<T>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi a(n);
rep(i, n)cin >> a[i];
sort(all(a));
vi b(n);
b = a;
bool ans[8] = {false};
int cnt1 = 0, cnt2 = 0;
//min
rep(i, n) {
int t = 0;
a[i] -= 400;
while (a[i] >= 0) {
a[i] -= 400;
t++;
}
if (t < 8) {
ans[t] = true;
}
else {
bool f = false;
rep(j, 8) {
if (ans[j] == true) {
ans[j] = true;
f = true;
}
}
if (!f) {
ans[0] = true;
}
}
}
rep(i, 8) {
if (ans[i] == true) {
cnt1++;
ans[i] = false;
}
}
a = b;
//max
rep(i, n) {
int t = 0;
a[i] -= 400;
while (a[i] >= 0) {
a[i] -= 400;
t++;
}
if (t < 8) {
ans[t] = true;
}
else {
rep(j, 8) {
if (ans[j] != true) {
ans[j] = true;
break;
}
}
}
}
rep(i, 8) {
if (ans[i] == true) {
cnt2++;
}
}
cout << cnt1;
cout << " ";
cout << cnt2 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Colorful Leaderboard |
User |
shinshu |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3106 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt |
All |
in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, s1.txt, s2.txt, s3.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
AC |
1 ms |
256 KB |
in2.txt |
AC |
1 ms |
256 KB |
in3.txt |
WA |
1 ms |
256 KB |
in4.txt |
WA |
1 ms |
256 KB |
in5.txt |
AC |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |
s3.txt |
AC |
1 ms |
256 KB |