# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
406383 |
2021-05-17T13:54:51 Z |
saarang123 |
Poi (IOI09_poi) |
C++17 |
|
337 ms |
23836 KB |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
signed main() {
std::ios::sync_with_stdio(0);
std::cout.tie(0);
std::cin.tie(0);
int n, t, p;
cin >> n >> t >> p;
vector<int> scores(t, n);
vector<vector<int>> a(n, vector<int> (t));
for(int i = 0; i < n; i++)
for(int j = 0; j < t; j++) {
cin >> a[i][j];
scores[j] -= a[i][j];
}
vector<array<int, 3>> rank;
for(int i = 0; i < n; i++) {
int sum = 0, cnt = 0;
for(int j = 0; j < t; j++)
if(a[i][j])
sum += scores[j], cnt++;
rank.push_back({sum, cnt, i + 1});
}
sort(rank.begin(), rank.end(), [&] (array<int, 3> x, array<int, 3> y) {
if(x[0] != y[0])
return x[0] > y[0];
if(x[1] != y[1])
return x[1] > y[1];
return x[2] < y[2];
});
int position = -1, sum = 0;
for(int i = 0; i < n; i++)
if(rank[i][2] == p)
position = i + 1, sum = rank[i][0];
cout << sum << ' ' << position << '\n';
return 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 |
320 KB |
Output is correct |
5 |
Correct |
1 ms |
316 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
2 ms |
328 KB |
Output is correct |
8 |
Correct |
2 ms |
332 KB |
Output is correct |
9 |
Correct |
2 ms |
332 KB |
Output is correct |
10 |
Correct |
3 ms |
460 KB |
Output is correct |
11 |
Correct |
11 ms |
972 KB |
Output is correct |
12 |
Correct |
18 ms |
1488 KB |
Output is correct |
13 |
Correct |
52 ms |
3784 KB |
Output is correct |
14 |
Correct |
71 ms |
5352 KB |
Output is correct |
15 |
Correct |
125 ms |
9148 KB |
Output is correct |
16 |
Correct |
136 ms |
9908 KB |
Output is correct |
17 |
Correct |
198 ms |
14476 KB |
Output is correct |
18 |
Correct |
219 ms |
16252 KB |
Output is correct |
19 |
Correct |
299 ms |
21512 KB |
Output is correct |
20 |
Correct |
337 ms |
23836 KB |
Output is correct |