# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
771912 |
2023-07-03T11:45:59 Z |
cnastea |
Poi (IOI09_poi) |
C++14 |
|
471 ms |
15960 KB |
#include <bits/stdc++.h>
using namespace std;
vector<int> r(2000), s(2000);
bool f(int k, int l){
if(r[k] > r[l]) return 1;
if(r[k] < r[l]) return 0;
if(s[k] > s[l]) return 1;
if(s[k] < s[l]) return 0;
if(k > l) return 0;
if(k < l) return 1;
}
int main()
{
int n, t, p;
cin >> n >> t >> p;
int a[n][t];
vector<int> q(t);
for(int i = 0; i < n; i++){
for(int j = 0; j < t; j++){
cin >> a[i][j];
if(a[i][j] == 0) q[j]++;
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < t; j++){
if(a[i][j] == 1){
r[i] += q[j];
s[i]++;
}
}
}
vector<int> v(n);
for(int i = 0; i < n; i++) v[i] = i;
sort(v.begin(), v.end(), f);
int i;
for(i = 0; i < n; i++){
if(v[i] == p-1) break;
}
cout << r[p-1] << " " << i+1;
return 0;
}
Compilation message
poi.cpp: In function 'bool f(int, int)':
poi.cpp:12:1: warning: control reaches end of non-void function [-Wreturn-type]
12 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Correct |
4 ms |
340 KB |
Output is correct |
11 |
Correct |
14 ms |
700 KB |
Output is correct |
12 |
Correct |
24 ms |
980 KB |
Output is correct |
13 |
Correct |
72 ms |
2516 KB |
Output is correct |
14 |
Correct |
100 ms |
3612 KB |
Output is correct |
15 |
Correct |
177 ms |
6156 KB |
Output is correct |
16 |
Correct |
195 ms |
6612 KB |
Output is correct |
17 |
Correct |
288 ms |
9684 KB |
Output is correct |
18 |
Correct |
328 ms |
10956 KB |
Output is correct |
19 |
Correct |
432 ms |
14384 KB |
Output is correct |
20 |
Correct |
471 ms |
15960 KB |
Output is correct |