Submission #493862

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
493862	2021-12-13T08:41:43 Z	ahmeteren	Poi (IOI09_poi)	C++17	100 / 100	238 ms	23832 KB

poi

#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	// #ifndef ONLINE_JUDGE
	// 	freopen("in.txt", "r", stdin);
	// 	freopen("out.txt", "w", stdout);
	// #endif

	int n, k, p;
	cin >> n >> k >> p;

	vector<int> cnt(k);
	vector<vector<int>> vec(n, vector<int> (k, 0));
	vector<pair<pair<int, int>, int>> v;

	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < k; j++)
		{
			cin >> vec[i][j];

			if(vec[i][j] == 0)
				cnt[j]++;
		}
	}

	for(int i = 0; i < n; i++)
	{
		int puan = 0, say = 0;

		for(int j = 0; j < k; j++)
		{
			if(vec[i][j])
			{
				puan += cnt[j];
				say++;
			}
		}

		v.push_back({{puan, say}, -i});
	}

	sort(v.rbegin(), v.rend());

	for(int i = 0; i < n; i++)
	{
		if(-v[i].second == p - 1)
		{
			cout << v[i].first.first << " " << i + 1 << '\n';
			break;
		}
	}
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	8 ms	972 KB	Output is correct
12	Correct	11 ms	1484 KB	Output is correct
13	Correct	34 ms	3788 KB	Output is correct
14	Correct	50 ms	5308 KB	Output is correct
15	Correct	86 ms	9140 KB	Output is correct
16	Correct	98 ms	9888 KB	Output is correct
17	Correct	149 ms	14476 KB	Output is correct
18	Correct	153 ms	16248 KB	Output is correct
19	Correct	218 ms	21496 KB	Output is correct
20	Correct	238 ms	23832 KB	Output is correct