Submission #963307

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
963307	2024-04-14T20:35:33 Z	anango	Poi (IOI09_poi)	C++17	70 / 100	516 ms	31832 KB

poi

#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
	int n,t,p;
	cin >> n >> t >> p;
	p--;
	vector<int> tasks(n);
	vector<vector<int>> solves(t,vector<int>(n));
	vector<int> points(t,n);
	for (int i=0; i<n; i++) {
		for (int j=0; j<t; j++) {
			int x;
			cin >> x;
			if (x==1) solves[j][i]++;
			if (x==1) points[j]--;
		}
	}
	vector<int> score(n,0);
	for (int i=0; i<n; i++) {
		for (int j=0; j<t; j++) {
			if (solves[j][i])score[i]+=points[j];
		}
		//cout << score[i] <<" ";
	}
	vector<int> an;
	for (int i=0; i<n; i++) {
		an.push_back(i);
	}
	sort(an.begin(), an.end(), [=](const int x, const int y){
		if (score[x]!=score[y]) {
			return score[x]>score[y];
		}
		return x<y;
	});
	int c=-1;
	for (int i=0; i<n; i++) {
		if (an[i]==p) {
			c=i+1;
		}
	}
	cout << score[p] << " " << c << endl;
}

Subtask #1

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	344 KB	Output isn't correct
4	Incorrect	0 ms	344 KB	Output isn't correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Incorrect	1 ms	348 KB	Output isn't correct
8	Incorrect	1 ms	348 KB	Output isn't correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	4 ms	604 KB	Output is correct
11	Correct	15 ms	1372 KB	Output is correct
12	Correct	24 ms	2024 KB	Output is correct
13	Incorrect	80 ms	5132 KB	Output isn't correct
14	Correct	103 ms	7000 KB	Output is correct
15	Incorrect	186 ms	12220 KB	Output isn't correct
16	Correct	209 ms	13200 KB	Output is correct
17	Correct	301 ms	19296 KB	Output is correct
18	Correct	347 ms	21788 KB	Output is correct
19	Correct	455 ms	28960 KB	Output is correct
20	Correct	516 ms	31832 KB	Output is correct