# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
761777 |
2023-06-20T09:19:03 Z |
Blagoj |
Poi (IOI09_poi) |
C++17 |
|
211 ms |
23756 KB |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()
struct T {
int score, tasks, id;
};
bool csort(T a, T b) {
if (a.score != b.score) return a.score > b.score;
if (a.tasks != b.tasks) return a.tasks > b.tasks;
return a.id < b.id;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, t, p;
cin >> n >> t >> p;
--p;
int val[t], solve[n][t];
memset(val, 0, sizeof(val));
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
cin >> solve[i][j];
val[j] += (solve[i][j] == 0);
}
}
vector<T> v;
for (int i = 0; i < n; i++) {
int sum = 0, tasks = 0;
for (int j = 0; j < t; j++) {
if (solve[i][j] == 1) {
tasks++;
sum += val[j];
}
}
v.push_back({sum, tasks, i});
}
sort(all(v), csort);
for (int i = 0; i < n; i++) {
if (v[i].id == p) {
cout << v[i].score << " " << i + 1;
return 0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
408 KB |
Output is correct |
10 |
Correct |
3 ms |
460 KB |
Output is correct |
11 |
Correct |
8 ms |
980 KB |
Output is correct |
12 |
Correct |
10 ms |
1492 KB |
Output is correct |
13 |
Correct |
28 ms |
3780 KB |
Output is correct |
14 |
Correct |
53 ms |
5320 KB |
Output is correct |
15 |
Correct |
70 ms |
9036 KB |
Output is correct |
16 |
Correct |
77 ms |
9852 KB |
Output is correct |
17 |
Correct |
114 ms |
14392 KB |
Output is correct |
18 |
Correct |
137 ms |
16324 KB |
Output is correct |
19 |
Correct |
191 ms |
21436 KB |
Output is correct |
20 |
Correct |
211 ms |
23756 KB |
Output is correct |