| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 851652 |
2023-09-20T10:34:56 Z |
abcvuitunggio |
Poi (IOI09_poi) |
C++17 |
|
201 ms |
4464 KB |
#include <bits/stdc++.h>
using namespace std;
int n,t,p,cnt[2001];
bool a[2001][2001];
pair <int, int> s[2001];
int main(){
ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
cin >> n >> t >> p;
for (int i=1;i<=n;i++)
for (int j=1;j<=t;j++){
cin >> a[i][j];
cnt[j]+=1-a[i][j];
}
for (int i=1;i<=n;i++){
for (int j=1;j<=t;j++)
s[i].first-=a[i][j]*cnt[j];
s[i].second=i;
}
sort(s+1,s+n+1);
for (int i=1;i<=n;i++)
if (s[i].second==p)
cout << -s[i].first << ' ' << i;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
| 9 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 11 |
Correct |
7 ms |
2652 KB |
Output is correct |
| 12 |
Correct |
12 ms |
2652 KB |
Output is correct |
| 13 |
Incorrect |
31 ms |
2692 KB |
Output isn't correct |
| 14 |
Correct |
43 ms |
2652 KB |
Output is correct |
| 15 |
Incorrect |
77 ms |
2672 KB |
Output isn't correct |
| 16 |
Correct |
82 ms |
2928 KB |
Output is correct |
| 17 |
Correct |
125 ms |
3156 KB |
Output is correct |
| 18 |
Correct |
141 ms |
3664 KB |
Output is correct |
| 19 |
Correct |
188 ms |
4224 KB |
Output is correct |
| 20 |
Correct |
201 ms |
4464 KB |
Output is correct |
