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;
using idata = vector<int>;
using igrid = vector<idata>;
idata sum;
igrid values;
int main () {
int N, M;
cin >> N >> M;
sum.resize(M);
values.resize(N, idata(M));
for (int i = 0; i < N; i ++) {
for (int j = 0; j < M; j ++) {
int x; cin >> x; x = 2 * x - 1;
values[i][j] = x;
sum[j] += x;
}
}
for (int i = 0; i < N; i ++) {
for (int j = 0; j < M; j ++)
sum[j] -= values[i][j];
int mdp = 0;
for (int j = 0; j < N; j ++) {
if (j == i) continue ;
int ldp = 0;
for (int h = 0; h < M; h ++) {
sum[h] -= values[j][h];
if (sum[h] >= 1) ldp ++;
sum[h] += values[j][h];
}
mdp = max(ldp, mdp);
}
for (int j = 0; j < M; j ++)
sum[j] += values[i][j];
cout << mdp << endl;
}
}
# | 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... |