Submission #757896

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
757896	2023-06-14T00:27:29 Z	SanguineChameleon	Poi (IOI09_poi)	C++17	100 / 100	225 ms	24040 KB

poi

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

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 2e3 + 20;
int a[maxn][maxn];
int cnt[maxn];
int score[maxn];
int solve[maxn];
int order[maxn];
int pos[maxn];

bool cmp(int x, int y) {
	if (score[x] != score[y]) {
		return score[x] > score[y];
	}
	else if (solve[x] != solve[y]) {
		return solve[x] > solve[y];
	}
	else {
		return x < y;
	}
}

void just_do_it() {
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
			if (a[i][j] == 0) {
				cnt[j]++;
			}
			else {
				solve[i]++;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j]) {
				score[i] += cnt[j];
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		order[i] = i;
	}
	sort(order + 1, order + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		pos[order[i]] = i;
	}
	cout << score[k] << " " << pos[k];
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	548 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	2 ms	724 KB	Output is correct
10	Correct	3 ms	1236 KB	Output is correct
11	Correct	8 ms	2132 KB	Output is correct
12	Correct	13 ms	3540 KB	Output is correct
13	Correct	35 ms	6520 KB	Output is correct
14	Correct	48 ms	9292 KB	Output is correct
15	Correct	88 ms	12684 KB	Output is correct
16	Correct	93 ms	13764 KB	Output is correct
17	Correct	133 ms	17016 KB	Output is correct
18	Correct	165 ms	19188 KB	Output is correct
19	Correct	208 ms	23260 KB	Output is correct
20	Correct	225 ms	24040 KB	Output is correct