Submission #659777

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
659777	2022-11-19T09:16:39 Z	Tob	Poi (IOI09_poi)	C++14	100 / 100	524 ms	16084 KB

poi

#include <bits/stdc++.h>

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

const int N = 2007;

struct dat {
	int pts, sl, id;
};

int n, t, p;
int mat[N][N];
int pt[N], cpt[N], slv[N];

bool cmp(dat a, dat b) {
	if (a.pts != b.pts) return a.pts > b.pts;
	if (a.sl != b.sl) return a.sl > b.sl;
	return a.id < b.id;
}

int main () {
	cin >> n >> t >> p;
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			cin >> mat[i][j];
			pt[j] += (mat[i][j] ^ 1);
			slv[i] += mat[i][j];
		}
	}
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			cpt[i] += pt[j] * mat[i][j];
		}
	}
	
	vector <dat> v;
	
	for (int i = 1; i <= n; i++) {
		v.pb({cpt[i], slv[i], i});
	}
	
	sort(all(v), cmp);
	
	cout << cpt[p] << " ";
	
	for (int i = 0; i < n; i++) {
		if (v[i].id == p) {
			cout << i+1;
		}
	}
	
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	480 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	3 ms	724 KB	Output is correct
10	Correct	5 ms	1236 KB	Output is correct
11	Correct	17 ms	1932 KB	Output is correct
12	Correct	28 ms	3028 KB	Output is correct
13	Correct	87 ms	5364 KB	Output is correct
14	Correct	115 ms	7648 KB	Output is correct
15	Correct	197 ms	9720 KB	Output is correct
16	Correct	216 ms	10488 KB	Output is correct
17	Correct	316 ms	12108 KB	Output is correct
18	Correct	358 ms	13720 KB	Output is correct
19	Correct	472 ms	16084 KB	Output is correct
20	Correct	524 ms	15976 KB	Output is correct