Submission #1358513

#	Time	Username	Problem	Language	Result	Execution time	Memory
1358513		retarde	Council (JOI23_council)	C++20	100 / 100	450 ms	71688 KiB

council

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

struct val {
    int v = -1e18, i = -1e18;
};

struct top2 {
    val mx, mx2;
    void add(val &other) {
        if (other.i == mx.i) {
            mx.v = max(mx.v, other.v);
            return;
        }
        if (other.v > mx.v) {
            mx2 = mx;
            mx = other;
            return;
        }
        if (other.v > mx2.v && other.i != mx.i) {
            mx2 = other;
            return;
        }
    }
};

int N, M;
const int pwr = (int)1 << 20;
top2 valid[pwr], dp[pwr];
int masks[300001], nots[300001], cnt[20];

inline void solve() {
    cin >> N >> M;
    for (int i = 0; i < N; i++) {
        int nt = 0, mask = 0;
        for (int j = 0; j < M; j++) {
            int x; cin >> x;
            nt += (1 - x) * ((int)1 << j);
            mask += x * ((int)1 << j);
            cnt[j] += x;
        }
        nots[i] = nt;
        masks[i] = mask;
    }

    for (int i = 0; i < N; i++) {
        val yes = {1, i};
        valid[nots[i]].add(yes);
    }

    for (int msk = pwr - 1; msk >= 0; msk--) {
        for (int bit = 0; bit < 20; bit++) {
            if (msk & (1 << bit)) {
                valid[msk ^ (1 << bit)].add(valid[msk].mx);
                valid[msk ^ (1 << bit)].add(valid[msk].mx2);
            }
        }
    }

    for (int msk = 0; msk < pwr; msk++) {
        int pc = __builtin_popcount(msk);
        if (valid[msk].mx.v == 1) valid[msk].mx.v = pc;
        if (valid[msk].mx2.v == 1) valid[msk].mx2.v = pc;
    }

    for (int msk = 0; msk < pwr; msk++) {
        dp[msk].add(valid[msk].mx);
        dp[msk].add(valid[msk].mx2);
        for (int j = 0; j < 20; j++) {
            if (msk & ((int)1 << j)) {
                int prev = msk ^ ((int)1 << j);
                dp[msk].add(dp[prev].mx);
                dp[msk].add(dp[prev].mx2);
            }
        }
    }

    for (int i = 0; i < N; i++) {
        int base = 0, critm = 0;
        for (int j = 0; j < M; j++) {
            int cj = cnt[j] - !!(masks[i] & (1 << j));
            if (cj > N/2) base++;
            else if (cj == N/2) {
                critm += (1 << j);
            }
        }

        top2 t2 = dp[critm];
        val v = t2.mx;
        if (t2.mx.i == i) v = t2.mx2;
        cout << base + v.v << '\n';
    }
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

council.cpp: In function 'void setIO(std::string)':
council.cpp:125:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:126:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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