| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334561 | justin271828 | Council (JOI23_council) | C++20 | 4091 ms | 1000 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
bool A[N][M];
int sum[M];
memset(sum, 0, sizeof(sum));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
int x;
cin >> x;
A[i][j] = (x == 1);
sum[j] += x;}
}
for (int i = 0; i < N; i++) {
int ans = 0;
for (int k = 0; k < N; k++) {
if (i == k) continue;
int temp = 0;
for (int j = 0; j < M; j++) temp += (bool)(sum[j]-A[i][j]-A[k][j] >= N/2);
ans = max(temp, ans);
}
cout << ans << "\n";
}
return 0;
}| # | 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... | ||||
