Submission #366747

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
366747	2021-02-15T09:03:05 Z	kostia244	Poi (IOI09_poi)	C++17	100 / 100	279 ms	24044 KB

poi

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
const int maxn = 2020;
int n, m, p, score[maxn], val[maxn], cnt[maxn], a[maxn][maxn];
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m >> p;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++) {
			cin >> a[i][j], 
			val[j] += !a[i][j], 
			cnt[i] += a[i][j];
		}
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			score[i] += val[j]*a[i][j];
	vector<array<int, 3>> f(n);
	for(int i = 0; i < n; i++) f[i] = {-score[i], -cnt[i], i};
	sort(all(f));
	int ans = 0;--p;
	while(f[ans][2] != p) ans++;
	cout << -f[ans][0] << " " << ans+1 << '\n';
} 

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	620 KB	Output is correct
7	Correct	1 ms	620 KB	Output is correct
8	Correct	1 ms	748 KB	Output is correct
9	Correct	2 ms	876 KB	Output is correct
10	Correct	3 ms	1388 KB	Output is correct
11	Correct	10 ms	2284 KB	Output is correct
12	Correct	16 ms	3564 KB	Output is correct
13	Correct	45 ms	6636 KB	Output is correct
14	Correct	63 ms	9344 KB	Output is correct
15	Correct	107 ms	12780 KB	Output is correct
16	Correct	116 ms	13804 KB	Output is correct
17	Correct	171 ms	17132 KB	Output is correct
18	Correct	197 ms	19180 KB	Output is correct
19	Correct	252 ms	23320 KB	Output is correct
20	Correct	279 ms	24044 KB	Output is correct