# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
940869 |
2024-03-07T20:55:41 Z |
HappyCapybara |
Poi (IOI09_poi) |
C++17 |
|
470 ms |
24176 KB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, t, p;
cin >> n >> t >> p;
vector<int> st(t, n);
vector<vector<int>> ts(n);
for (int i=0; i<n; i++){
for (int j=0; j<t; j++){
int x;
cin >> x;
ts[i].push_back(x);
if (x) st[j]--;
}
}
vector<pair<int, pair<int,int>>> scores;
for (int i=0; i<n; i++){
int score = 0, tasks = 0;
for (int j=0; j<t; j++){
if (ts[i][j]){
tasks++;
score += st[j];
}
}
scores.push_back({score, {tasks, -i}});
}
sort(scores.begin(), scores.end());
//for (pair<int,pair<int,int>> v : scores) cout << v.first << " " << v.second.first << " " << -v.second.second << "\n";
for (int i=0; i<n; i++){
if (-scores[i].second.second == p-1){
cout << scores[i].first << " " << n-i << "\n";
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
708 KB |
Output is correct |
11 |
Correct |
15 ms |
1116 KB |
Output is correct |
12 |
Correct |
25 ms |
1616 KB |
Output is correct |
13 |
Correct |
70 ms |
4436 KB |
Output is correct |
14 |
Correct |
101 ms |
5992 KB |
Output is correct |
15 |
Correct |
180 ms |
12884 KB |
Output is correct |
16 |
Correct |
198 ms |
13872 KB |
Output is correct |
17 |
Correct |
292 ms |
17096 KB |
Output is correct |
18 |
Correct |
323 ms |
19284 KB |
Output is correct |
19 |
Correct |
427 ms |
23564 KB |
Output is correct |
20 |
Correct |
470 ms |
24176 KB |
Output is correct |