oj.uz

Submission #964619

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

typedef int 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 1

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 15 ms 600 KB Output is correct
2 Correct 32 ms 560 KB Output is correct
3 Correct 42 ms 596 KB Output is correct
4 Correct 20 ms 584 KB Output is correct
5 Correct 19 ms 552 KB Output is correct
6 Correct 36 ms 568 KB Output is correct
7 Correct 38 ms 540 KB Output is correct
8 Correct 37 ms 532 KB Output is correct
9 Correct 34 ms 596 KB Output is correct
10 Correct 39 ms 596 KB Output is correct
11 Correct 30 ms 604 KB Output is correct
12 Correct 16 ms 600 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 600 KB Output is correct
2 Correct 32 ms 560 KB Output is correct
3 Correct 42 ms 596 KB Output is correct
4 Correct 20 ms 584 KB Output is correct
5 Correct 19 ms 552 KB Output is correct
6 Correct 36 ms 568 KB Output is correct
7 Correct 38 ms 540 KB Output is correct
8 Correct 37 ms 532 KB Output is correct
9 Correct 34 ms 596 KB Output is correct
10 Correct 39 ms 596 KB Output is correct
11 Correct 30 ms 604 KB Output is correct
12 Correct 16 ms 600 KB Output is correct
13 Correct 84 ms 1112 KB Output is correct
14 Correct 91 ms 1308 KB Output is correct
15 Correct 31 ms 1344 KB Output is correct
16 Correct 27 ms 1624 KB Output is correct
17 Correct 56 ms 1328 KB Output is correct
18 Correct 78 ms 1112 KB Output is correct
19 Correct 75 ms 1340 KB Output is correct
20 Correct 50 ms 1372 KB Output is correct
21 Correct 29 ms 1372 KB Output is correct
22 Correct 30 ms 1840 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 811 ms 64908 KB Output is correct
2 Correct 772 ms 65064 KB Output is correct
3 Correct 706 ms 64852 KB Output is correct
4 Correct 753 ms 65076 KB Output is correct
5 Correct 775 ms 64972 KB Output is correct
6 Correct 699 ms 65088 KB Output is correct
7 Correct 735 ms 65084 KB Output is correct
8 Correct 787 ms 65300 KB Output is correct
9 Correct 814 ms 66968 KB Output is correct
10 Correct 795 ms 66960 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 1316 KB Output is correct
2 Correct 168 ms 7336 KB Output is correct
3 Correct 758 ms 66960 KB Output is correct
4 Correct 814 ms 66992 KB Output is correct
5 Correct 630 ms 67100 KB Output is correct
6 Correct 975 ms 117804 KB Output is correct
7 Correct 797 ms 67096 KB Output is correct
8 Correct 743 ms 67136 KB Output is correct
9 Correct 743 ms 67516 KB Output is correct
10 Correct 761 ms 70224 KB Output is correct
11 Correct 725 ms 89040 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2000 KB Output is correct
2 Correct 87 ms 2100 KB Output is correct
3 Correct 148 ms 1996 KB Output is correct
4 Correct 187 ms 2028 KB Output is correct
5 Correct 271 ms 2828 KB Output is correct
6 Correct 975 ms 65820 KB Output is correct
7 Correct 1002 ms 65916 KB Output is correct
8 Correct 967 ms 65912 KB Output is correct
9 Correct 1164 ms 65728 KB Output is correct
10 Correct 914 ms 65784 KB Output is correct
11 Correct 928 ms 65912 KB Output is correct
12 Correct 925 ms 65916 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 600 KB Output is correct
2 Correct 32 ms 560 KB Output is correct
3 Correct 42 ms 596 KB Output is correct
4 Correct 20 ms 584 KB Output is correct
5 Correct 19 ms 552 KB Output is correct
6 Correct 36 ms 568 KB Output is correct
7 Correct 38 ms 540 KB Output is correct
8 Correct 37 ms 532 KB Output is correct
9 Correct 34 ms 596 KB Output is correct
10 Correct 39 ms 596 KB Output is correct
11 Correct 30 ms 604 KB Output is correct
12 Correct 16 ms 600 KB Output is correct
13 Correct 84 ms 1112 KB Output is correct
14 Correct 91 ms 1308 KB Output is correct
15 Correct 31 ms 1344 KB Output is correct
16 Correct 27 ms 1624 KB Output is correct
17 Correct 56 ms 1328 KB Output is correct
18 Correct 78 ms 1112 KB Output is correct
19 Correct 75 ms 1340 KB Output is correct
20 Correct 50 ms 1372 KB Output is correct
21 Correct 29 ms 1372 KB Output is correct
22 Correct 30 ms 1840 KB Output is correct
23 Correct 811 ms 64908 KB Output is correct
24 Correct 772 ms 65064 KB Output is correct
25 Correct 706 ms 64852 KB Output is correct
26 Correct 753 ms 65076 KB Output is correct
27 Correct 775 ms 64972 KB Output is correct
28 Correct 699 ms 65088 KB Output is correct
29 Correct 735 ms 65084 KB Output is correct
30 Correct 787 ms 65300 KB Output is correct
31 Correct 814 ms 66968 KB Output is correct
32 Correct 795 ms 66960 KB Output is correct
33 Correct 100 ms 1316 KB Output is correct
34 Correct 168 ms 7336 KB Output is correct
35 Correct 758 ms 66960 KB Output is correct
36 Correct 814 ms 66992 KB Output is correct
37 Correct 630 ms 67100 KB Output is correct
38 Correct 975 ms 117804 KB Output is correct
39 Correct 797 ms 67096 KB Output is correct
40 Correct 743 ms 67136 KB Output is correct
41 Correct 743 ms 67516 KB Output is correct
42 Correct 761 ms 70224 KB Output is correct
43 Correct 725 ms 89040 KB Output is correct
44 Correct 48 ms 2000 KB Output is correct
45 Correct 87 ms 2100 KB Output is correct
46 Correct 148 ms 1996 KB Output is correct
47 Correct 187 ms 2028 KB Output is correct
48 Correct 271 ms 2828 KB Output is correct
49 Correct 975 ms 65820 KB Output is correct
50 Correct 1002 ms 65916 KB Output is correct
51 Correct 967 ms 65912 KB Output is correct
52 Correct 1164 ms 65728 KB Output is correct
53 Correct 914 ms 65784 KB Output is correct
54 Correct 928 ms 65912 KB Output is correct
55 Correct 925 ms 65916 KB Output is correct
56 Correct 149 ms 2056 KB Output is correct
57 Correct 400 ms 1932 KB Output is correct
58 Correct 732 ms 2908 KB Output is correct
59 Correct 1773 ms 65796 KB Output is correct
60 Correct 2156 ms 65952 KB Output is correct
61 Correct 1703 ms 65884 KB Output is correct
62 Correct 1272 ms 67960 KB Output is correct
63 Correct 1987 ms 67728 KB Output is correct
64 Correct 1769 ms 67784 KB Output is correct
65 Correct 1648 ms 67880 KB Output is correct
66 Correct 1845 ms 66820 KB Output is correct
67 Correct 1757 ms 69048 KB Output is correct
68 Correct 1640 ms 80020 KB Output is correct
69 Correct 1922 ms 89396 KB Output is correct