Submission #720704

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
720704	2023-04-09T04:19:04 Z	PenguinsAreCute	Poi (IOI09_poi)	C++17	100 / 100	608 ms	6084 KB

poi

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
int32_t main() {
	int N, T, P; cin >> N >> T >> P; bool solved[N][T]; int score[T]; vector<iii> scores;
	for(int i = 0; i < N; i++) for(int j = 0; j < T; j++) cin >> solved[i][j];
	for(int i = 0; i < T; i++) {
		score[i] = 0; for(int j = 0; j < N; j++) if(!solved[j][i]) score[i]++;
	}
	for(int i = 0; i < N; i++) {
		int curScore = 0, solvedProblems = 0;
		for(int j = 0; j < T; j++) if(solved[i][j]) {curScore += score[j]; solvedProblems++;}
		scores.push_back(iii(curScore, ii(solvedProblems, N - i)));
	}
	sort(scores.begin(), scores.end(), greater<iii>());
	for(int i = 0; i < N; i++) {
		if(N - scores[i].second.second == P - 1) cout << scores[i].first << " " << i + 1;
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 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	300 KB	Output is correct
7	Correct	2 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	380 KB	Output is correct
11	Correct	19 ms	596 KB	Output is correct
12	Correct	34 ms	848 KB	Output is correct
13	Correct	96 ms	1704 KB	Output is correct
14	Correct	133 ms	2024 KB	Output is correct
15	Correct	239 ms	2748 KB	Output is correct
16	Correct	250 ms	2908 KB	Output is correct
17	Correct	364 ms	4524 KB	Output is correct
18	Correct	424 ms	4820 KB	Output is correct
19	Correct	557 ms	5644 KB	Output is correct
20	Correct	608 ms	6084 KB	Output is correct