# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
231695 |
2020-05-14T13:03:40 Z |
AlexLuchianov |
Poi (IOI09_poi) |
C++14 |
|
260 ms |
23800 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 2000;
int v[1 + nmax][1 + nmax];
int score[1 + nmax];
struct Person{
int id;
int score;
int problems;
bool operator < (Person const &a) const {
if(score != a.score)
return score > a.score;
else if(problems != a.problems)
return problems > a.problems;
else
return id < a.id;
}
} lst[1 + nmax];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, p;
cin >> n >> k >> p;
for(int i = 1; i <= k; i++)
score[i] = n;
for(int i = 1; i <= n; i++)
for(int j = 1;j <= k; j++) {
cin >> v[i][j];
score[j] -= v[i][j];
}
for(int i = 1;i <= n; i++){
lst[i] = {i, 0, 0};
for(int j = 1;j <= k; j++) {
lst[i].problems += v[i][j];
lst[i].score += score[j] * v[i][j];
}
}
sort(lst + 1, lst + n + 1);
for(int i = 1;i <= n; i++)
if(lst[i].id == p){
cout << lst[i].score << " " << i << '\n';
return 0;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
512 KB |
Output is correct |
6 |
Correct |
5 ms |
640 KB |
Output is correct |
7 |
Correct |
5 ms |
640 KB |
Output is correct |
8 |
Correct |
5 ms |
768 KB |
Output is correct |
9 |
Correct |
6 ms |
896 KB |
Output is correct |
10 |
Correct |
7 ms |
1280 KB |
Output is correct |
11 |
Correct |
13 ms |
2304 KB |
Output is correct |
12 |
Correct |
18 ms |
3584 KB |
Output is correct |
13 |
Correct |
44 ms |
6648 KB |
Output is correct |
14 |
Correct |
62 ms |
9336 KB |
Output is correct |
15 |
Correct |
126 ms |
12724 KB |
Output is correct |
16 |
Correct |
101 ms |
13688 KB |
Output is correct |
17 |
Correct |
170 ms |
16856 KB |
Output is correct |
18 |
Correct |
169 ms |
18936 KB |
Output is correct |
19 |
Correct |
242 ms |
23032 KB |
Output is correct |
20 |
Correct |
260 ms |
23800 KB |
Output is correct |