Submission #631645

# Submission time Handle Problem Language Result Execution time Memory
631645 2022-08-18T11:10:08 Z PolishFighter Poi (IOI09_poi) C++17
70 / 100
219 ms 16052 KB
#include<bits/stdc++.h>

using namespace std;

constexpr int MAXN = 2e3 + 10;

int points[MAXN];
int contestants[MAXN][MAXN];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n, t, p;
	cin >> n >> t >> p;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= t; j++)
		{
			cin >> contestants[i][j];
			if(contestants[i][j] == 0)
			{
				points[j]++;
			}
		}
	}

	int philips_p = 0;
	int philips_t = 0;
	for(int i = 1; i <= t; i++)
	{
		if(contestants[p][i] == 1)
		{
			philips_t++;
			philips_p += points[i];
		}
	}
	
	int philips_r = 1;
	int points2;
	int t2;
	for(int i = 1; i <= n ; i++)
	{
		if(i == p)
			continue;
		t2 = 0;
		points2 = 0;


		for(int j = 1; j <= t; j++)
		{
			if(contestants[i][j] == 1)
			{
				t2++;
				points2 += points[j];
			}
		}


		if(points2 > philips_p || (points2 == philips_p && (i < p || t2 > philips_t)))
		{
			philips_r++;
		}
	}

	cout << philips_p << " " << philips_r << "\n";

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Incorrect 1 ms 596 KB Output isn't correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 3 ms 1236 KB Output is correct
11 Correct 7 ms 2004 KB Output is correct
12 Correct 11 ms 3084 KB Output is correct
13 Incorrect 34 ms 5456 KB Output isn't correct
14 Correct 55 ms 7676 KB Output is correct
15 Incorrect 85 ms 9764 KB Output isn't correct
16 Correct 89 ms 10440 KB Output is correct
17 Correct 130 ms 12040 KB Output is correct
18 Correct 145 ms 13644 KB Output is correct
19 Correct 202 ms 16052 KB Output is correct
20 Correct 219 ms 15940 KB Output is correct