oj.uz

Submission #964613

# Submission time Handle Problem Language Result Execution time Memory
964613 2024-04-17T08:09:01 Z fve5 Seats (IOI18_seats) C++17
100 / 100
 2153 ms 143952 KB 
#include <bits/stdc++.h>
#include "seats.h"
using namespace std;

typedef long long i64;

struct Info {
    i64 mi;
    int cnt;
};

Info merge(const Info &a, const Info &b) {
    if (a.mi < b.mi)
        return a;
    if (b.mi < a.mi)
        return b;
    return {a.mi, a.cnt + b.cnt};
}

class SegTree {
    vector<Info> arr;
    vector<i64> lazy;
    int s;

    void push(int n, int nb, int ne) {
        if (!lazy[n]) return;

        arr[n].mi += lazy[n];
        if (nb + 1 != ne) {
            lazy[2 * n] += lazy[n];
            lazy[2 * n + 1] += lazy[n];
        }

        lazy[n] = 0;
    }

    void update(int l, int r, i64 d, int n, int nb, int ne) {
        push(n, nb, ne);
        if (ne <= l || nb >= r) return;
        if (l <= nb && ne <= r) {
            lazy[n] = d;
            push(n, nb, ne);
            return;
        }

        update(l, r, d, 2 * n, nb, (nb + ne) / 2);
        update(l, r, d, 2 * n + 1, (nb + ne) / 2, ne);

        arr[n] = merge(arr[2 * n], arr[2 * n + 1]);
    }

    Info query(int l, int r, int n, int nb, int ne) {
        push(n, nb, ne);
        if (ne <= l || nb >= r) return {(i64)1e18, 1};
        if (l <= nb && ne <= r) return arr[n];

        return merge(
            query(l, r, 2 * n, nb, (nb + ne) / 2),
            query(l, r, 2 * n + 1, (nb + ne) / 2, ne));
    }

public:

    void update(int l, int r, i64 d) { update(l, r, d, 1, 0, s); }
    int query(int l, int r) { return query(l, r, 1, 0, s).cnt; }

    SegTree() { }
    SegTree(int N) {
        s = 1 << (int)ceil(log2(N));
        arr.resize(2 * s, {0, 1});
        lazy.resize(2 * s);

        for (int i = s - 1; i > 0; i--)
            arr[i] = merge(arr[2 * i], arr[2 * i + 1]);
    }
};

#define GOOD_SQUARE_VALUE 1
#define BAD_SQUARE_VALUE ((int)1e7)

int H, W;
vector<vector<int>> grid;
vector<pair<int, int>> pos;

SegTree segtree;

bool get_status(int i, int j, int t) {
    if (i < 0 || j < 0 || i >= H || j >= W)
        return false;
    return grid[i][j] <= t;
}

int get_square_value(int x, int y, int dx, int dy, int t) {
    int cnt = get_status(x, y, t) + get_status(x + dx, y, t)
            + get_status(x, y + dy, t) + get_status(x + dx, y + dy, t);

    switch (cnt) {
    case 1: return GOOD_SQUARE_VALUE;
    case 3: return BAD_SQUARE_VALUE;
    default: return 0;
    }
}

void do_update(int idx, bool rev = false) {
    auto [x, y] = pos[idx];

    int factor = rev ? -1 : +1;
    i64 upd = 0;

    // Remove old squares
    for (auto dx: {-1, +1})
        for (auto dy: {-1, +1})
            upd -= get_square_value(x, y, dx, dy, idx - 1) * factor;

    // Add new squares
    for (auto dx: {-1, +1})
        for (auto dy: {-1, +1})
            upd += get_square_value(x, y, dx, dy, idx) * factor;

    // Push to segment
    segtree.update(idx, H * W, upd);
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    ::H = H, ::W = W;
    grid.assign(H, vector<int>(W));
    pos.resize(H * W);

    for (int i = 0; i < H * W; i++) {
        pos[i] = {R[i], C[i]};
        grid[R[i]][C[i]] = i;
    }

    segtree = SegTree(H * W);

    for (int i = 0; i < H * W; i++) {
        do_update(i);
    }
}

int swap_seats(int a, int b) {
    set<pair<int, int>> to_update;

    for (auto c: {a, b})
        for (int x = max(0, pos[c].first - 1); x <= min(H - 1, pos[c].first + 1); x++)
            for (int y = max(0, pos[c].second - 1); y <= min(W - 1, pos[c].second + 1); y++)
                to_update.emplace(x, y);

    for (auto [x, y]: to_update)
        do_update(grid[x][y], true);

    swap(pos[a], pos[b]);
    grid[pos[a].first][pos[a].second] = a;
    grid[pos[b].first][pos[b].second] = b;

    for (auto [x, y]: to_update)
        do_update(grid[x][y]);

    return segtree.query(0, H * W);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 348 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 41 ms 500 KB Output is correct
4 Correct 15 ms 344 KB Output is correct
5 Correct 13 ms 344 KB Output is correct
6 Correct 31 ms 348 KB Output is correct
7 Correct 40 ms 348 KB Output is correct
8 Correct 40 ms 348 KB Output is correct
9 Correct 35 ms 348 KB Output is correct
10 Correct 39 ms 492 KB Output is correct
11 Correct 33 ms 504 KB Output is correct
12 Correct 15 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 348 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 41 ms 500 KB Output is correct
4 Correct 15 ms 344 KB Output is correct
5 Correct 13 ms 344 KB Output is correct
6 Correct 31 ms 348 KB Output is correct
7 Correct 40 ms 348 KB Output is correct
8 Correct 40 ms 348 KB Output is correct
9 Correct 35 ms 348 KB Output is correct
10 Correct 39 ms 492 KB Output is correct
11 Correct 33 ms 504 KB Output is correct
12 Correct 15 ms 348 KB Output is correct
13 Correct 88 ms 1368 KB Output is correct
14 Correct 86 ms 1828 KB Output is correct
15 Correct 31 ms 1628 KB Output is correct
16 Correct 30 ms 2216 KB Output is correct
17 Correct 58 ms 1724 KB Output is correct
18 Correct 78 ms 1696 KB Output is correct
19 Correct 70 ms 1880 KB Output is correct
20 Correct 50 ms 1880 KB Output is correct
21 Correct 29 ms 1744 KB Output is correct
22 Correct 30 ms 2224 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 842 ms 77168 KB Output is correct
2 Correct 758 ms 93116 KB Output is correct
3 Correct 671 ms 93116 KB Output is correct
4 Correct 721 ms 93116 KB Output is correct
5 Correct 722 ms 93096 KB Output is correct
6 Correct 659 ms 93116 KB Output is correct
7 Correct 680 ms 93008 KB Output is correct
8 Correct 721 ms 93112 KB Output is correct
9 Correct 747 ms 93236 KB Output is correct
10 Correct 767 ms 93124 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 1516 KB Output is correct
2 Correct 172 ms 10628 KB Output is correct
3 Correct 745 ms 93092 KB Output is correct
4 Correct 857 ms 93112 KB Output is correct
5 Correct 594 ms 93144 KB Output is correct
6 Correct 1004 ms 143952 KB Output is correct
7 Correct 776 ms 93328 KB Output is correct
8 Correct 775 ms 93120 KB Output is correct
9 Correct 698 ms 93360 KB Output is correct
10 Correct 756 ms 96212 KB Output is correct
11 Correct 719 ms 116308 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1740 KB Output is correct
2 Correct 99 ms 1748 KB Output is correct
3 Correct 147 ms 1816 KB Output is correct
4 Correct 193 ms 1836 KB Output is correct
5 Correct 306 ms 3344 KB Output is correct
6 Correct 1027 ms 94100 KB Output is correct
7 Correct 1031 ms 94084 KB Output is correct
8 Correct 974 ms 94140 KB Output is correct
9 Correct 1163 ms 94060 KB Output is correct
10 Correct 980 ms 94092 KB Output is correct
11 Correct 946 ms 94104 KB Output is correct
12 Correct 916 ms 94088 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 348 KB Output is correct
2 Correct 32 ms 492 KB Output is correct
3 Correct 41 ms 500 KB Output is correct
4 Correct 15 ms 344 KB Output is correct
5 Correct 13 ms 344 KB Output is correct
6 Correct 31 ms 348 KB Output is correct
7 Correct 40 ms 348 KB Output is correct
8 Correct 40 ms 348 KB Output is correct
9 Correct 35 ms 348 KB Output is correct
10 Correct 39 ms 492 KB Output is correct
11 Correct 33 ms 504 KB Output is correct
12 Correct 15 ms 348 KB Output is correct
13 Correct 88 ms 1368 KB Output is correct
14 Correct 86 ms 1828 KB Output is correct
15 Correct 31 ms 1628 KB Output is correct
16 Correct 30 ms 2216 KB Output is correct
17 Correct 58 ms 1724 KB Output is correct
18 Correct 78 ms 1696 KB Output is correct
19 Correct 70 ms 1880 KB Output is correct
20 Correct 50 ms 1880 KB Output is correct
21 Correct 29 ms 1744 KB Output is correct
22 Correct 30 ms 2224 KB Output is correct
23 Correct 842 ms 77168 KB Output is correct
24 Correct 758 ms 93116 KB Output is correct
25 Correct 671 ms 93116 KB Output is correct
26 Correct 721 ms 93116 KB Output is correct
27 Correct 722 ms 93096 KB Output is correct
28 Correct 659 ms 93116 KB Output is correct
29 Correct 680 ms 93008 KB Output is correct
30 Correct 721 ms 93112 KB Output is correct
31 Correct 747 ms 93236 KB Output is correct
32 Correct 767 ms 93124 KB Output is correct
33 Correct 103 ms 1516 KB Output is correct
34 Correct 172 ms 10628 KB Output is correct
35 Correct 745 ms 93092 KB Output is correct
36 Correct 857 ms 93112 KB Output is correct
37 Correct 594 ms 93144 KB Output is correct
38 Correct 1004 ms 143952 KB Output is correct
39 Correct 776 ms 93328 KB Output is correct
40 Correct 775 ms 93120 KB Output is correct
41 Correct 698 ms 93360 KB Output is correct
42 Correct 756 ms 96212 KB Output is correct
43 Correct 719 ms 116308 KB Output is correct
44 Correct 48 ms 1740 KB Output is correct
45 Correct 99 ms 1748 KB Output is correct
46 Correct 147 ms 1816 KB Output is correct
47 Correct 193 ms 1836 KB Output is correct
48 Correct 306 ms 3344 KB Output is correct
49 Correct 1027 ms 94100 KB Output is correct
50 Correct 1031 ms 94084 KB Output is correct
51 Correct 974 ms 94140 KB Output is correct
52 Correct 1163 ms 94060 KB Output is correct
53 Correct 980 ms 94092 KB Output is correct
54 Correct 946 ms 94104 KB Output is correct
55 Correct 916 ms 94088 KB Output is correct
56 Correct 169 ms 2072 KB Output is correct
57 Correct 430 ms 2132 KB Output is correct
58 Correct 792 ms 3180 KB Output is correct
59 Correct 1881 ms 94112 KB Output is correct
60 Correct 2133 ms 94016 KB Output is correct
61 Correct 1782 ms 94160 KB Output is correct
62 Correct 1271 ms 93848 KB Output is correct
63 Correct 2153 ms 94088 KB Output is correct
64 Correct 1808 ms 94004 KB Output is correct
65 Correct 1621 ms 94036 KB Output is correct
66 Correct 1894 ms 94468 KB Output is correct
67 Correct 1760 ms 97208 KB Output is correct
68 Correct 1650 ms 108600 KB Output is correct
69 Correct 1973 ms 117568 KB Output is correct