# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
860799 |
2023-10-14T10:48:12 Z |
Kak008723 |
Poi (IOI09_poi) |
C++14 |
|
206 ms |
4368 KB |
#include<bits/stdc++.h>
using namespace std;
int n,m,k,b[2005],c[2005];
bool a[2005][2005];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m>>k;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
for(int i=1;i<=m;i++){
int ans = 0;
for(int j=1;j<=n;j++){
ans+=a[j][i];
}
ans=n-ans;
b[i]=ans;
}
//for(int i=1;i<=m;i++) cout<<b[i]<<' ';
//cout<<'\n';
int now = 0 ;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
c[i]+=a[i][j]*b[j];
}
if(i==k) now = c[k];
}
//for(int i=1;i<=n;i++) cout<<c[i]<<' ';
//cout<<'\n';
cout<<c[k];
sort(c+1,c+1+n);
auto it = lower_bound(c+1,c+1+n,now);
cout<<' '<<*it-1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
604 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2464 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
2652 KB |
Output isn't correct |
11 |
Incorrect |
7 ms |
2704 KB |
Output isn't correct |
12 |
Incorrect |
11 ms |
2700 KB |
Output isn't correct |
13 |
Incorrect |
36 ms |
2648 KB |
Output isn't correct |
14 |
Incorrect |
44 ms |
2904 KB |
Output isn't correct |
15 |
Incorrect |
79 ms |
2676 KB |
Output isn't correct |
16 |
Incorrect |
84 ms |
2932 KB |
Output isn't correct |
17 |
Incorrect |
123 ms |
3412 KB |
Output isn't correct |
18 |
Incorrect |
138 ms |
3664 KB |
Output isn't correct |
19 |
Incorrect |
182 ms |
4176 KB |
Output isn't correct |
20 |
Incorrect |
206 ms |
4368 KB |
Output isn't correct |