Submission #631630

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
631630	2022-08-18T10:45:17 Z	PolishFighter	Poi (IOI09_poi)	C++17	70 / 100	268 ms	6272 KB

poi

#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;

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


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


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

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

	return 0;
}

Subtask #1

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Incorrect	1 ms	340 KB	Output isn't correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	1 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	464 KB	Output isn't correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	4 ms	724 KB	Output is correct
11	Correct	10 ms	1112 KB	Output is correct
12	Correct	18 ms	1620 KB	Output is correct
13	Incorrect	43 ms	2768 KB	Output isn't correct
14	Correct	59 ms	3928 KB	Output is correct
15	Incorrect	100 ms	4632 KB	Output isn't correct
16	Correct	108 ms	4816 KB	Output is correct
17	Correct	178 ms	5236 KB	Output is correct
18	Correct	182 ms	5660 KB	Output is correct
19	Correct	233 ms	6220 KB	Output is correct
20	Correct	268 ms	6272 KB	Output is correct