oj.uz

Submission #204699

# Submission time Handle Problem Language Result Execution time Memory
204699 2020-02-26T17:16:23 Z waynetuinfor Seats (IOI18_seats) C++17
100 / 100
 3813 ms 125668 KB 
#pragma GCC optimize("O3")
#include "seats.h"

#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> gr;
vector<pair<int, int>> tree;
vector<int> tag;
vector<pair<int, int>> pos;
int n;

pair<int, int> Merge(const pair<int, int> &a, const pair<int, int> &b) {
    if (a.first < b.first) return a;
    if (a.first > b.first) return b;
    return make_pair(a.first, a.second + b.second);
}

void BuildTree(int l, int r, int o = 0) {
    if (r - l == 1) {
        tree[o] = make_pair(0, 1);
        if (l == n - 1) tree[o].first = n * 10;
        return;
    }
    int m = (l + r) >> 1;
    BuildTree(l, m, o * 2 + 1);
    BuildTree(m, r, o * 2 + 2);
    tree[o] = Merge(tree[o * 2 + 1], tree[o * 2 + 2]);
}

void Push(int o) {
    for (int v = 1; v <= 2; ++v) {
        tree[o * 2 + v].first += tag[o];
        tag[o * 2 + v] += tag[o];
    }
    tag[o] = 0;
}

void Modify(int l, int r, int ql, int qr, int v, int o = 0) {
    if (l >= qr || ql >= r) return;
    if (l >= ql && r <= qr) {
        tree[o].first += v;
        tag[o] += v;
        return;
    }
    Push(o);
    int m = (l + r) >> 1;
    Modify(l, m, ql, qr, v, o * 2 + 1);
    Modify(m, r, ql, qr, v, o * 2 + 2);
    tree[o] = Merge(tree[o * 2 + 1], tree[o * 2 + 2]);
}

void UpdateRect(int x, int y, int v) {
    array<int, 4> w = {gr[x - 1][y - 1], gr[x - 1][y], gr[x][y - 1], gr[x][y]};
    sort(w.begin(), w.end());
    Modify(0, n, w[0], w[1], v);
    Modify(0, n, w[2], w[3], v);
}

void give_initial_chart(int h, int w, vector<int> r, vector<int> c) {
    gr.resize(h + 2, vector<int>(w + 2, h * w));
    pos.resize(h * w);
    for (int i = 0; i < h * w; ++i) {
        gr[r[i] + 1][c[i] + 1] = i;
        pos[i] = make_pair(r[i] + 1, c[i] + 1);
    }
    n = h * w + 1;
    tree.resize(n * 4);
    tag.resize(n * 4);
    BuildTree(0, n);
    for (int i = 1; i <= h + 1; ++i) {
        for (int j = 1; j <= w + 1; ++j) UpdateRect(i, j, 1);
    }
}

int swap_seats(int a, int b) {
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) UpdateRect(pos[a].first + i, pos[a].second + j, -1);
    }
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) UpdateRect(pos[b].first + i, pos[b].second + j, -1);
    }
    assert(gr[pos[a].first][pos[a].second] == a);
    assert(gr[pos[b].first][pos[b].second] == b);
    swap(gr[pos[a].first][pos[a].second], gr[pos[b].first][pos[b].second]);
    swap(pos[a], pos[b]);
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) UpdateRect(pos[a].first + i, pos[a].second + j, 1);
    }
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) UpdateRect(pos[b].first + i, pos[b].second + j, 1);
    }
    assert(tree[0].first == 4);
    return tree[0].second;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 504 KB Output is correct
2 Correct 28 ms 504 KB Output is correct
3 Correct 43 ms 504 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 31 ms 504 KB Output is correct
6 Correct 34 ms 504 KB Output is correct
7 Correct 48 ms 504 KB Output is correct
8 Correct 36 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 37 ms 632 KB Output is correct
11 Correct 42 ms 504 KB Output is correct
12 Correct 29 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 504 KB Output is correct
2 Correct 28 ms 504 KB Output is correct
3 Correct 43 ms 504 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 31 ms 504 KB Output is correct
6 Correct 34 ms 504 KB Output is correct
7 Correct 48 ms 504 KB Output is correct
8 Correct 36 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 37 ms 632 KB Output is correct
11 Correct 42 ms 504 KB Output is correct
12 Correct 29 ms 504 KB Output is correct
13 Correct 119 ms 1400 KB Output is correct
14 Correct 89 ms 1272 KB Output is correct
15 Correct 82 ms 1400 KB Output is correct
16 Correct 70 ms 1912 KB Output is correct
17 Correct 82 ms 1404 KB Output is correct
18 Correct 71 ms 1272 KB Output is correct
19 Correct 63 ms 1400 KB Output is correct
20 Correct 69 ms 1528 KB Output is correct
21 Correct 64 ms 1400 KB Output is correct
22 Correct 72 ms 1784 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2338 ms 76900 KB Output is correct
2 Correct 1300 ms 76892 KB Output is correct
3 Correct 1253 ms 76792 KB Output is correct
4 Correct 1080 ms 76504 KB Output is correct
5 Correct 1148 ms 76408 KB Output is correct
6 Correct 1058 ms 76540 KB Output is correct
7 Correct 1151 ms 75912 KB Output is correct
8 Correct 1256 ms 74844 KB Output is correct
9 Correct 1191 ms 74952 KB Output is correct
10 Correct 1146 ms 74764 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 1144 KB Output is correct
2 Correct 187 ms 7036 KB Output is correct
3 Correct 1104 ms 74892 KB Output is correct
4 Correct 2274 ms 74744 KB Output is correct
5 Correct 1686 ms 82632 KB Output is correct
6 Correct 2865 ms 125668 KB Output is correct
7 Correct 1264 ms 77424 KB Output is correct
8 Correct 1317 ms 74912 KB Output is correct
9 Correct 1182 ms 75256 KB Output is correct
10 Correct 1171 ms 79456 KB Output is correct
11 Correct 1437 ms 98272 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 1396 KB Output is correct
2 Correct 157 ms 1380 KB Output is correct
3 Correct 256 ms 1396 KB Output is correct
4 Correct 316 ms 1408 KB Output is correct
5 Correct 536 ms 2368 KB Output is correct
6 Correct 2458 ms 83120 KB Output is correct
7 Correct 2824 ms 82980 KB Output is correct
8 Correct 2532 ms 83120 KB Output is correct
9 Correct 3813 ms 83120 KB Output is correct
10 Correct 2326 ms 83224 KB Output is correct
11 Correct 2273 ms 83096 KB Output is correct
12 Correct 2227 ms 83092 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 504 KB Output is correct
2 Correct 28 ms 504 KB Output is correct
3 Correct 43 ms 504 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 31 ms 504 KB Output is correct
6 Correct 34 ms 504 KB Output is correct
7 Correct 48 ms 504 KB Output is correct
8 Correct 36 ms 504 KB Output is correct
9 Correct 38 ms 508 KB Output is correct
10 Correct 37 ms 632 KB Output is correct
11 Correct 42 ms 504 KB Output is correct
12 Correct 29 ms 504 KB Output is correct
13 Correct 119 ms 1400 KB Output is correct
14 Correct 89 ms 1272 KB Output is correct
15 Correct 82 ms 1400 KB Output is correct
16 Correct 70 ms 1912 KB Output is correct
17 Correct 82 ms 1404 KB Output is correct
18 Correct 71 ms 1272 KB Output is correct
19 Correct 63 ms 1400 KB Output is correct
20 Correct 69 ms 1528 KB Output is correct
21 Correct 64 ms 1400 KB Output is correct
22 Correct 72 ms 1784 KB Output is correct
23 Correct 2338 ms 76900 KB Output is correct
24 Correct 1300 ms 76892 KB Output is correct
25 Correct 1253 ms 76792 KB Output is correct
26 Correct 1080 ms 76504 KB Output is correct
27 Correct 1148 ms 76408 KB Output is correct
28 Correct 1058 ms 76540 KB Output is correct
29 Correct 1151 ms 75912 KB Output is correct
30 Correct 1256 ms 74844 KB Output is correct
31 Correct 1191 ms 74952 KB Output is correct
32 Correct 1146 ms 74764 KB Output is correct
33 Correct 78 ms 1144 KB Output is correct
34 Correct 187 ms 7036 KB Output is correct
35 Correct 1104 ms 74892 KB Output is correct
36 Correct 2274 ms 74744 KB Output is correct
37 Correct 1686 ms 82632 KB Output is correct
38 Correct 2865 ms 125668 KB Output is correct
39 Correct 1264 ms 77424 KB Output is correct
40 Correct 1317 ms 74912 KB Output is correct
41 Correct 1182 ms 75256 KB Output is correct
42 Correct 1171 ms 79456 KB Output is correct
43 Correct 1437 ms 98272 KB Output is correct
44 Correct 93 ms 1396 KB Output is correct
45 Correct 157 ms 1380 KB Output is correct
46 Correct 256 ms 1396 KB Output is correct
47 Correct 316 ms 1408 KB Output is correct
48 Correct 536 ms 2368 KB Output is correct
49 Correct 2458 ms 83120 KB Output is correct
50 Correct 2824 ms 82980 KB Output is correct
51 Correct 2532 ms 83120 KB Output is correct
52 Correct 3813 ms 83120 KB Output is correct
53 Correct 2326 ms 83224 KB Output is correct
54 Correct 2273 ms 83096 KB Output is correct
55 Correct 2227 ms 83092 KB Output is correct
56 Correct 160 ms 2036 KB Output is correct
57 Correct 322 ms 2036 KB Output is correct
58 Correct 535 ms 2912 KB Output is correct
59 Correct 1970 ms 92024 KB Output is correct
60 Correct 3446 ms 91832 KB Output is correct
61 Correct 1813 ms 92024 KB Output is correct
62 Correct 2013 ms 95864 KB Output is correct
63 Correct 3473 ms 94368 KB Output is correct
64 Correct 2199 ms 92784 KB Output is correct
65 Correct 1885 ms 91924 KB Output is correct
66 Correct 2039 ms 92280 KB Output is correct
67 Correct 2138 ms 96632 KB Output is correct
68 Correct 1874 ms 106232 KB Output is correct
69 Correct 3403 ms 115208 KB Output is correct