# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
210714 |
2020-03-18T06:43:38 Z |
socho |
Poi (IOI09_poi) |
C++14 |
|
852 ms |
15992 KB |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, t, f;
cin >> n >> t >> f;
int score[t];
memset(score, 0, sizeof score);
int by[n][t];
vector<pair<int, pair<int, int> > > vc; // score, solves, -id
for (int i=0; i<n; i++) {
for (int j=0; j<t; j++) {
cin >> by[i][j];
if (by[i][j] == 0) score[j]++;
}
}
for (int i=0; i<n; i++) {
int person_solve = 0;
int person_score = 0;
for (int j=0; j<t; j++) {
if (by[i][j]) {
person_solve++;
person_score += score[j];
}
}
vc.push_back(make_pair(person_score, make_pair(person_solve, -i-1)));
}
sort(vc.begin(), vc.end());
reverse(vc.begin(), vc.end());
for (int i=0; i<n; i++) {
if (vc[i].second.second == -f) {
cout << vc[i].first << ' ' << i + 1 << endl;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
6 ms |
376 KB |
Output is correct |
8 |
Correct |
6 ms |
376 KB |
Output is correct |
9 |
Correct |
8 ms |
376 KB |
Output is correct |
10 |
Correct |
11 ms |
376 KB |
Output is correct |
11 |
Correct |
31 ms |
760 KB |
Output is correct |
12 |
Correct |
47 ms |
1144 KB |
Output is correct |
13 |
Correct |
129 ms |
2680 KB |
Output is correct |
14 |
Correct |
194 ms |
3704 KB |
Output is correct |
15 |
Correct |
322 ms |
6264 KB |
Output is correct |
16 |
Correct |
356 ms |
6708 KB |
Output is correct |
17 |
Correct |
514 ms |
9720 KB |
Output is correct |
18 |
Correct |
570 ms |
11000 KB |
Output is correct |
19 |
Correct |
779 ms |
14456 KB |
Output is correct |
20 |
Correct |
852 ms |
15992 KB |
Output is correct |