oj.uz

Submission #799888

# Submission time Handle Problem Language Result Execution time Memory
799888 2023-08-01T07:35:34 Z PixelCat Seats (IOI18_seats) C++14
100 / 100
 1976 ms 104840 KB 
#include "seats.h"

#ifdef NYAOWO
#include "grader.cpp"
#endif

#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 eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 1'000'000;
const int MAXND = MAXN * 4;
const int INF = MAXN + 8;

#define L(id) ((id) * 2 + 1)
#define R(id) ((id) * 2 + 2)
struct SegTree {
    struct Node {
        int mn, cnt, add;
    } a[MAXND];
    void pull(int id) {
        a[id].mn = min(a[L(id)].mn, a[R(id)].mn);
        a[id].cnt = 0;
        if(a[L(id)].mn == a[id].mn) a[id].cnt += a[L(id)].cnt;
        if(a[R(id)].mn == a[id].mn) a[id].cnt += a[R(id)].cnt;
        a[id].mn += a[id].add;
    }
    void build(int id, int l, int r) {
        a[id].mn = 0;
        a[id].cnt = r - l + 1;
        a[id].add = 0;
        if(l == r) return;
        int m = (l + r) / 2;
        build(L(id), l, m);
        build(R(id), m + 1, r);
    }
    void add(int id, int l, int r, int L, int R, int val) {
        if(l >= L && r <= R) {
            a[id].mn += val;
            a[id].add += val;
            return;
        }
        int m = (l + r) / 2;
        if(L <= m) add(L(id), l, m, L, R, val);
        if(R > m)  add(R(id), m + 1, r, L, R, val);
        pull(id);
    }
    int query() {
        // assert(a[0].mn >= 4);
        if(a[0].mn != 4) return 0;
        return a[0].cnt;
    }
    void out(int id, int l, int r, int tot) {
        tot += a[id].add;
        if(l == r) {
            cerr << tot << " ";
            return;
        }
        int m = (l + r) / 2;
        out(L(id), l, m, tot);
        out(R(id), m + 1, r, tot);
        if(!id) cerr << "\n";
    }
} seg;

int h, w, hw;
vector<vector<int>> g;  // grid
int r[MAXN + 10];
int c[MAXN + 10];

inline void update_2x2(int i, int j, int val) {
    int vals[] = {g[i][j], g[i + 1][j], g[i][j + 1], g[i + 1][j + 1]};
    sort(vals, vals + 4);
    seg.add(0, 0, hw - 1, vals[0], vals[1] - 1, val);
    if(vals[2] != hw) seg.add(0, 0, hw - 1, vals[2], vals[3] - 1, 8 * val);
}

inline void update(int i, int j, int val) {
    update_2x2(i - 1, j - 1, val);
    update_2x2(i - 1, j    , val);
    update_2x2(i    , j - 1, val);
    update_2x2(i    , j    , val);
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    h = H; w = W; hw = h * w;
    seg.build(0, 0, hw - 1);
    g.resize(h + 2);
    For(i, 0, h + 1) g[i].resize(w + 2, hw);
    For(i, 0, hw - 1) {
        r[i] = R[i] + 1;
        c[i] = C[i] + 1;
        g[r[i]][c[i]] = i;
    }
    For(i, 0, h) For(j, 0, w) {
        update_2x2(i, j, 1);
    }
    // seg.out(0, 0, hw - 1, 0);
    // For(i, 0, h + 1) For(j, 0, w + 1) {
    //     cerr << g[i][j] << " \n"[j == w + 1];
    // }
}

int swap_seats(int a, int b) {
    update(r[a], c[a], -1);
    update(r[b], c[b], -1);
    swap(g[r[a]][c[a]], g[r[b]][c[b]]);
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    update(r[a], c[a], 1);
    update(r[b], c[b], 1);
    return seg.query();
}

/*

2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5

*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 12 ms 456 KB Output is correct
3 Correct 19 ms 460 KB Output is correct
4 Correct 12 ms 480 KB Output is correct
5 Correct 10 ms 484 KB Output is correct
6 Correct 16 ms 460 KB Output is correct
7 Correct 18 ms 436 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 16 ms 456 KB Output is correct
10 Correct 17 ms 468 KB Output is correct
11 Correct 17 ms 492 KB Output is correct
12 Correct 11 ms 468 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 12 ms 456 KB Output is correct
3 Correct 19 ms 460 KB Output is correct
4 Correct 12 ms 480 KB Output is correct
5 Correct 10 ms 484 KB Output is correct
6 Correct 16 ms 460 KB Output is correct
7 Correct 18 ms 436 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 16 ms 456 KB Output is correct
10 Correct 17 ms 468 KB Output is correct
11 Correct 17 ms 492 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 45 ms 1200 KB Output is correct
14 Correct 50 ms 1108 KB Output is correct
15 Correct 31 ms 1272 KB Output is correct
16 Correct 24 ms 1716 KB Output is correct
17 Correct 38 ms 1224 KB Output is correct
18 Correct 36 ms 1184 KB Output is correct
19 Correct 34 ms 1236 KB Output is correct
20 Correct 29 ms 1424 KB Output is correct
21 Correct 22 ms 1236 KB Output is correct
22 Correct 22 ms 1620 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1268 ms 52700 KB Output is correct
2 Correct 683 ms 52692 KB Output is correct
3 Correct 692 ms 52540 KB Output is correct
4 Correct 545 ms 52652 KB Output is correct
5 Correct 628 ms 52536 KB Output is correct
6 Correct 530 ms 52544 KB Output is correct
7 Correct 609 ms 52548 KB Output is correct
8 Correct 774 ms 52552 KB Output is correct
9 Correct 667 ms 52556 KB Output is correct
10 Correct 631 ms 52424 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1136 KB Output is correct
2 Correct 101 ms 5972 KB Output is correct
3 Correct 570 ms 53560 KB Output is correct
4 Correct 1253 ms 53592 KB Output is correct
5 Correct 493 ms 61236 KB Output is correct
6 Correct 1286 ms 104840 KB Output is correct
7 Correct 568 ms 58420 KB Output is correct
8 Correct 663 ms 55876 KB Output is correct
9 Correct 603 ms 56196 KB Output is correct
10 Correct 648 ms 60496 KB Output is correct
11 Correct 591 ms 79208 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1872 KB Output is correct
2 Correct 61 ms 1880 KB Output is correct
3 Correct 101 ms 1792 KB Output is correct
4 Correct 147 ms 1880 KB Output is correct
5 Correct 227 ms 2504 KB Output is correct
6 Correct 881 ms 62088 KB Output is correct
7 Correct 1065 ms 62080 KB Output is correct
8 Correct 903 ms 62084 KB Output is correct
9 Correct 1735 ms 62084 KB Output is correct
10 Correct 813 ms 62908 KB Output is correct
11 Correct 875 ms 63500 KB Output is correct
12 Correct 728 ms 63496 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 12 ms 456 KB Output is correct
3 Correct 19 ms 460 KB Output is correct
4 Correct 12 ms 480 KB Output is correct
5 Correct 10 ms 484 KB Output is correct
6 Correct 16 ms 460 KB Output is correct
7 Correct 18 ms 436 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 16 ms 456 KB Output is correct
10 Correct 17 ms 468 KB Output is correct
11 Correct 17 ms 492 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 45 ms 1200 KB Output is correct
14 Correct 50 ms 1108 KB Output is correct
15 Correct 31 ms 1272 KB Output is correct
16 Correct 24 ms 1716 KB Output is correct
17 Correct 38 ms 1224 KB Output is correct
18 Correct 36 ms 1184 KB Output is correct
19 Correct 34 ms 1236 KB Output is correct
20 Correct 29 ms 1424 KB Output is correct
21 Correct 22 ms 1236 KB Output is correct
22 Correct 22 ms 1620 KB Output is correct
23 Correct 1268 ms 52700 KB Output is correct
24 Correct 683 ms 52692 KB Output is correct
25 Correct 692 ms 52540 KB Output is correct
26 Correct 545 ms 52652 KB Output is correct
27 Correct 628 ms 52536 KB Output is correct
28 Correct 530 ms 52544 KB Output is correct
29 Correct 609 ms 52548 KB Output is correct
30 Correct 774 ms 52552 KB Output is correct
31 Correct 667 ms 52556 KB Output is correct
32 Correct 631 ms 52424 KB Output is correct
33 Correct 50 ms 1136 KB Output is correct
34 Correct 101 ms 5972 KB Output is correct
35 Correct 570 ms 53560 KB Output is correct
36 Correct 1253 ms 53592 KB Output is correct
37 Correct 493 ms 61236 KB Output is correct
38 Correct 1286 ms 104840 KB Output is correct
39 Correct 568 ms 58420 KB Output is correct
40 Correct 663 ms 55876 KB Output is correct
41 Correct 603 ms 56196 KB Output is correct
42 Correct 648 ms 60496 KB Output is correct
43 Correct 591 ms 79208 KB Output is correct
44 Correct 32 ms 1872 KB Output is correct
45 Correct 61 ms 1880 KB Output is correct
46 Correct 101 ms 1792 KB Output is correct
47 Correct 147 ms 1880 KB Output is correct
48 Correct 227 ms 2504 KB Output is correct
49 Correct 881 ms 62088 KB Output is correct
50 Correct 1065 ms 62080 KB Output is correct
51 Correct 903 ms 62084 KB Output is correct
52 Correct 1735 ms 62084 KB Output is correct
53 Correct 813 ms 62908 KB Output is correct
54 Correct 875 ms 63500 KB Output is correct
55 Correct 728 ms 63496 KB Output is correct
56 Correct 77 ms 1916 KB Output is correct
57 Correct 188 ms 1956 KB Output is correct
58 Correct 324 ms 2736 KB Output is correct
59 Correct 1133 ms 54664 KB Output is correct
60 Correct 1976 ms 54852 KB Output is correct
61 Correct 1081 ms 54728 KB Output is correct
62 Correct 821 ms 58604 KB Output is correct
63 Correct 1915 ms 58108 KB Output is correct
64 Correct 1199 ms 55956 KB Output is correct
65 Correct 1046 ms 55260 KB Output is correct
66 Correct 1146 ms 56868 KB Output is correct
67 Correct 1205 ms 59380 KB Output is correct
68 Correct 932 ms 70208 KB Output is correct
69 Correct 1846 ms 78192 KB Output is correct