Submission #1992022
Source Code Expand
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> P;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[100000],dp[100][100];
int main(){
cin >> n;
int p[10];
clr(d,0);
clr(p,0);
rep(i,0,n)cin >> d[i];
rep(i,0,n){
if(d[i] >= 3200){
p[8]++;
}else {
p[d[i]/400]++;
}
}
rep(i,0,8){
if(p[i] != 0){
m++;
l++;
}
}
if(m == 0 && p[8] != 0)m++;
printf("%lld %lld\n",m,l + p[8]);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - RGB Cards |
User |
shadowlink_0122 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1204 Byte |
Status |
WA |
Exec Time |
2 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
WA |
2 ms |
1024 KB |
in2.txt |
WA |
2 ms |
1024 KB |
in3.txt |
WA |
1 ms |
1024 KB |
in4.txt |
WA |
2 ms |
1024 KB |
in5.txt |
WA |
2 ms |
1024 KB |
s1.txt |
WA |
1 ms |
1024 KB |
s2.txt |
WA |
1 ms |
1024 KB |