Submission #931466

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931466	2024-02-21T21:10:34 Z	emad234	Poi (IOI09_poi)	C++17	70 / 100	455 ms	19288 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

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	4444 KB	Output isn't correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Incorrect	1 ms	4444 KB	Output isn't correct
5	Correct	1 ms	6492 KB	Output is correct
6	Correct	1 ms	6492 KB	Output is correct
7	Correct	2 ms	6492 KB	Output is correct
8	Correct	2 ms	6492 KB	Output is correct
9	Correct	3 ms	6492 KB	Output is correct
10	Correct	5 ms	6492 KB	Output is correct
11	Correct	15 ms	8540 KB	Output is correct
12	Incorrect	24 ms	8760 KB	Output isn't correct
13	Incorrect	69 ms	10832 KB	Output isn't correct
14	Correct	96 ms	12884 KB	Output is correct
15	Incorrect	172 ms	14952 KB	Output isn't correct
16	Correct	186 ms	15184 KB	Output is correct
17	Correct	272 ms	16976 KB	Output is correct
18	Correct	309 ms	19048 KB	Output is correct
19	Incorrect	401 ms	19028 KB	Output isn't correct
20	Correct	455 ms	19288 KB	Output is correct