Submission #631641

# Submission time Handle Problem Language Result Execution time Memory
631641 2022-08-18T10:59:58 Z PolishFighter Poi (IOI09_poi) C++17
70 / 100
255 ms 4272 KB
#include<bits/stdc++.h>

using namespace std;

constexpr int MAXN = 2e3 + 10;

int points[MAXN];
bool 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;
	p--;
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; 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= 0; i < t; i++)
	{
		if(contestants[p][i])
		{
			philips_t++;
			philips_p += points[i];
		}
	}
	
	int philips_r = 1;
	int points2;
	int t2;
	for(int i = 0; i < n ; i++)
	{
		if(i == p)
			continue;
		t2 = 0;
		points2 = 0;


		for(int j = 0; j < t; j++)
		{
			if(contestants[i][j])
			{
				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 0 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 1 ms 468 KB Output isn't correct
8 Incorrect 1 ms 468 KB Output isn't correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 8 ms 852 KB Output is correct
12 Correct 18 ms 1320 KB Output is correct
13 Incorrect 39 ms 1648 KB Output isn't correct
14 Correct 54 ms 2204 KB Output is correct
15 Incorrect 96 ms 2680 KB Output isn't correct
16 Correct 105 ms 2876 KB Output is correct
17 Correct 157 ms 3236 KB Output is correct
18 Correct 174 ms 3540 KB Output is correct
19 Correct 230 ms 4272 KB Output is correct
20 Correct 255 ms 4172 KB Output is correct