Submission #402009

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
402009	2021-05-11T07:31:30 Z	Azimjon	Poi (IOI09_poi)	C++17	100 / 100	315 ms	31724 KB

poi

// Muallif: Azimjon Mehmonali o'g'li

#include <bits/stdc++.h>

using namespace std;

#define int long long

const long double PI = 3.1415926535897;
const int mod = 1000000007LL;
const int INF = 1e18;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, t, p;
	cin >> n >> t >> p;

	vector<vector<int>> g(n + 1, vector<int>(t + 1));
	vector<int> tq(t + 1, n);

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			cin >> g[i][j];

			tq[j] -= g[i][j];
		}
	}

	vector<pair<pair<int, int>, int>> v;
	for (int i = 1; i <= n; i++) {
		int imq = 0, ims = 0;
		for (int j = 1; j <= t; j++) {
			ims += g[i][j];
			imq += g[i][j] * tq[j];
		}

		v.push_back({{-imq, -ims}, i});
	}

	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++) {
		if (v[i].second == p) {
			cout << -v[i].first.first << " " << i + 1 << endl;
			return 0;
		}
	}

	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	448 KB	Output is correct
10	Correct	3 ms	588 KB	Output is correct
11	Correct	10 ms	1484 KB	Output is correct
12	Correct	17 ms	2252 KB	Output is correct
13	Correct	48 ms	5752 KB	Output is correct
14	Correct	69 ms	7768 KB	Output is correct
15	Correct	122 ms	15036 KB	Output is correct
16	Correct	130 ms	13596 KB	Output is correct
17	Correct	190 ms	19544 KB	Output is correct
18	Correct	216 ms	21816 KB	Output is correct
19	Correct	291 ms	28588 KB	Output is correct
20	Correct	315 ms	31724 KB	Output is correct