Submission #937865

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
937865	2024-03-04T15:45:43 Z	Muaath_5	Poi (IOI09_poi)	C++17	5 / 100	184 ms	23892 KB

poi

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

using namespace std;

const int N = 2000 + 1;

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

struct contestant {
	int id;
	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];
			c[i].count++;
			if (solved[i][j])
				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 <= n; j++) {
			if (solved[i][j])
				c[i].score += points[j];
		}
	}
	sort(c, c + n);
	reverse(c, c + n);
	for (int i = 1; i <= n; i++) {
		if (c[i].id == p) {
			cout << c[i].score << ' ' << i << '\n';
			return 0;
		}
	}
}

Subtask #1

5.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Incorrect	0 ms	484 KB	Output isn't correct
3	Incorrect	1 ms	348 KB	Output isn't correct
4	Incorrect	1 ms	344 KB	Output isn't correct
5	Incorrect	2 ms	2396 KB	Output isn't correct
6	Incorrect	1 ms	2396 KB	Output isn't correct
7	Incorrect	1 ms	2540 KB	Output isn't correct
8	Incorrect	1 ms	2396 KB	Output isn't correct
9	Incorrect	1 ms	2652 KB	Output isn't correct
10	Incorrect	2 ms	2668 KB	Output isn't correct
11	Incorrect	6 ms	4848 KB	Output isn't correct
12	Incorrect	15 ms	4956 KB	Output isn't correct
13	Incorrect	28 ms	7764 KB	Output isn't correct
14	Incorrect	47 ms	10332 KB	Output isn't correct
15	Incorrect	70 ms	13672 KB	Output isn't correct
16	Incorrect	76 ms	13804 KB	Output isn't correct
17	Incorrect	112 ms	17744 KB	Output isn't correct
18	Incorrect	126 ms	20184 KB	Output isn't correct
19	Correct	166 ms	23012 KB	Output is correct
20	Incorrect	184 ms	23892 KB	Output isn't correct