| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 860809 |
2023-10-14T11:10:05 Z |
Kak008723 |
Poi (IOI09_poi) |
C++14 |
|
206 ms |
4432 KB |
#include<bits/stdc++.h>
using namespace std;
int n,m,k,b[2005];
vector<int> c;
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++){
int x = 0;
for(int j=1;j<=m;j++){
x+=a[i][j]*b[j];
}
if(i==k) now = x;
c.push_back(x);
}
cout<<now;
sort(c.rbegin(),c.rend());
int i = 0;
while(c[i]!=now) i++;
cout<<' '<<i+1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is 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 |
756 KB |
Output isn't correct |
| 8 |
Correct |
1 ms |
604 KB |
Output is correct |
| 9 |
Incorrect |
1 ms |
2652 KB |
Output isn't correct |
| 10 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 11 |
Correct |
7 ms |
2652 KB |
Output is correct |
| 12 |
Incorrect |
11 ms |
2652 KB |
Output isn't correct |
| 13 |
Incorrect |
30 ms |
2652 KB |
Output isn't correct |
| 14 |
Incorrect |
44 ms |
2676 KB |
Output isn't correct |
| 15 |
Incorrect |
76 ms |
2652 KB |
Output isn't correct |
| 16 |
Correct |
82 ms |
2976 KB |
Output is correct |
| 17 |
Incorrect |
121 ms |
3204 KB |
Output isn't correct |
| 18 |
Correct |
139 ms |
3664 KB |
Output is correct |
| 19 |
Correct |
182 ms |
4180 KB |
Output is correct |
| 20 |
Correct |
206 ms |
4432 KB |
Output is correct |
