oj.uz

Submission #964616

# Submission time Handle Problem Language Result Execution time Memory
964616 2024-04-17T08:15:54 Z fve5 Seats (IOI18_seats) C++17
100 / 100
 2182 ms 140292 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) {
    vector<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_back(x, y);

    sort(to_update.begin(), to_update.end());
    to_update.resize(unique(to_update.begin(), to_update.end()) - to_update.begin());

    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 604 KB Output is correct
2 Correct 28 ms 552 KB Output is correct
3 Correct 40 ms 560 KB Output is correct
4 Correct 19 ms 600 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 30 ms 592 KB Output is correct
7 Correct 38 ms 544 KB Output is correct
8 Correct 33 ms 592 KB Output is correct
9 Correct 32 ms 604 KB Output is correct
10 Correct 39 ms 808 KB Output is correct
11 Correct 29 ms 584 KB Output is correct
12 Correct 15 ms 604 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 604 KB Output is correct
2 Correct 28 ms 552 KB Output is correct
3 Correct 40 ms 560 KB Output is correct
4 Correct 19 ms 600 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 30 ms 592 KB Output is correct
7 Correct 38 ms 544 KB Output is correct
8 Correct 33 ms 592 KB Output is correct
9 Correct 32 ms 604 KB Output is correct
10 Correct 39 ms 808 KB Output is correct
11 Correct 29 ms 584 KB Output is correct
12 Correct 15 ms 604 KB Output is correct
13 Correct 82 ms 1712 KB Output is correct
14 Correct 85 ms 1692 KB Output is correct
15 Correct 33 ms 1628 KB Output is correct
16 Correct 31 ms 2204 KB Output is correct
17 Correct 62 ms 1720 KB Output is correct
18 Correct 76 ms 1712 KB Output is correct
19 Correct 68 ms 1624 KB Output is correct
20 Correct 58 ms 1928 KB Output is correct
21 Correct 30 ms 1732 KB Output is correct
22 Correct 30 ms 2140 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 840 ms 91500 KB Output is correct
2 Correct 816 ms 91500 KB Output is correct
3 Correct 717 ms 91500 KB Output is correct
4 Correct 763 ms 91276 KB Output is correct
5 Correct 791 ms 91500 KB Output is correct
6 Correct 688 ms 91500 KB Output is correct
7 Correct 730 ms 91308 KB Output is correct
8 Correct 723 ms 91512 KB Output is correct
9 Correct 719 ms 91504 KB Output is correct
10 Correct 713 ms 91504 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1724 KB Output is correct
2 Correct 163 ms 10208 KB Output is correct
3 Correct 711 ms 91508 KB Output is correct
4 Correct 803 ms 91504 KB Output is correct
5 Correct 602 ms 89188 KB Output is correct
6 Correct 996 ms 140292 KB Output is correct
7 Correct 802 ms 89420 KB Output is correct
8 Correct 776 ms 89456 KB Output is correct
9 Correct 730 ms 89800 KB Output is correct
10 Correct 756 ms 92508 KB Output is correct
11 Correct 762 ms 113208 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1960 KB Output is correct
2 Correct 96 ms 1996 KB Output is correct
3 Correct 150 ms 2096 KB Output is correct
4 Correct 210 ms 2116 KB Output is correct
5 Correct 286 ms 3436 KB Output is correct
6 Correct 1055 ms 92336 KB Output is correct
7 Correct 1053 ms 92328 KB Output is correct
8 Correct 1027 ms 92128 KB Output is correct
9 Correct 1136 ms 92332 KB Output is correct
10 Correct 970 ms 92328 KB Output is correct
11 Correct 995 ms 92328 KB Output is correct
12 Correct 929 ms 92328 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 604 KB Output is correct
2 Correct 28 ms 552 KB Output is correct
3 Correct 40 ms 560 KB Output is correct
4 Correct 19 ms 600 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 30 ms 592 KB Output is correct
7 Correct 38 ms 544 KB Output is correct
8 Correct 33 ms 592 KB Output is correct
9 Correct 32 ms 604 KB Output is correct
10 Correct 39 ms 808 KB Output is correct
11 Correct 29 ms 584 KB Output is correct
12 Correct 15 ms 604 KB Output is correct
13 Correct 82 ms 1712 KB Output is correct
14 Correct 85 ms 1692 KB Output is correct
15 Correct 33 ms 1628 KB Output is correct
16 Correct 31 ms 2204 KB Output is correct
17 Correct 62 ms 1720 KB Output is correct
18 Correct 76 ms 1712 KB Output is correct
19 Correct 68 ms 1624 KB Output is correct
20 Correct 58 ms 1928 KB Output is correct
21 Correct 30 ms 1732 KB Output is correct
22 Correct 30 ms 2140 KB Output is correct
23 Correct 840 ms 91500 KB Output is correct
24 Correct 816 ms 91500 KB Output is correct
25 Correct 717 ms 91500 KB Output is correct
26 Correct 763 ms 91276 KB Output is correct
27 Correct 791 ms 91500 KB Output is correct
28 Correct 688 ms 91500 KB Output is correct
29 Correct 730 ms 91308 KB Output is correct
30 Correct 723 ms 91512 KB Output is correct
31 Correct 719 ms 91504 KB Output is correct
32 Correct 713 ms 91504 KB Output is correct
33 Correct 99 ms 1724 KB Output is correct
34 Correct 163 ms 10208 KB Output is correct
35 Correct 711 ms 91508 KB Output is correct
36 Correct 803 ms 91504 KB Output is correct
37 Correct 602 ms 89188 KB Output is correct
38 Correct 996 ms 140292 KB Output is correct
39 Correct 802 ms 89420 KB Output is correct
40 Correct 776 ms 89456 KB Output is correct
41 Correct 730 ms 89800 KB Output is correct
42 Correct 756 ms 92508 KB Output is correct
43 Correct 762 ms 113208 KB Output is correct
44 Correct 46 ms 1960 KB Output is correct
45 Correct 96 ms 1996 KB Output is correct
46 Correct 150 ms 2096 KB Output is correct
47 Correct 210 ms 2116 KB Output is correct
48 Correct 286 ms 3436 KB Output is correct
49 Correct 1055 ms 92336 KB Output is correct
50 Correct 1053 ms 92328 KB Output is correct
51 Correct 1027 ms 92128 KB Output is correct
52 Correct 1136 ms 92332 KB Output is correct
53 Correct 970 ms 92328 KB Output is correct
54 Correct 995 ms 92328 KB Output is correct
55 Correct 929 ms 92328 KB Output is correct
56 Correct 169 ms 2048 KB Output is correct
57 Correct 381 ms 2008 KB Output is correct
58 Correct 791 ms 3224 KB Output is correct
59 Correct 1859 ms 92204 KB Output is correct
60 Correct 2182 ms 90320 KB Output is correct
61 Correct 1657 ms 90236 KB Output is correct
62 Correct 1223 ms 90284 KB Output is correct
63 Correct 2091 ms 90384 KB Output is correct
64 Correct 1793 ms 90292 KB Output is correct
65 Correct 1639 ms 90316 KB Output is correct
66 Correct 1912 ms 90668 KB Output is correct
67 Correct 1797 ms 95568 KB Output is correct
68 Correct 1658 ms 106680 KB Output is correct
69 Correct 1925 ms 115808 KB Output is correct