Submission #978957

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
978957	2024-05-10T04:54:37 Z	tamir1	Poi (IOI09_poi)	C++17	100 / 100	220 ms	12148 KB

poi

#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct ct{
	ll pt,sd,id;
};
ct x[2005];
ll n,t,me,i,j,p[2005];
bool a[2005][2005];
bool cmp(ct a,ct b){
	if(a.pt==b.pt && a.sd==b.sd) return a.id<b.id;
	if(a.pt==b.pt) return a.sd>b.sd;
	return a.pt>b.pt;
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> t >> me;
	for(i=1;i<=n;i++)
	for(j=1;j<=t;j++){
		cin >> a[i][j];
		if(!a[i][j]) p[j]++;
	}
	for(i=1;i<=n;i++){
		x[i].id=i;
		for(j=1;j<=t;j++){
			if(a[i][j]){
				x[i].sd++;
				x[i].pt+=p[j];
			}
		}
	}
	sort(x+1,x+n+1,cmp);
	for(i=1;i<=n;i++){
		if(x[i].id==me){
			cout << x[i].pt << " " << i;
			return 0;
		}
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	468 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	456 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	1 ms	2664 KB	Output is correct
10	Correct	2 ms	2652 KB	Output is correct
11	Correct	7 ms	2908 KB	Output is correct
12	Correct	12 ms	2908 KB	Output is correct
13	Correct	33 ms	3676 KB	Output is correct
14	Correct	49 ms	4460 KB	Output is correct
15	Correct	83 ms	5756 KB	Output is correct
16	Correct	90 ms	6132 KB	Output is correct
17	Correct	133 ms	8016 KB	Output is correct
18	Correct	152 ms	9468 KB	Output is correct
19	Correct	198 ms	11356 KB	Output is correct
20	Correct	220 ms	12148 KB	Output is correct