oj.uz

Submission #964623

# Submission time Handle Problem Language Result Execution time Memory
964623 2024-04-17T08:24:54 Z fve5 Seats (IOI18_seats) C++17
100 / 100
 2073 ms 142428 KB 
#include <bits/stdc++.h>
#include "seats.h"
using namespace std;
    
typedef long long i64;
    
struct Info {
    i64 mi;
    int cnt;
};
    
void merge(const Info &a, const Info &b, Info &c) {
    if (a.mi < b.mi)
        c = a;
    else if (b.mi < a.mi)
        c = b;
    else
        c = {a.mi, a.cnt + b.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);
    
        merge(arr[2 * n], arr[2 * n + 1], arr[n]);
    }
    
    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--)
            merge(arr[2 * i], arr[2 * i + 1], arr[i]);
    }
};
    
#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 19 ms 564 KB Output is correct
2 Correct 31 ms 596 KB Output is correct
3 Correct 48 ms 552 KB Output is correct
4 Correct 17 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 32 ms 556 KB Output is correct
7 Correct 44 ms 556 KB Output is correct
8 Correct 38 ms 592 KB Output is correct
9 Correct 35 ms 568 KB Output is correct
10 Correct 43 ms 572 KB Output is correct
11 Correct 33 ms 604 KB Output is correct
12 Correct 18 ms 592 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 564 KB Output is correct
2 Correct 31 ms 596 KB Output is correct
3 Correct 48 ms 552 KB Output is correct
4 Correct 17 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 32 ms 556 KB Output is correct
7 Correct 44 ms 556 KB Output is correct
8 Correct 38 ms 592 KB Output is correct
9 Correct 35 ms 568 KB Output is correct
10 Correct 43 ms 572 KB Output is correct
11 Correct 33 ms 604 KB Output is correct
12 Correct 18 ms 592 KB Output is correct
13 Correct 91 ms 1720 KB Output is correct
14 Correct 83 ms 1624 KB Output is correct
15 Correct 37 ms 1724 KB Output is correct
16 Correct 37 ms 2212 KB Output is correct
17 Correct 58 ms 1716 KB Output is correct
18 Correct 84 ms 1688 KB Output is correct
19 Correct 70 ms 1720 KB Output is correct
20 Correct 52 ms 1924 KB Output is correct
21 Correct 29 ms 1624 KB Output is correct
22 Correct 29 ms 2224 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 901 ms 91840 KB Output is correct
2 Correct 775 ms 91844 KB Output is correct
3 Correct 720 ms 91836 KB Output is correct
4 Correct 768 ms 91844 KB Output is correct
5 Correct 776 ms 91836 KB Output is correct
6 Correct 685 ms 91836 KB Output is correct
7 Correct 641 ms 91836 KB Output is correct
8 Correct 699 ms 90172 KB Output is correct
9 Correct 726 ms 89916 KB Output is correct
10 Correct 724 ms 89836 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 1700 KB Output is correct
2 Correct 157 ms 10320 KB Output is correct
3 Correct 730 ms 89964 KB Output is correct
4 Correct 854 ms 90028 KB Output is correct
5 Correct 574 ms 89556 KB Output is correct
6 Correct 1028 ms 142428 KB Output is correct
7 Correct 769 ms 91548 KB Output is correct
8 Correct 774 ms 91576 KB Output is correct
9 Correct 756 ms 91732 KB Output is correct
10 Correct 725 ms 94648 KB Output is correct
11 Correct 686 ms 115284 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1924 KB Output is correct
2 Correct 108 ms 2016 KB Output is correct
3 Correct 164 ms 2064 KB Output is correct
4 Correct 189 ms 2012 KB Output is correct
5 Correct 288 ms 3160 KB Output is correct
6 Correct 1010 ms 92680 KB Output is correct
7 Correct 1012 ms 92764 KB Output is correct
8 Correct 934 ms 92816 KB Output is correct
9 Correct 1088 ms 92760 KB Output is correct
10 Correct 954 ms 92764 KB Output is correct
11 Correct 962 ms 92628 KB Output is correct
12 Correct 888 ms 93456 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 564 KB Output is correct
2 Correct 31 ms 596 KB Output is correct
3 Correct 48 ms 552 KB Output is correct
4 Correct 17 ms 604 KB Output is correct
5 Correct 13 ms 604 KB Output is correct
6 Correct 32 ms 556 KB Output is correct
7 Correct 44 ms 556 KB Output is correct
8 Correct 38 ms 592 KB Output is correct
9 Correct 35 ms 568 KB Output is correct
10 Correct 43 ms 572 KB Output is correct
11 Correct 33 ms 604 KB Output is correct
12 Correct 18 ms 592 KB Output is correct
13 Correct 91 ms 1720 KB Output is correct
14 Correct 83 ms 1624 KB Output is correct
15 Correct 37 ms 1724 KB Output is correct
16 Correct 37 ms 2212 KB Output is correct
17 Correct 58 ms 1716 KB Output is correct
18 Correct 84 ms 1688 KB Output is correct
19 Correct 70 ms 1720 KB Output is correct
20 Correct 52 ms 1924 KB Output is correct
21 Correct 29 ms 1624 KB Output is correct
22 Correct 29 ms 2224 KB Output is correct
23 Correct 901 ms 91840 KB Output is correct
24 Correct 775 ms 91844 KB Output is correct
25 Correct 720 ms 91836 KB Output is correct
26 Correct 768 ms 91844 KB Output is correct
27 Correct 776 ms 91836 KB Output is correct
28 Correct 685 ms 91836 KB Output is correct
29 Correct 641 ms 91836 KB Output is correct
30 Correct 699 ms 90172 KB Output is correct
31 Correct 726 ms 89916 KB Output is correct
32 Correct 724 ms 89836 KB Output is correct
33 Correct 103 ms 1700 KB Output is correct
34 Correct 157 ms 10320 KB Output is correct
35 Correct 730 ms 89964 KB Output is correct
36 Correct 854 ms 90028 KB Output is correct
37 Correct 574 ms 89556 KB Output is correct
38 Correct 1028 ms 142428 KB Output is correct
39 Correct 769 ms 91548 KB Output is correct
40 Correct 774 ms 91576 KB Output is correct
41 Correct 756 ms 91732 KB Output is correct
42 Correct 725 ms 94648 KB Output is correct
43 Correct 686 ms 115284 KB Output is correct
44 Correct 45 ms 1924 KB Output is correct
45 Correct 108 ms 2016 KB Output is correct
46 Correct 164 ms 2064 KB Output is correct
47 Correct 189 ms 2012 KB Output is correct
48 Correct 288 ms 3160 KB Output is correct
49 Correct 1010 ms 92680 KB Output is correct
50 Correct 1012 ms 92764 KB Output is correct
51 Correct 934 ms 92816 KB Output is correct
52 Correct 1088 ms 92760 KB Output is correct
53 Correct 954 ms 92764 KB Output is correct
54 Correct 962 ms 92628 KB Output is correct
55 Correct 888 ms 93456 KB Output is correct
56 Correct 172 ms 2048 KB Output is correct
57 Correct 416 ms 2120 KB Output is correct
58 Correct 775 ms 3128 KB Output is correct
59 Correct 1782 ms 93776 KB Output is correct
60 Correct 2073 ms 93564 KB Output is correct
61 Correct 1645 ms 92796 KB Output is correct
62 Correct 1186 ms 92412 KB Output is correct
63 Correct 1993 ms 92504 KB Output is correct
64 Correct 1754 ms 92536 KB Output is correct
65 Correct 1674 ms 92532 KB Output is correct
66 Correct 1831 ms 93228 KB Output is correct
67 Correct 1788 ms 95884 KB Output is correct
68 Correct 1607 ms 107092 KB Output is correct
69 Correct 1939 ms 116236 KB Output is correct