Submission #1341128


Source Code Expand

#include <iostream>
#include <bitset>
using namespace std;
int nr,cul;
int N;
int A[105];
bitset<9> U;
int main()
{
    cin>>N;
    for(int i=1;i<=N;i++)
    {
        cin>>A[i];
        if(A[i]<400){cul+=(U[1]==0);U[1]=1;}
        else if(A[i]<800){cul+=(U[2]==0);U[2]=1;}
        else if(A[i]<1200){cul+=(U[3]==0);U[3]=1;}
        else if(A[i]<1600){cul+=(U[4]==0);U[4]=1;}
        else if(A[i]<2000){cul+=(U[5]==0);U[5]=1;}
        else if(A[i]<2400){cul+=(U[6]==0);U[6]=1;}
        else if(A[i]<2800){cul+=(U[7]==0);U[7]=1;}
        else if(A[i]<3200){cul+=(U[8]==0);U[8]=1;}
        else
            nr++;
    }
    cout<<max(1,cul)<<" "<<nr+cul;
    return 0;
}

Submission Info

Submission Time
Task C - Colorful Leaderboard
User georgerapeanu
Language C++14 (GCC 5.4.1)
Score 300
Code Size 695 Byte
Status AC
Exec Time 1 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 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