# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
277116 |
2020-08-21T03:44:58 Z |
barsbold |
Poi (IOI09_poi) |
C++14 |
|
361 ms |
5824 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pb push_back
#define ll long long
using namespace std;
bool a[2001][2001];
int tasks[2001];
pair<pair<int , int > , int > score[2001];
vector<int > hel;
int main (){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n , t, p;
cin >> n >> t >> p;
memset(score , 0 , sizeof(score));
for(int i = 1; i<=n; i++){
for(int j = 1; j<=t; j++){
cin >> a[i][j];
if(a[i][j] == 0){
tasks[j]++;
}
}
}
for(int i = 1; i<=n; i++){
score[i].ss = -i;
for(int j = 1; j<=t; j++){
if(a[i][j] == 1 ){
score[i].ff.ff+=tasks[j];
score[i].ff.ss++;
}
}
}
int pl = score[p].ff.ff;
sort(score +1 , score + n + 1);
p=-p;
for(int i =1 ; i<=n; i++){
if(score[i].ff.ff == pl && score[i].ss ==p){
cout << pl << " " << n - i + 1 << endl;
return 0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
512 KB |
Output is correct |
8 |
Correct |
1 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
640 KB |
Output is correct |
10 |
Correct |
3 ms |
768 KB |
Output is correct |
11 |
Correct |
11 ms |
1152 KB |
Output is correct |
12 |
Correct |
22 ms |
1792 KB |
Output is correct |
13 |
Correct |
70 ms |
2684 KB |
Output is correct |
14 |
Correct |
84 ms |
3576 KB |
Output is correct |
15 |
Correct |
159 ms |
4856 KB |
Output is correct |
16 |
Correct |
142 ms |
4984 KB |
Output is correct |
17 |
Correct |
227 ms |
5368 KB |
Output is correct |
18 |
Correct |
237 ms |
5624 KB |
Output is correct |
19 |
Correct |
312 ms |
5756 KB |
Output is correct |
20 |
Correct |
361 ms |
5824 KB |
Output is correct |