Submission #931465

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931465	2024-02-21T21:07:37 Z	emad234	Poi (IOI09_poi)	C++17	0 / 100	435 ms	19548 KB

poi

#include <bits/stdc++.h>
#define  ll long long
#define F first
#define S second
#define pii pair<int,int>
const int mod = 1e9 + 7;
const int mxN = 2e5 + 5;
using namespace std;
struct ranking{
	int score,num,id;
};
ranking ans[mxN];
bool operator<(ranking a,ranking b){
	return tie(a.score,a.num,a.id) < tie(b.score,b.num,b.id);
}
int p[mxN];
int a[2021][2021];
signed main(){
	int n,t,P;
	cin >>n>>t>>P;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= t;j++){
			cin >>a[i][j];
			if(!a[i][j]) p[j]++;
		}
	}
	for(int i = 1;i <= n;i++){
		ans[i].id = {i};
		for(int j = 1;j <= t;j++){
			ans[i].num += (a[i][j]);
			ans[i].score += (p[j] * a[i][j]);
		}
	}
	sort(ans + 1,ans + n + 1);
	for(int i = 1;i <= n;i++){
		if(ans[i].id == P){
			cout<<ans[i].score<<' '<<i;
			return 0;
		}
	}
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	4444 KB	Output isn't correct
2	Incorrect	1 ms	4444 KB	Output isn't correct
3	Incorrect	1 ms	4444 KB	Output isn't correct
4	Incorrect	1 ms	4444 KB	Output isn't correct
5	Incorrect	1 ms	6492 KB	Output isn't correct
6	Incorrect	1 ms	6492 KB	Output isn't correct
7	Incorrect	2 ms	6492 KB	Output isn't correct
8	Incorrect	2 ms	6492 KB	Output isn't correct
9	Incorrect	3 ms	6492 KB	Output isn't correct
10	Incorrect	4 ms	6488 KB	Output isn't correct
11	Incorrect	14 ms	8540 KB	Output isn't correct
12	Incorrect	23 ms	8764 KB	Output isn't correct
13	Incorrect	67 ms	10836 KB	Output isn't correct
14	Incorrect	94 ms	12884 KB	Output isn't correct
15	Incorrect	165 ms	14928 KB	Output isn't correct
16	Incorrect	177 ms	14928 KB	Output isn't correct
17	Incorrect	266 ms	17236 KB	Output isn't correct
18	Incorrect	299 ms	19056 KB	Output isn't correct
19	Incorrect	399 ms	19548 KB	Output isn't correct
20	Incorrect	435 ms	19548 KB	Output isn't correct