Submission #10233646


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;

const int N = 9;
const double eps = 1e-6;

int n, r;
int s[N];

int main()
{
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        if(x < 400) s[0]++;
        else if(x < 800) s[1]++;
        else if(x < 1200) s[2]++;
        else if(x < 1600) s[3]++;
        else if(x < 2000) s[4]++;
        else if(x < 2400) s[5]++;
        else if(x < 2800) s[6]++;
        else if(x < 3200) s[7]++;
        else r++;
    }

    int cnt = 0;
    for(int i = 0; i < 8; i++)
        if(s[i]) cnt++;

    cout << max(1, cnt) << ' ' << r + cnt << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Colorful Leaderboard
User Daniel_y
Language C++14 (GCC 5.4.1)
Score 300
Code Size 761 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 8
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 2 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