# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962578 | 2024-04-13T21:07:11 Z | starchan | Poi (IOI09_poi) | C++17 | 211 ms | 31804 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define in array<int, 2> #define f first #define s second #define pb push_back #define pob pop_back #define INF (int)1e17 #define MX (int)3e5+5 #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) signed main() { fast(); int n, t, p; cin >> n >> t >> p; p--; int a[n][t]; int b[n][t]; int d[t]; for(int i = 0; i < t; i++) d[i] = 0; array<int, 3> sc[n]; for(int i = 0; i < n; i++) { sc[i][0] = sc[i][1] = 0; for(int j = 0; j < t; j++) { cin >> a[i][j]; if(!a[i][j]) d[j]++; sc[i][1]-=a[i][j]; } sc[i][2] = i; } for(int i = 0; i < n; i++) { for(int j = 0; j < t; j++) { cin >> a[i][j]; if(a[i][j]) sc[i][0]-=d[j]; } } sort(sc, sc+n); for(int i = 0; i < n; i++) { if(sc[i][2] == p) cout << (-sc[i][0]) << " " << (i+1) << "\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 456 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 432 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 3 ms | 604 KB | Output is correct |
11 | Correct | 7 ms | 1372 KB | Output is correct |
12 | Correct | 11 ms | 1884 KB | Output is correct |
13 | Correct | 36 ms | 4956 KB | Output is correct |
14 | Correct | 46 ms | 7000 KB | Output is correct |
15 | Correct | 86 ms | 12124 KB | Output is correct |
16 | Correct | 90 ms | 13184 KB | Output is correct |
17 | Correct | 127 ms | 19032 KB | Output is correct |
18 | Correct | 149 ms | 21772 KB | Output is correct |
19 | Correct | 191 ms | 28664 KB | Output is correct |
20 | Correct | 211 ms | 31804 KB | Output is correct |