Submission #963310

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
963310	2024-04-14T20:36:50 Z	anango	Poi (IOI09_poi)	C++17	100 / 100	520 ms	32204 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<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);
	vector<int> tasks(n,0);
	for (int i=0; i<n; i++) {
		for (int j=0; j<t; j++) {
			if (solves[j][i])score[i]+=points[j];
			if (solves[j][i])tasks[i]++;
		}
		//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];
		}
		if (tasks[x]!=tasks[y]) {
			return tasks[x]>tasks[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

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	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	4 ms	604 KB	Output is correct
11	Correct	15 ms	1400 KB	Output is correct
12	Correct	25 ms	1884 KB	Output is correct
13	Correct	91 ms	5132 KB	Output is correct
14	Correct	101 ms	7104 KB	Output is correct
15	Correct	186 ms	12400 KB	Output is correct
16	Correct	210 ms	13444 KB	Output is correct
17	Correct	312 ms	19456 KB	Output is correct
18	Correct	380 ms	22128 KB	Output is correct
19	Correct	472 ms	29100 KB	Output is correct
20	Correct	520 ms	32204 KB	Output is correct