# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088639 | StefanSebez | Poi (IOI09_poi) | C++14 | 253 ms | 24020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
int main(){
int n,m,ind;scanf("%i%i%i",&n,&m,&ind);
int a[n+10][m+10];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++) scanf("%i",&a[i][j]);
}
int val[m+10]={0};
for(int j=1;j<=m;j++) for(int i=1;i<=n;i++) if(a[i][j]==0) val[j]++;
int b[n+10]={0};
pair<pair<int,int>,int>c[n+10];
for(int i=1;i<=n;i++){
int ct=0;
for(int j=1;j<=m;j++) if(a[i][j]==1) b[i]+=val[j],ct++;
c[i]={{b[i],ct},-i};
}
sort(c+1,c+n+1);reverse(c+1,c+n+1);
int res=-1,res1;
for(int i=1;i<=n;i++){
//printf("%i %i %i\n",c[i].fi.fi,c[i].fi.se,c[i].se);
if(-c[i].se==ind) res=i,res1=c[i].fi.fi;
}
printf("%i %i\n",res1,res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |