Submission #2560116
Source Code Expand
#include <iostream> #include <algorithm> #include <functional> #include<vector> #include<math.h> #include<bitset> #include<string> #include <deque> #include<queue> #include<map> using namespace std; int A[9]; int main() { int N; int a; cin >> N ; for (int i = 0; i < N; i++) { cin >> a; if (a <= 399)A[0]++; if (400 <= a && a <= 799)A[1]++; if (800 <= a && a <= 1199)A[2]++; if (1200 <= a && a <= 1599)A[3]++; if (1600 <= a && a <= 1999)A[4]++; if (2000 <= a && a <= 2399)A[5]++; if (2400 <= a && a <= 2799)A[6]++; if (2800 <= a && a <= 3199)A[7]++; if (a >= 3200)A[8]++; } int Y = 0; for (int i = 0; i < 8; i++) { if (A[i] > 0)Y++; } int Z = A[8] + Y; if (Y == 0)Y=1; if (Z > 8)Z = 8; cout << Y << ' ' << Z << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Colorful Leaderboard |
User | aoneko |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 813 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 |