Submission #474096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
474096	2021-09-16T21:33:29 Z	ValiAntonie	Poi (IOI09_poi)	C++14	100 / 100	771 ms	15968 KB

poi

#include <bits/stdc++.h>

using namespace std;

struct elem{
    int puncte,pr,indice;
}total[2001];

bool cmp(elem A, elem B){
    if(A.puncte == B.puncte){
        if(A.pr == B.pr)
           return A.indice > B.indice;
        return A.pr < B.pr;
    }
    return A.puncte < B.puncte;
}


int n,t,p,a[2001][2001],i,j,suma,task[2001],nr,nr2;

int main()
{
cin>>n>>t>>p;
for(i=1;i<=n;i++){
    for(j=1;j<=t;j++){
        cin>>a[i][j];
    }
}
for(i=1;i<=t;i++){
    suma = 0;
    for(j=1;j<=n;j++){
        if(!a[j][i])
            suma++;
    }
    task[i] = suma;
}
for(i=1;i<=n;i++){
nr2 = 0;
for(j=1;j<=t;j++){
    if(a[i][j]){
      nr2++;
      total[i].puncte += task[j];
    }
}
total[i].pr = nr2;
total[i].indice = i;
}
nr = total[p].puncte;
cout << total[p].puncte << " ";
sort(total+1,total+n+1,cmp);
for(i=1;i<=n;i++){
    if(total[i].indice == p){
        cout << n - i + 1;
        break;
    }
}
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	2 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	3 ms	716 KB	Output is correct
10	Correct	8 ms	1196 KB	Output is correct
11	Correct	24 ms	1896 KB	Output is correct
12	Correct	40 ms	3016 KB	Output is correct
13	Correct	115 ms	5404 KB	Output is correct
14	Correct	181 ms	7616 KB	Output is correct
15	Correct	284 ms	9592 KB	Output is correct
16	Correct	309 ms	10380 KB	Output is correct
17	Correct	461 ms	11988 KB	Output is correct
18	Correct	529 ms	13636 KB	Output is correct
19	Correct	731 ms	15968 KB	Output is correct
20	Correct	771 ms	15940 KB	Output is correct