Submission #393979

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
393979	2021-04-25T06:11:31 Z	Berted	Poi (IOI09_poi)	C++14	100 / 100	276 ms	23812 KB

poi

#include <iostream>

using namespace std;

int N, M, K, B[2001][2001], cnt[2001], A[2001][2];

int main()
{
	ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N >> M >> K; K--;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cin >> B[i][j];
			cnt[j] += !B[i][j];
		}
	}
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++) {A[i][0] += B[i][j] * cnt[j]; A[i][1] += B[i][j];}
	}
	
	int ans = 1;
	for (int i = 0; i < N; i++)
	{
		if (i == K) continue;
		ans += make_pair(A[i][0], make_pair(A[i][1], -i)) > make_pair(A[K][0], make_pair(A[K][1], -K));
	}

	cout << A[K][0] << " " << ans << "\n";

	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	2 ms	716 KB	Output is correct
10	Correct	3 ms	1232 KB	Output is correct
11	Correct	10 ms	2252 KB	Output is correct
12	Correct	15 ms	3404 KB	Output is correct
13	Correct	43 ms	6512 KB	Output is correct
14	Correct	65 ms	9348 KB	Output is correct
15	Correct	112 ms	12572 KB	Output is correct
16	Correct	113 ms	13608 KB	Output is correct
17	Correct	170 ms	16736 KB	Output is correct
18	Correct	193 ms	18948 KB	Output is correct
19	Correct	255 ms	23036 KB	Output is correct
20	Correct	276 ms	23812 KB	Output is correct