# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172458 | lopkus | Council (JOI23_council) | C++20 | 4096 ms | 16892 KiB |
#include <bits/stdc++.h>+
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> a(n + 1, std::vector<int>(m + 1));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
std::cin >> a[i][j];
}
}
std::vector<int> cnt(m + 1);
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cnt[j] += a[i][j];
}
}
for(int x = 1; x <= n; x++) {
int ans = 0;
for(int y = 1; y <= n; y++) {
if(y == x) {
continue;
}
int can = 0;
for(int i = 1; i <= m; i++) {
if(cnt[i] >= n / 2 + 2) {
can += 1;
continue;
}
if(cnt[i] < n / 2) {
continue;
}
if(cnt[i] == n / 2 && a[x][i]) {
continue;
}
if(!a[x][i] && cnt[i] == n / 2 + 1) {
can += 1;
continue;
}
if(a[y][i] == 0) {
can += 1;
}
}
ans = std::max(ans, can);
}
std::cout << ans << "\n";
}
}
Compilation message (stderr)
# | 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... |