Submission #873287

#	Time	Username	Problem	Language	Result	Execution time	Memory
873287		svorogaze	Council (JOI23_council)	C++17	100 / 100	2499 ms	56676 KiB

council

/*
    Disgrace. Humiliation. Unseemly and unwelcome at the feet of The Council.
    Their eyes ablaze with bitter resentment, glaring through Gabriel’s wounds of body and soul,
    bore outward for all to see.

    "Has this one abandoned the way of our Creator?"
    "It is unworthy of its Holy Light."
    "The Father's Light is indomitable."
    "This one only sees fit to squander it."

    Their words resonated in Gabriel's limbs, coursing through as lightning upon wire,
    a searing hiss that would strike lessers deaf and blind.
    The Holy Light within him, an unstoppable storm of divine fury.
    Insurmountable for mere objects.
    This he knew.

    "Holy Council, my devotion to our Creator is absolute.
    I have never strayed from the will of the Father, but a machine-"

    "You dare imply the might of the Father could be shaken by mere objects?"
    "Impossible."
    "Heresy."
    "Unspeakable."
    "Heresy."
    "Heresy."
    "Silence!"
    "Your failure will not be tolerated. As punishment, the Father's Light shall be severed
    from your body. You have 24 hours before the last of its embers die out."
    "And you with them."
    "Prove your loyalty."
    "Unmake your mistakes."

    As the Light was ripped from his being, Gabriel’s screams were silenced
    in the hiss of gospel in praise of God.
    A boiling anguish to which even the fires of hell could not compare.
    Through the blaze of torment a single burning hatred was forged anew.

    If the machines seek blood, he would give it freely; and with such fury, even metal will bleed.
    */

#pragma GCC optimize("O3")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define int long long
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, std::greater<int>, rb_tree_tag,
        tree_order_statistics_node_update>
        indexed_set;
typedef tree<long long, null_type, greater_equal<>, rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_multiset;
#define fastio \
        std::cin.tie(0), std::cout.tie(0), std::ios_base::sync_with_stdio(false)
#define rep(a, b, c, d) for (int a = b; a < c; a += d)
#define INF ((1ll << 50) - 1)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb push_back
#define x first
#define y second
#define ld long double
#define MAXN 201000
struct msk {
    int mask = 0, ind = -1;
};
msk mdp[(1ll << 20)][2];

bool big(msk m1, msk m2, int cm) {
    if (m1.ind == m2.ind) return false;
    if (__builtin_popcount(m1.mask & cm) == __builtin_popcount(m2.mask & cm)) {
        return __builtin_popcount(m1.mask) > __builtin_popcount(m2.mask);
    }
    return __builtin_popcount(m1.mask & cm) > __builtin_popcount(m2.mask & cm);
}

signed main() {
    fastio;
    int n, m;
    cin >> n >> m;
    vector<int> msks(n);
    vector<int> cnt(m, -(n / 2));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int x;
            cin >> x;
            x ^= 1;
            if (x) msks[i] += (1ll << j);
            if (!x) cnt[j]++;
        }
    }
    vector<int> cnt2(1ll << m);
    for (int i = 0; i < n; ++i) {
        if (big({msks[i], i}, mdp[msks[i]][0], msks[i])) {
            mdp[msks[i]][1] = mdp[msks[i]][0];
            mdp[msks[i]][0] = {msks[i], i}; 
        } else if (big({msks[i], i}, mdp[msks[i]][1], msks[i])) {
            mdp[msks[i]][1] = {msks[i], i};
        }
    }
    for (int l = 0; l < 3; ++l) {
        for (int cm = (1ll << m) - 1; cm > 0; --cm) {
            for (int j = 0; j < m; ++j) {
                if (!(cm & (1ll << j))) continue;
                for (int k = 0; k < 2; ++k) {
                    int msk = cm - (1ll << j);
                    for (; msk > 0; msk = 0) {
                        if (big(mdp[cm][k], mdp[msk][0], msk)) {
                            mdp[msk][1] = mdp[msk][0];
                            mdp[msk][0] = mdp[cm][k];
                        } else if (big(mdp[cm][k], mdp[msk][1], msk) && mdp[cm][k].ind != mdp[msk][0].ind) {
                            mdp[msk][1] = mdp[cm][k];
                        }
                    }
                }
            }
        }
        for (int cm = 0; cm < (1ll << m); ++cm) {
            for (int j = 0; j < m; ++j) {
                if ((cm & (1ll << j))) continue;
                for (int k = 0; k < 2; ++k) {
                    int msk = cm + (1ll << j);
                    for (; msk > 0; msk = 0) {
                        if (big(mdp[cm][k], mdp[msk][0], msk)) {
                            mdp[msk][1] = mdp[msk][0];
                            mdp[msk][0] = mdp[cm][k];
                        } else if (big(mdp[cm][k], mdp[msk][1], msk) && mdp[cm][k].ind != mdp[msk][0].ind) {
                            mdp[msk][1] = mdp[cm][k];
                        }
                    }
                }
            }
        }
    }
    vector<bool> visited(1ll << m);
    for (int i = 0; i < n; ++i) {
        int res = 0;
        int cm = 0;
        for (int j = 0; j < m; ++j) {
            if ((msks[i] & (1ll << j))) {
                //
            } else {
                cnt[j]--;
            }
            if (cnt[j] != 0) {
                if (cnt[j] > 0) res++;
            } else {
                cm += (1ll << j);
            }
        }
        if (mdp[cm][0].ind != i) {
            res += __builtin_popcount(mdp[cm][0].mask & cm);
        } else {
            if (mdp[cm][1].ind == i) exit(100);
            res += __builtin_popcount(mdp[cm][1].mask & cm);
        }
        cout << res << '\n';
        for (int j = 0; j < m; ++j) {
            if ((msks[i] & (1ll << j))) {
                //
            } else {
                cnt[j]++;
            }
        }
    }
}

• 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