Submission #651124

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
651124	2022-10-17T09:19:03 Z	ymm	Poi (IOI09_poi)	C++17	100 / 100	249 ms	4564 KB

poi

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 2048;
int n, t, p; // network time protocol
int task_cnt_solved[N];
int par_cnt_solved[N];
int par_sum_solved[N];
bool solved_par_task[N][N];
int ids[N];

bool cmp(int i, int j)
{
	if (par_sum_solved[i] > par_sum_solved[j])
		return 1;
	if (par_sum_solved[i] < par_sum_solved[j])
		return 0;
	if (par_cnt_solved[i] > par_cnt_solved[j])
		return 1;
	if (par_cnt_solved[i] < par_cnt_solved[j])
		return 0;
	return i < j;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n >> t >> p; --p;
	Loop (par,0,n) Loop (task,0,t) {
		int x;
		cin >> x;
		task_cnt_solved[task] += x;
		par_cnt_solved[par] += x;
		solved_par_task[par][task] = x;
	}
	Loop (par,0,n) Loop (task,0,t) {
		if (solved_par_task[par][task])
			par_sum_solved[par] += n - task_cnt_solved[task];
	}
	iota(ids, ids+n, 0);
	sort(ids, ids+n, cmp);
	int ans = 0;
	for (; ids[ans] != p; ++ans);
	cout << par_sum_solved[p] << ' ' << ans+1 << '\n';
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	2 ms	468 KB	Output is correct
10	Correct	3 ms	724 KB	Output is correct
11	Correct	7 ms	980 KB	Output is correct
12	Correct	13 ms	1456 KB	Output is correct
13	Correct	39 ms	1816 KB	Output is correct
14	Correct	52 ms	2436 KB	Output is correct
15	Correct	95 ms	2748 KB	Output is correct
16	Correct	91 ms	3020 KB	Output is correct
17	Correct	139 ms	3364 KB	Output is correct
18	Correct	170 ms	3860 KB	Output is correct
19	Correct	249 ms	4564 KB	Output is correct
20	Correct	219 ms	4448 KB	Output is correct