# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
885062 |
2023-12-09T00:31:26 Z |
Matjaz |
Poi (IOI09_poi) |
C++14 |
|
492 ms |
23876 KB |
//
// POIIOI2009.cpp
//
//
// Created by Matjaz Leonardis on 09/12/2023.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,T,P;
int main(){
cin >> N >> T >> P;
vector<vector<int> > raw_score(N, vector<int> (T));
vector<int> weight(T);
vector<int> tasks_solved(N);
for (int i=0;i<N;i++){
for (int j=0;j<T;j++) {
cin >> raw_score[i][j];
if (raw_score[i][j] == 0) weight[j]++; else tasks_solved[i]++;
}
}
vector<int> final_score(N);
for (int i=0;i<N;i++){
for (int j=0;j<T;j++) if (raw_score[i][j]) final_score[i] += weight[j];
}
vector<pair<pair<int,int>, int> > rank;
for (int i=0;i<N;i++){
rank.push_back(make_pair(make_pair(final_score[i], tasks_solved[i]), -i));
}
sort(rank.rbegin(), rank.rend());
for (int i=0;i<N;i++){
if (rank[i].second == - P + 1){
cout << rank[i].first.first << " " << i + 1 << endl;
break;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
432 KB |
Output is correct |
3 |
Correct |
0 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
612 KB |
Output is correct |
11 |
Correct |
15 ms |
1112 KB |
Output is correct |
12 |
Correct |
24 ms |
1628 KB |
Output is correct |
13 |
Correct |
73 ms |
3928 KB |
Output is correct |
14 |
Correct |
106 ms |
5460 KB |
Output is correct |
15 |
Correct |
182 ms |
9296 KB |
Output is correct |
16 |
Correct |
200 ms |
9812 KB |
Output is correct |
17 |
Correct |
298 ms |
14476 KB |
Output is correct |
18 |
Correct |
331 ms |
16372 KB |
Output is correct |
19 |
Correct |
452 ms |
21504 KB |
Output is correct |
20 |
Correct |
492 ms |
23876 KB |
Output is correct |