Submission #1778971
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <cstring> #include <cstdio> #include <cmath> #include <cctype> #include <map> #include <vector> #include <unordered_map> #define div 1000000000+7 using ll = long long; using namespace std; void solve() { int n, count = 0, count2 = 0; bool flag[8]; vector<int> a; for(int i = 0; i < 8; i++){ flag[i] = true; } cin >> n; for(int i = 0; i < n; i++){ int x; cin >> x; a.push_back(x); if(x < 399 && flag[0]){ count++; flag[0] = false; }else if(x >= 400 && x < 800 && flag[1]){ count++; flag[1] = false; }else if(x >= 800 && x < 1200 && flag[2]){ count++; flag[2] = false; }else if(x >= 1200 && x < 1200 && flag[3]){ count++; flag[3] = false; }else if(x >= 1600 && x < 2000 && flag[4]){ count++; flag[4] = false; }else if(x >= 2000 && x < 2400 && flag[5]){ count++; flag[5] = false; }else if(x >= 2400 && x < 2800 && flag[6]){ count++; flag[6] = false; }else if(x >= 2800 && x < 3200 && flag[7]){ count++; flag[7] = false; }else if(x >= 3200){ count2++; } } int min = count; int max = count + count2; if(max > 7){ max = 8; } cout << min << " " << max << endl; } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Colorful Leaderboard |
User | hecatier |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1620 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 | WA | 1 ms | 256 KB |
in2.txt | WA | 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 |