# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239127 | 2020-06-14T14:04:03 Z | T0p_ | Poi (IOI09_poi) | C++14 | 425 ms | 24144 KB |
#include<bits/stdc++.h> using namespace std; struct DATA { int score, num, no; bool operator < (const DATA & o) const{ return (score != o.score) ? score < o.score : ((num != o.num) ? num < o.num : no > o.no); } }; int result[2020][2020], score[2020], point[2020], sum[2020]; priority_queue<DATA> heap; int main() { int n, t, p; scanf(" %d %d %d",&n,&t,&p); for(int i=1 ; i<=t ; i++) score[i] = n; for(int i=1 ; i<=n ; i++) for(int j=1 ; j<=t ; j++) { scanf(" %d",&result[i][j]); score[j] -= result[i][j]; } for(int i=1 ; i<=n ; i++) for(int j=1 ; j<=t ; j++) { point[i] += score[j] * result[i][j]; sum[i] += result[i][j]; } for(int i=1 ; i<=n ; i++) heap.push({point[i], sum[i], i}); for(int i=1 ; i<=n ; i++) { if(heap.top().no == p) { printf("%d %d\n",heap.top().score, i); return 0; } heap.pop(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 512 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 5 ms | 512 KB | Output is correct |
6 | Correct | 5 ms | 512 KB | Output is correct |
7 | Correct | 6 ms | 640 KB | Output is correct |
8 | Correct | 5 ms | 768 KB | Output is correct |
9 | Correct | 6 ms | 768 KB | Output is correct |
10 | Correct | 10 ms | 1408 KB | Output is correct |
11 | Correct | 19 ms | 2304 KB | Output is correct |
12 | Correct | 27 ms | 3576 KB | Output is correct |
13 | Correct | 70 ms | 6648 KB | Output is correct |
14 | Correct | 98 ms | 9336 KB | Output is correct |
15 | Correct | 160 ms | 12792 KB | Output is correct |
16 | Correct | 176 ms | 13944 KB | Output is correct |
17 | Correct | 259 ms | 16888 KB | Output is correct |
18 | Correct | 286 ms | 19320 KB | Output is correct |
19 | Correct | 391 ms | 23416 KB | Output is correct |
20 | Correct | 425 ms | 24144 KB | Output is correct |