Submission #1132453

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132453		lopkus	Council (JOI23_council)	C++20	16 / 100	4094 ms	9848 KiB

council

#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int a[n + 1][m + 1];
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    vector<int> cnt(m + 1, 0);
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cnt[j] += a[i][j];
        }
    }
    int K = (n - 2) / 2;
    for(int i = 1; i <= n; i++) {
        int ans = 0;
        vector<int> V;
        for(int j = 1; j <= m; j++) {
            if(cnt[j] - a[i][j] > K + 1) {
                ans += 1;
                continue;
            }
            // at least k + 2
            // if cnt[j] - a[i][j] < k + 1 this is imposible
            // if cnt[j] - a[i][j] == k + 1 that is posible but...
            if(cnt[j] - a[i][j] < K + 1) {
                continue;
            }
            V.push_back(j);
        }
        vector<int> c(n + 1, 0);
        for(auto it : V) {
            for(int j = 1; j <= n; j++) {
                c[j] += a[j][it];
            }
        }
        int mx = m + 1;
        for(int j = 1; j <= n; j++) {
            if(j == i) {
                continue;
            }
            mx = min(mx, c[j]);
        }
        ans += V.size() - mx;
        cout << ans << "\n";
    }
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 0 / 6
• Subtask 4: 0 / 19
• Subtask 5: 0 / 15
• Subtask 6: 0 / 22
• Subtask 7: 0 / 22