oj.uz

Submission #413782

# Submission time Handle Problem Language Result Execution time Memory
413782 2021-05-29T13:13:32 Z timmyfeng Seats (IOI18_seats) C++17
100 / 100
 2291 ms 177644 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1000000;
 
struct segtree {
    segtree *left, *right;
    int mini, count, lazy;
 
    void apply(int x) {
        lazy += x, mini += x;
    }
 
    void push() {
        if (lazy != 0) {
            left->apply(lazy);
            right->apply(lazy);
            lazy = 0;
        }
    }
 
    void pull() {
        mini = min(left->mini, right->mini);
        count = 0;
        if (left->mini == mini) {
            count += left->count;
        }
        if (right->mini == mini) {
            count += right->count;
        }
    }
 
    segtree(int l, int r, int *x) {
        lazy = 0;
        if (l == r) {
            mini = x[l], count = 1;
        } else {
            int m = (l + r) / 2;
            left = new segtree(l, m, x);
            right = new segtree(m + 1, r, x);
            pull();
        }
    }
 
    void update(int a, int b, int x, int l, int r) {
        if (a <= l && r <= b) {
            apply(x);
        } else {
            push();
            int m = (l + r) / 2;
            if (a <= m) {
                left->update(a, b, x, l, m);
            }
            if (b > m) {
                right->update(a, b, x, m + 1, r);
            }
            pull();
        }
    }
};
 
array<int, 2> pos[N];
vector<int> seats[N];
int sum[N], n, m;
segtree *mini;
 
void update(int i, int j, int k) {
    vector<int> in;
    for (int r = max(0, i - 1); r <= min(n - 1, i); ++r) {
        for (int c = max(0, j - 1); c <= min(m - 1, j); ++c) {
            in.push_back(seats[r][c]);
        }
    }
    sort(in.begin(), in.end());

    if (k == 0) {
        ++sum[in[0]];
        if (in.size() > 1) {
            --sum[in[1]];
            if (in.size() == 4) {
                ++sum[in[2]], --sum[in[3]];
            }
        }
    } else {
        mini->update(in[0], (in.size() == 1 ? n * m : in[1]) - 1, k, 0, n * m - 1);
        if (in.size() == 4) {
            mini->update(in[2], in[3] - 1, k, 0, n * m - 1);
        }
    }
}
 
void give_initial_chart(int n, int m, vector<int> r, vector<int> c) {
    ::n = n, ::m = m;
    fill(seats, seats + n, vector<int>(m));
    for (int i = 0; i < n * m; ++i) {
        seats[r[i]][c[i]] = i;
        pos[i] = {r[i], c[i]};
    }
 
    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j <= m; ++j) {
            update(i, j, 0);
        }
    }

    partial_sum(sum, sum + n * m, sum);
    mini = new segtree(0, n * m - 1, sum);
}
 
int swap_seats(int a, int b) {
    vector<array<int, 2>> cells;
    for (auto k : {a, b}) {
        auto [i, j] = pos[k];
        for (auto ki : {0, 1}) {
            for (auto kj : {0, 1}) {
                cells.push_back({i + ki, j + kj});
            }
        }
    }
 
    sort(cells.begin(), cells.end());
    cells.erase(unique(cells.begin(), cells.end()), cells.end());
 
    for (auto [i, j] : cells) {
        update(i, j, -1);
    }
 
    swap(seats[pos[a][0]][pos[a][1]], seats[pos[b][0]][pos[b][1]]);
    swap(pos[a], pos[b]);
 
    for (auto [i, j] : cells) {
        update(i, j, 1);
    }
 
    return mini->count;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 23832 KB Output is correct
2 Correct 41 ms 23840 KB Output is correct
3 Correct 55 ms 23880 KB Output is correct
4 Correct 39 ms 23976 KB Output is correct
5 Correct 34 ms 23864 KB Output is correct
6 Correct 59 ms 23876 KB Output is correct
7 Correct 51 ms 23852 KB Output is correct
8 Correct 50 ms 23876 KB Output is correct
9 Correct 47 ms 23900 KB Output is correct
10 Correct 53 ms 23876 KB Output is correct
11 Correct 51 ms 23860 KB Output is correct
12 Correct 35 ms 23912 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 23832 KB Output is correct
2 Correct 41 ms 23840 KB Output is correct
3 Correct 55 ms 23880 KB Output is correct
4 Correct 39 ms 23976 KB Output is correct
5 Correct 34 ms 23864 KB Output is correct
6 Correct 59 ms 23876 KB Output is correct
7 Correct 51 ms 23852 KB Output is correct
8 Correct 50 ms 23876 KB Output is correct
9 Correct 47 ms 23900 KB Output is correct
10 Correct 53 ms 23876 KB Output is correct
11 Correct 51 ms 23860 KB Output is correct
12 Correct 35 ms 23912 KB Output is correct
13 Correct 99 ms 25060 KB Output is correct
14 Correct 104 ms 25036 KB Output is correct
15 Correct 66 ms 25064 KB Output is correct
16 Correct 49 ms 25336 KB Output is correct
17 Correct 76 ms 25052 KB Output is correct
18 Correct 78 ms 25188 KB Output is correct
19 Correct 73 ms 25084 KB Output is correct
20 Correct 64 ms 25156 KB Output is correct
21 Correct 55 ms 25068 KB Output is correct
22 Correct 63 ms 25312 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 770 ms 148988 KB Output is correct
2 Correct 646 ms 148968 KB Output is correct
3 Correct 630 ms 149000 KB Output is correct
4 Correct 617 ms 148996 KB Output is correct
5 Correct 623 ms 149060 KB Output is correct
6 Correct 624 ms 148952 KB Output is correct
7 Correct 690 ms 149124 KB Output is correct
8 Correct 645 ms 149064 KB Output is correct
9 Correct 706 ms 148992 KB Output is correct
10 Correct 620 ms 149064 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 25156 KB Output is correct
2 Correct 145 ms 34996 KB Output is correct
3 Correct 622 ms 148992 KB Output is correct
4 Correct 793 ms 148968 KB Output is correct
5 Correct 605 ms 148988 KB Output is correct
6 Correct 877 ms 176416 KB Output is correct
7 Correct 633 ms 148968 KB Output is correct
8 Correct 647 ms 149132 KB Output is correct
9 Correct 641 ms 149120 KB Output is correct
10 Correct 635 ms 149828 KB Output is correct
11 Correct 660 ms 160764 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 24804 KB Output is correct
2 Correct 170 ms 24824 KB Output is correct
3 Correct 227 ms 24788 KB Output is correct
4 Correct 273 ms 24840 KB Output is correct
5 Correct 425 ms 25992 KB Output is correct
6 Correct 1126 ms 149372 KB Output is correct
7 Correct 1166 ms 149344 KB Output is correct
8 Correct 1178 ms 149452 KB Output is correct
9 Correct 1461 ms 149500 KB Output is correct
10 Correct 1070 ms 149376 KB Output is correct
11 Correct 997 ms 149300 KB Output is correct
12 Correct 974 ms 149308 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 23832 KB Output is correct
2 Correct 41 ms 23840 KB Output is correct
3 Correct 55 ms 23880 KB Output is correct
4 Correct 39 ms 23976 KB Output is correct
5 Correct 34 ms 23864 KB Output is correct
6 Correct 59 ms 23876 KB Output is correct
7 Correct 51 ms 23852 KB Output is correct
8 Correct 50 ms 23876 KB Output is correct
9 Correct 47 ms 23900 KB Output is correct
10 Correct 53 ms 23876 KB Output is correct
11 Correct 51 ms 23860 KB Output is correct
12 Correct 35 ms 23912 KB Output is correct
13 Correct 99 ms 25060 KB Output is correct
14 Correct 104 ms 25036 KB Output is correct
15 Correct 66 ms 25064 KB Output is correct
16 Correct 49 ms 25336 KB Output is correct
17 Correct 76 ms 25052 KB Output is correct
18 Correct 78 ms 25188 KB Output is correct
19 Correct 73 ms 25084 KB Output is correct
20 Correct 64 ms 25156 KB Output is correct
21 Correct 55 ms 25068 KB Output is correct
22 Correct 63 ms 25312 KB Output is correct
23 Correct 770 ms 148988 KB Output is correct
24 Correct 646 ms 148968 KB Output is correct
25 Correct 630 ms 149000 KB Output is correct
26 Correct 617 ms 148996 KB Output is correct
27 Correct 623 ms 149060 KB Output is correct
28 Correct 624 ms 148952 KB Output is correct
29 Correct 690 ms 149124 KB Output is correct
30 Correct 645 ms 149064 KB Output is correct
31 Correct 706 ms 148992 KB Output is correct
32 Correct 620 ms 149064 KB Output is correct
33 Correct 90 ms 25156 KB Output is correct
34 Correct 145 ms 34996 KB Output is correct
35 Correct 622 ms 148992 KB Output is correct
36 Correct 793 ms 148968 KB Output is correct
37 Correct 605 ms 148988 KB Output is correct
38 Correct 877 ms 176416 KB Output is correct
39 Correct 633 ms 148968 KB Output is correct
40 Correct 647 ms 149132 KB Output is correct
41 Correct 641 ms 149120 KB Output is correct
42 Correct 635 ms 149828 KB Output is correct
43 Correct 660 ms 160764 KB Output is correct
44 Correct 118 ms 24804 KB Output is correct
45 Correct 170 ms 24824 KB Output is correct
46 Correct 227 ms 24788 KB Output is correct
47 Correct 273 ms 24840 KB Output is correct
48 Correct 425 ms 25992 KB Output is correct
49 Correct 1126 ms 149372 KB Output is correct
50 Correct 1166 ms 149344 KB Output is correct
51 Correct 1178 ms 149452 KB Output is correct
52 Correct 1461 ms 149500 KB Output is correct
53 Correct 1070 ms 149376 KB Output is correct
54 Correct 997 ms 149300 KB Output is correct
55 Correct 974 ms 149308 KB Output is correct
56 Correct 201 ms 24748 KB Output is correct
57 Correct 416 ms 24884 KB Output is correct
58 Correct 609 ms 26068 KB Output is correct
59 Correct 1608 ms 149316 KB Output is correct
60 Correct 2291 ms 149320 KB Output is correct
61 Correct 1376 ms 165916 KB Output is correct
62 Correct 1180 ms 165984 KB Output is correct
63 Correct 2029 ms 165932 KB Output is correct
64 Correct 1525 ms 166076 KB Output is correct
65 Correct 1356 ms 165940 KB Output is correct
66 Correct 1630 ms 166124 KB Output is correct
67 Correct 1497 ms 166744 KB Output is correct
68 Correct 1263 ms 172536 KB Output is correct
69 Correct 1934 ms 177644 KB Output is correct