Submission #937885

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
937885	2024-03-04T16:01:39 Z	Muaath_5	Poi (IOI09_poi)	C++17	100 / 100	187 ms	16208 KB

poi

#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>

using namespace std;

const int N = 2009;

int n, t, p;
int solved[N][N];
int points[N];

struct contestant {
	int id = 0;
	int score = 0;
	int count = 0;
	friend bool operator<(contestant a, contestant b) {
		if (a.score == b.score) {
			if (a.count == b.count) {
				return a.id > b.id;
			}
			return a.count < b.count;
		}
		return a.score < b.score;
	}
} c[N];

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> t >> p;
	for (int i = 1; i <= n; i++) {
		c[i].id = i;
		for (int j = 1; j <= t; j++) {
			cin >> solved[i][j];
			if (solved[i][j])
				c[i].count++, points[j]++;
		}
	}
	for (int j = 1; j <= t; j++)
		points[j] = n - points[j];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			if (solved[i][j])
				c[i].score += points[j];
		}
	}
	sort(c+1, c + n+1);
	reverse(c+1, c + n+1);
	for (int i = 1; i <= n; i++) {
		if (c[i].id == p) {
			cout << c[i].score << ' ' << i << '\n';
			return 0;
		}
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	2 ms	2396 KB	Output is correct
10	Correct	2 ms	2396 KB	Output is correct
11	Correct	7 ms	4700 KB	Output is correct
12	Correct	10 ms	4444 KB	Output is correct
13	Correct	30 ms	6748 KB	Output is correct
14	Correct	40 ms	8800 KB	Output is correct
15	Correct	71 ms	10836 KB	Output is correct
16	Correct	79 ms	10832 KB	Output is correct
17	Correct	113 ms	12884 KB	Output is correct
18	Correct	135 ms	14944 KB	Output is correct
19	Correct	176 ms	16208 KB	Output is correct
20	Correct	187 ms	15952 KB	Output is correct