Submission #1992037
Source Code Expand
#include <iostream> #include <vector> #include <map> #include <utility> #include <algorithm> #include <cmath> #include <cstdio> #include <cstring> #include <stack> #include <queue> #include <set> #define REP(i,a,n) for(int i=a;i<n;++i) #define rep(i,n) REP(i,0,n) #define vsort(v) sort(v.begin(),v.end()) #define asort(a,n) sort(a, a + n) #define vi vector<int> #define vd vector<double> using namespace std; int main(){ cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vi vec(n); set<int> s; int over3200 = 0; rep(i, n){ cin >> vec[i]; int unko = vec[i] / 400; if(unko >= 8){ s.insert(8); over3200++; }else{ s.insert(vec[i] / 400); } } if(over3200 == 0){ cout << s.size() << ' ' << s.size() << endl; }else{ if(s.size() == 1){ cout << s.size() << ' '; }else{ cout << s.size() - 1 << ' '; } int tmp = s.size() + over3200 - 1; cout << tmp << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Colorful Leaderboard |
User | Shinjirow |
Language | C++14 (Clang 3.8.0) |
Score | 300 |
Code Size | 1126 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | AC | 1 ms | 256 KB |
in4.txt | AC | 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 |