oj.uz

Submission #794200

# Submission time Handle Problem Language Result Execution time Memory
794200 2023-07-26T10:34:44 Z PixelCat Sorting (IOI15_sorting) C++14
100 / 100
 830 ms 180900 KB 
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include "sorting.h"

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 200'000;
const int MAXM = 3 * MAXN;

struct DSU {
    int p[MAXN + 10];
    int sz[MAXN + 10];
    int blk;
    vector<pii> hist;
    void init(int n) {
        // cerr << "dsu init!\n";
        memset(p, -1, sizeof(p));
        memset(sz, 0, sizeof(sz));
        blk = n;
        hist.clear();
    }
    int find(int n) {
        if(p[n] < 0) return n;
        return find(p[n]);
    }
    void uni(int a, int b) {
        // cerr << "dsu uni " << a << " " << b << "\n";
        a = find(a); b = find(b);
        if(a == b) {
            hist.eb(-1, -1);
            return;
        }
        if(sz[a] < sz[b]) swap(a, b);
        p[b] = a;
        sz[a] += sz[b] + 1;
        blk--;
        hist.eb(a, b);
    }
    void undo() {
        int a, b;
        tie(a, b) = hist.back();
        hist.pop_back();
        if(a < 0) return;
        p[b] = -1;
        sz[a] -= sz[b] + 1;
        blk++;
    }
} dsu;

#define L(id) ((id) * 2 + 1)
#define R(id) ((id) * 2 + 2)
struct SegTree {
    vector<pii> ops[MAXN * 4 + 10];
    int ans;
    void init(int m) {
        ans = m + 1;
        For(i, 0, MAXN * 4 + 10 - 1) {
            ops[i].clear();
        }
    }
    void add(int id, int l, int r, int L, int R, pii p) {
        if(l > R || r < L) return;
        if(l >= L && r <= R) {
            ops[id].eb(p);
            return;
        }
        int m = (l + r) / 2;
        if(L <= m) add(L(id), l, m, L, R, p);
        if(R > m)  add(R(id), m + 1, r, L, R, p);
    }
    void traverse(int id, int l, int r, int N) {
        // cerr << "ops: " << id << " - " << sz(ops[id]) << "\n";
        for(auto &p:ops[id]) dsu.uni(p.F, p.S);
        if(l == r) {
            if(N - dsu.blk <= l) ans = min(ans, l);
            // cerr << "traverse: " << l << " " << dsu.blk << "\n";
        } else {
            int m = (l + r) / 2;
            traverse(L(id), l, m, N);
            traverse(R(id), m + 1, r, N);
        }
        For(_, 1, sz(ops[id])) dsu.undo();
    }
} seg;

int val[MAXN + 10];
int pos[MAXN + 10];
int last[MAXN + 10];

int tmp[MAXN + 10];
bool check(int n, int lim, vector<pii> &ops) {
    For(i, 0, n - 1) tmp[i] = val[i];
    ops.clear();
    For(i, 0, n - 1) {
        while(tmp[i] != i) {
            ops.eb(tmp[i], tmp[tmp[i]]);
            swap(tmp[i], tmp[tmp[i]]);
        }
    }
    return sz(ops) <= lim;
}

void timer() {
    static clock_t lastt = -1;
    clock_t cur = clock();
    if(lastt != -1) {
        cerr << fixed << setprecision(3);
        cerr << "elapsed: " << ((double)(cur - lastt) / CLOCKS_PER_SEC) << "\n";
    }
    lastt = cur;
}

int32_t findSwapPairs(int32_t N, int32_t S[], int32_t M, int32_t X[], int32_t Y[], int32_t P[], int32_t Q[]) {
    timer();
    
    For(i, 0, N - 1) {
        val[i] = S[i];
        pos[val[i]] = i;
    }
    timer();

    // add edges to segment tree
    M = N;
    seg.init(M);
    memset(last, -1, sizeof(last));
    For(i, 0, M - 1) {
        int p1 = X[i], p2 = Y[i];
        seg.add(0, 0, M, last[p1] + 1, i, pii(p1, val[p1]));
        seg.add(0, 0, M, last[p2] + 1, i, pii(p2, val[p2]));
        last[p1] = i; last[p2] = i;
        swap(pos[val[p1]], pos[val[p2]]);
        swap(val[p1], val[p2]);
    }
    For(i, 0, N - 1) {
        seg.add(0, 0, M, last[i] + 1, M, pii(i, val[i]));
    }
    timer();

    // traverse through segment tree
    dsu.init(N);
    seg.traverse(0, 0, M, N);
    timer();
    
    // restore states at time i
    For(i, 0, N - 1) {
        val[i] = S[i];
        pos[val[i]] = i;
    }
    For(i, 0, seg.ans - 1) {
        int p1 = X[i], p2 = Y[i];
        swap(pos[val[p1]], pos[val[p2]]);
        swap(val[p1], val[p2]);
    }
    timer();

    // construct answer
    vector<pii> op;
    assert(check(N, seg.ans, op));
    while(sz(op) < seg.ans) op.eb(0, 0);
    Forr(j, seg.ans - 1, 0) {
        int v1 = op[j].F;
        int v2 = op[j].S;
        P[j] = (int32_t)pos[v1];
        Q[j] = (int32_t)pos[v2];
        swap(val[pos[v1]], val[pos[v2]]);
        swap(pos[v1], pos[v2]);

        int p1 = X[j];
        int p2 = Y[j];
        swap(pos[val[p1]], pos[val[p2]]);
        swap(val[p1], val[p2]);
    }
    timer();
    return (int32_t)(seg.ans);
}

/*

30421
10423
10243

*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 13 ms 23728 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 14 ms 23688 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 13 ms 23728 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 14 ms 23688 KB Output is correct
8 Correct 16 ms 23732 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23784 KB Output is correct
11 Correct 15 ms 23764 KB Output is correct
12 Correct 14 ms 23764 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23820 KB Output is correct
3 Correct 13 ms 23828 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23752 KB Output is correct
6 Correct 13 ms 23760 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 13 ms 23728 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 14 ms 23688 KB Output is correct
8 Correct 16 ms 23732 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23784 KB Output is correct
11 Correct 15 ms 23764 KB Output is correct
12 Correct 14 ms 23764 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23820 KB Output is correct
15 Correct 13 ms 23828 KB Output is correct
16 Correct 14 ms 23764 KB Output is correct
17 Correct 14 ms 23752 KB Output is correct
18 Correct 13 ms 23760 KB Output is correct
19 Correct 13 ms 23752 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 15 ms 24020 KB Output is correct
22 Correct 18 ms 24116 KB Output is correct
23 Correct 15 ms 24020 KB Output is correct
24 Correct 15 ms 24088 KB Output is correct
25 Correct 15 ms 24000 KB Output is correct
26 Correct 17 ms 24120 KB Output is correct
27 Correct 15 ms 24000 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24404 KB Output is correct
2 Correct 19 ms 24176 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 19 ms 24588 KB Output is correct
5 Correct 18 ms 24612 KB Output is correct
6 Correct 18 ms 24660 KB Output is correct
7 Correct 17 ms 24660 KB Output is correct
8 Correct 20 ms 24716 KB Output is correct
9 Correct 17 ms 24744 KB Output is correct
10 Correct 17 ms 24732 KB Output is correct
11 Correct 18 ms 24608 KB Output is correct
12 Correct 16 ms 24720 KB Output is correct
13 Correct 17 ms 24644 KB Output is correct
14 Correct 15 ms 24108 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24404 KB Output is correct
2 Correct 19 ms 24176 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 19 ms 24588 KB Output is correct
5 Correct 18 ms 24612 KB Output is correct
6 Correct 18 ms 24660 KB Output is correct
7 Correct 17 ms 24660 KB Output is correct
8 Correct 20 ms 24716 KB Output is correct
9 Correct 17 ms 24744 KB Output is correct
10 Correct 17 ms 24732 KB Output is correct
11 Correct 18 ms 24608 KB Output is correct
12 Correct 16 ms 24720 KB Output is correct
13 Correct 17 ms 24644 KB Output is correct
14 Correct 15 ms 24108 KB Output is correct
15 Correct 241 ms 67700 KB Output is correct
16 Correct 402 ms 114492 KB Output is correct
17 Correct 797 ms 172040 KB Output is correct
18 Correct 609 ms 162892 KB Output is correct
19 Correct 717 ms 175012 KB Output is correct
20 Correct 702 ms 176480 KB Output is correct
21 Correct 703 ms 176796 KB Output is correct
22 Correct 123 ms 60172 KB Output is correct
23 Correct 404 ms 131440 KB Output is correct
24 Correct 829 ms 177624 KB Output is correct
25 Correct 830 ms 176212 KB Output is correct
26 Correct 618 ms 174644 KB Output is correct
27 Correct 589 ms 171788 KB Output is correct
28 Correct 666 ms 166420 KB Output is correct
29 Correct 670 ms 173040 KB Output is correct
30 Correct 572 ms 176520 KB Output is correct
31 Correct 738 ms 176300 KB Output is correct
32 Correct 269 ms 84360 KB Output is correct
33 Correct 793 ms 177360 KB Output is correct
34 Correct 403 ms 125660 KB Output is correct
35 Correct 701 ms 172972 KB Output is correct
36 Correct 129 ms 64352 KB Output is correct
37 Correct 731 ms 180900 KB Output is correct
38 Correct 729 ms 176700 KB Output is correct
39 Correct 697 ms 177396 KB Output is correct