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;
const int N = 3001;
const int M = 20;
int a[N][M];
int sum[M];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for(int i=0; i< n; i++){
for(int j=0; j< m; j++){
cin >> a[i][j];
sum[j]+=a[i][j];
}
}
for(int i=0; i< n; i++){
for(int j=0; j< m; j++)sum[j]-=a[i][j];
int mx = 0;
for(int j=0; j<n; j++){
if(j==i)continue;
for(int k=0; k< m; k++)sum[k]-=a[j][k];
int cnt=0;
for(int k=0; k<m; k++){
if(sum[k]>=n/2)cnt++;
}
for(int k=0; k< m; k++)sum[k]+=a[j][k];
mx=max(mx, cnt);
}
for(int j=0; j< m; j++)sum[j]+=a[i][j];
cout << mx << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |