Submission #631128

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
631128	2022-08-17T17:39:57 Z	chinmoy_101	Poi (IOI09_poi)	C++14	100 / 100	574 ms	15980 KB

poi

#include "bits/stdc++.h"
using namespace std;
 
int main() {
	
	int n, t, f;
	cin >> n >> t >> f;
	
	int score[t];
	memset(score, 0, sizeof score);
	
	int by[n][t];
	
	vector<pair<int, pair<int, int> > > vc;
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<t; j++) {
			cin >> by[i][j];
			if (by[i][j] == 0) score[j]++;
		}
	}
	
	for (int i=0; i<n; i++) {
		
		int person_solve = 0;
		int person_score = 0;
		
		for (int j=0; j<t; j++) {
			if (by[i][j]) {
				person_solve++;
				person_score += score[j];
			}
		}
		
		vc.push_back(make_pair(person_score, make_pair(person_solve, -i-1)));
	
	}
	
	sort(vc.begin(), vc.end());
	reverse(vc.begin(), vc.end());
	
	for (int i=0; i<n; i++) {
		if (vc[i].second.second == -f) {
			cout << vc[i].first << ' ' << i + 1 << endl;
		}
	}
	
	
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	3 ms	340 KB	Output is correct
10	Correct	5 ms	340 KB	Output is correct
11	Correct	20 ms	724 KB	Output is correct
12	Correct	31 ms	980 KB	Output is correct
13	Correct	103 ms	2600 KB	Output is correct
14	Correct	119 ms	3616 KB	Output is correct
15	Correct	211 ms	6152 KB	Output is correct
16	Correct	223 ms	6684 KB	Output is correct
17	Correct	342 ms	9684 KB	Output is correct
18	Correct	407 ms	10932 KB	Output is correct
19	Correct	531 ms	14372 KB	Output is correct
20	Correct	574 ms	15980 KB	Output is correct