제출 #1180464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180464		patgra	Rope (JOI17_rope)	C++20	80 / 100	2600 ms	235144 KiB

rope

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>

#define rep(a,b,c) for(auto a = (b); a != (c); a++)
#define repD(a,b,c) for(auto a = (b); a != (c); a--)
#define repIn(a, b) for(auto a : (b))
#define repIn2(a, b, c) for(auto [a, b] : (c))

constexpr bool dbg = 0;
#define DEBUG if constexpr(dbg)
#define DC DEBUG std::cerr
#define eol std::endl

#define ll long long
#define pb push_back
#define int ll

using namespace std;

struct hsh {
    ll operator() (pair<int, int> x) const {
        ll a = x.first, b = x.second;
        return (a << 32) | b;
    }
};

constexpr int maxm = 1e6 + 7, maxTb = 1 << 20;
int n, m;
int iniCol[maxm];
int ans[maxm];
unordered_map<pair<int, int>, int, hsh> ileTakich;
int ilePojedynczych[maxm], ilePodwojnych[maxm];
unordered_map<pair<int, int>, int, hsh> ileTakich2;
int ilePojedynczych2[maxm], ilePodwojnych2[maxm];
basic_string<char32_t> skim[maxm];
pair<int, int> maxSuf[maxm];
pair<int, int> t[2 * maxTb];
int tb;

void checkCols1(int c1, int c2) {
    if(c1 > c2) swap(c1, c2);
    int ileWsumie = n / 2;
    auto ilePoj = ilePojedynczych[c1] + ilePojedynczych[c2] - ileTakich[pair{c1, c2}];
    auto ilePod = ilePodwojnych[c1] + ilePodwojnych[c2];
    auto cost1 = (ileWsumie - ilePod) * 2 - ilePoj;
    if(n % 2 == 1) cost1 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    if(n % 2 == 0) ileWsumie--;
    ilePoj = ilePojedynczych2[c1] + ilePojedynczych2[c2] - ileTakich2[pair{c1, c2}];
    ilePod = ilePodwojnych2[c1] + ilePodwojnych2[c2];
    auto cost2 = (ileWsumie - ilePod) * 2 - ilePoj;
    cost2 += iniCol[0] != c1 && iniCol[0] != c2;
    if(n % 2 == 0) cost2 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    auto cost = min(cost1, cost2);
    ans[c1] = min(ans[c1], cost);
    ans[c2] = min(ans[c2], cost);
}

void checkCols2(int c1, int c2) {
    if(c1 > c2) swap(c1, c2);
    int ileWsumie = n / 2;
    auto ilePoj = ilePojedynczych[c1] + ilePojedynczych[c2];
    auto ilePod = ilePodwojnych[c1] + ilePodwojnych[c2];
    auto cost1 = (ileWsumie - ilePod) * 2 - ilePoj;
    if(n % 2 == 1) cost1 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    if(n % 2 == 0) ileWsumie--;
    ilePoj = ilePojedynczych2[c1] + ilePojedynczych2[c2];
    ilePod = ilePodwojnych2[c1] + ilePodwojnych2[c2];
    auto cost2 = (ileWsumie - ilePod) * 2 - ilePoj;
    cost2 += iniCol[0] != c1 && iniCol[0] != c2;
    if(n % 2 == 0) cost2 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    auto cost = min(cost1, cost2);
    ans[c1] = min(ans[c1], cost);
    ans[c2] = min(ans[c2], cost);
}

void checkCols3(int c1, int c2) {
    if(c1 > c2) swap(c1, c2);
    int ileWsumie = n / 2;
    auto ilePoj = ilePojedynczych[c1];
    auto ilePod = ilePodwojnych[c1];
    auto cost1 = (ileWsumie - ilePod) * 2 - ilePoj;
    if(n % 2 == 1) cost1 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    if(n % 2 == 0) ileWsumie--;
    ilePoj = ilePojedynczych2[c1];
    ilePod = ilePodwojnych2[c1];
    auto cost2 = (ileWsumie - ilePod) * 2 - ilePoj;
    cost2 += iniCol[0] != c1 && iniCol[0] != c2;
    if(n % 2 == 0) cost2 += iniCol[n - 1] != c1 && iniCol[n - 1] != c2;
    auto cost = min(cost1, cost2);
    ans[c1] = min(ans[c1], cost);
    ans[c2] = min(ans[c2], cost);
}

void tSet(int i, int x) {
    i += tb;
    t[i].first = x;
    while(i > 1) i /= 2, t[i] = max(t[2 * i], t[2 * i + 1]);
}
pair<int, int> tQ(int l, int r) {
    l += tb;
    r += tb;
    auto ret = max(t[l], t[r]);
    while(l / 2 != r / 2) {
        if(l % 2 == 0) ret = max(ret, t[l + 1]);
        if(r % 2 == 1) ret = max(ret, t[r - 1]);
        l /= 2; r /= 2;
    }
    return ret;
}

int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    cin >> n >> m;
    rep(i, 0, n) cin >> iniCol[i];
    //scanf("%d%d", &n, &m);
    //rep(i, 0, n) scanf("%d", iniCol + i);
    int xdd = 1;
    tb = 1 << (64 - __builtin_clzll(max(xdd, m - 1)));
    rep(i, 1, m + 1) ans[i] = 1e9;
    rep(i, 0, n - 1) {
        auto c1 = iniCol[i], c2 = iniCol[i + 1];
        if(!ileTakich[pair{min(c1, c2), max(c1, c2)}] && !ileTakich2[pair{min(c1, c2), max(c1, c2)}]) skim[c1].pb(c2), skim[c2].pb(c1);
        if(i % 2 == 0) {
            if(c1 == c2) ilePodwojnych[c1]++;
            else ilePojedynczych[c1]++, ilePojedynczych[c2]++, ileTakich[pair{min(c1, c2), max(c1, c2)}]++;
        }
        else {
            if(c1 == c2) ilePodwojnych2[c1]++;
            else ilePojedynczych2[c1]++, ilePojedynczych2[c2]++, ileTakich2[pair{min(c1, c2), max(c1, c2)}]++;
        } 
    }

    rep(i, 0, n - 1) if(iniCol[i] != iniCol[i + 1]) checkCols1(iniCol[i], iniCol[i + 1]);
    rep(i, 1, m + 1) checkCols3(i, i);

    rep(i, 0, tb) t[i + tb] = {-1, i};
    rep(i, 1, m + 1) t[i - 1 + tb].first = ilePodwojnych[i] * 2 + ilePojedynczych[i];
    maxSuf[m - 1] = t[m - 1 + tb];
    repD(i, m - 2, -1) maxSuf[i] = max(maxSuf[i + 1], t[i + tb]);
    repD(i, tb - 1, 0) t[i] = max(t[2 * i], t[2 * i + 1]);
    rep(i, 1, m + 1) {
        pair<int, int> maxx = {-1, -1};
        skim[i].pb(i);
        ranges::sort(skim[i]);
        auto prv = 1ll;
        repIn(j, skim[i]) {
            if(j > prv) maxx = max(maxx, tQ(prv - 1, j - 2));
            prv = j + 1;
        }
        if(prv <= m) maxx = max(maxx, maxSuf[prv - 1]);
        if(maxx.second >= 0) checkCols2(i, maxx.second + 1);
    }

    rep(i, 0, tb) t[i + tb] = {-1, i};
    rep(i, 1, m + 1) t[i - 1 + tb].first = ilePodwojnych2[i] * 2 + ilePojedynczych2[i];
    maxSuf[m - 1] = t[m - 1 + tb];
    repD(i, m - 2, -1) maxSuf[i] = max(maxSuf[i + 1], t[i + tb]);
    repD(i, tb - 1, 0) t[i] = max(t[2 * i], t[2 * i + 1]);
    rep(i, 1, m + 1) {
        pair<int, int> maxx = {-1, -1};
        auto prv = 1ll;
        repIn(j, skim[i]) {
            if(j > prv) maxx = max(maxx, tQ(prv - 1, j - 2));
            prv = j + 1;
        }
        if(prv <= m) maxx = max(maxx, maxSuf[prv - 1]);
        if(maxx.second >= 0) checkCols2(i, maxx.second + 1);
    }

    //rep(i, 0, m) printf("%d\n", ans[i + 1]);
    rep(i, 0, m) cout << ans[i + 1] << '\n';
}

• Subtask 1: 15 / 15
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 0 / 20