oj.uz

Submission #964624

# Submission time Handle Problem Language Result Execution time Memory
964624 2024-04-17T08:26:02 Z fve5 Seats (IOI18_seats) C++17
100 / 100
 1917 ms 142596 KB 
#pragma GCC optimize("Ofast")
#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 17 ms 348 KB Output is correct
2 Correct 25 ms 544 KB Output is correct
3 Correct 41 ms 576 KB Output is correct
4 Correct 16 ms 604 KB Output is correct
5 Correct 16 ms 588 KB Output is correct
6 Correct 37 ms 548 KB Output is correct
7 Correct 33 ms 596 KB Output is correct
8 Correct 40 ms 700 KB Output is correct
9 Correct 29 ms 596 KB Output is correct
10 Correct 33 ms 572 KB Output is correct
11 Correct 29 ms 556 KB Output is correct
12 Correct 13 ms 520 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 348 KB Output is correct
2 Correct 25 ms 544 KB Output is correct
3 Correct 41 ms 576 KB Output is correct
4 Correct 16 ms 604 KB Output is correct
5 Correct 16 ms 588 KB Output is correct
6 Correct 37 ms 548 KB Output is correct
7 Correct 33 ms 596 KB Output is correct
8 Correct 40 ms 700 KB Output is correct
9 Correct 29 ms 596 KB Output is correct
10 Correct 33 ms 572 KB Output is correct
11 Correct 29 ms 556 KB Output is correct
12 Correct 13 ms 520 KB Output is correct
13 Correct 83 ms 1696 KB Output is correct
14 Correct 74 ms 1692 KB Output is correct
15 Correct 32 ms 1760 KB Output is correct
16 Correct 24 ms 2240 KB Output is correct
17 Correct 55 ms 1716 KB Output is correct
18 Correct 74 ms 1696 KB Output is correct
19 Correct 70 ms 1728 KB Output is correct
20 Correct 42 ms 1928 KB Output is correct
21 Correct 26 ms 1752 KB Output is correct
22 Correct 26 ms 2216 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 91752 KB Output is correct
2 Correct 624 ms 91736 KB Output is correct
3 Correct 563 ms 91760 KB Output is correct
4 Correct 601 ms 91752 KB Output is correct
5 Correct 611 ms 91824 KB Output is correct
6 Correct 579 ms 91764 KB Output is correct
7 Correct 541 ms 91760 KB Output is correct
8 Correct 556 ms 91944 KB Output is correct
9 Correct 558 ms 91836 KB Output is correct
10 Correct 599 ms 91840 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1628 KB Output is correct
2 Correct 120 ms 10320 KB Output is correct
3 Correct 572 ms 91816 KB Output is correct
4 Correct 658 ms 91832 KB Output is correct
5 Correct 473 ms 91916 KB Output is correct
6 Correct 884 ms 142596 KB Output is correct
7 Correct 637 ms 91496 KB Output is correct
8 Correct 584 ms 91764 KB Output is correct
9 Correct 591 ms 92112 KB Output is correct
10 Correct 616 ms 95060 KB Output is correct
11 Correct 582 ms 115196 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2012 KB Output is correct
2 Correct 84 ms 1996 KB Output is correct
3 Correct 121 ms 2016 KB Output is correct
4 Correct 173 ms 2316 KB Output is correct
5 Correct 230 ms 3152 KB Output is correct
6 Correct 824 ms 92648 KB Output is correct
7 Correct 860 ms 92584 KB Output is correct
8 Correct 782 ms 92780 KB Output is correct
9 Correct 915 ms 92588 KB Output is correct
10 Correct 813 ms 92584 KB Output is correct
11 Correct 801 ms 90540 KB Output is correct
12 Correct 722 ms 92328 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 348 KB Output is correct
2 Correct 25 ms 544 KB Output is correct
3 Correct 41 ms 576 KB Output is correct
4 Correct 16 ms 604 KB Output is correct
5 Correct 16 ms 588 KB Output is correct
6 Correct 37 ms 548 KB Output is correct
7 Correct 33 ms 596 KB Output is correct
8 Correct 40 ms 700 KB Output is correct
9 Correct 29 ms 596 KB Output is correct
10 Correct 33 ms 572 KB Output is correct
11 Correct 29 ms 556 KB Output is correct
12 Correct 13 ms 520 KB Output is correct
13 Correct 83 ms 1696 KB Output is correct
14 Correct 74 ms 1692 KB Output is correct
15 Correct 32 ms 1760 KB Output is correct
16 Correct 24 ms 2240 KB Output is correct
17 Correct 55 ms 1716 KB Output is correct
18 Correct 74 ms 1696 KB Output is correct
19 Correct 70 ms 1728 KB Output is correct
20 Correct 42 ms 1928 KB Output is correct
21 Correct 26 ms 1752 KB Output is correct
22 Correct 26 ms 2216 KB Output is correct
23 Correct 718 ms 91752 KB Output is correct
24 Correct 624 ms 91736 KB Output is correct
25 Correct 563 ms 91760 KB Output is correct
26 Correct 601 ms 91752 KB Output is correct
27 Correct 611 ms 91824 KB Output is correct
28 Correct 579 ms 91764 KB Output is correct
29 Correct 541 ms 91760 KB Output is correct
30 Correct 556 ms 91944 KB Output is correct
31 Correct 558 ms 91836 KB Output is correct
32 Correct 599 ms 91840 KB Output is correct
33 Correct 74 ms 1628 KB Output is correct
34 Correct 120 ms 10320 KB Output is correct
35 Correct 572 ms 91816 KB Output is correct
36 Correct 658 ms 91832 KB Output is correct
37 Correct 473 ms 91916 KB Output is correct
38 Correct 884 ms 142596 KB Output is correct
39 Correct 637 ms 91496 KB Output is correct
40 Correct 584 ms 91764 KB Output is correct
41 Correct 591 ms 92112 KB Output is correct
42 Correct 616 ms 95060 KB Output is correct
43 Correct 582 ms 115196 KB Output is correct
44 Correct 39 ms 2012 KB Output is correct
45 Correct 84 ms 1996 KB Output is correct
46 Correct 121 ms 2016 KB Output is correct
47 Correct 173 ms 2316 KB Output is correct
48 Correct 230 ms 3152 KB Output is correct
49 Correct 824 ms 92648 KB Output is correct
50 Correct 860 ms 92584 KB Output is correct
51 Correct 782 ms 92780 KB Output is correct
52 Correct 915 ms 92588 KB Output is correct
53 Correct 813 ms 92584 KB Output is correct
54 Correct 801 ms 90540 KB Output is correct
55 Correct 722 ms 92328 KB Output is correct
56 Correct 155 ms 1960 KB Output is correct
57 Correct 336 ms 1940 KB Output is correct
58 Correct 679 ms 3144 KB Output is correct
59 Correct 1512 ms 92368 KB Output is correct
60 Correct 1917 ms 92364 KB Output is correct
61 Correct 1430 ms 92616 KB Output is correct
62 Correct 952 ms 92592 KB Output is correct
63 Correct 1640 ms 92592 KB Output is correct
64 Correct 1518 ms 92592 KB Output is correct
65 Correct 1322 ms 92628 KB Output is correct
66 Correct 1576 ms 92968 KB Output is correct
67 Correct 1479 ms 95708 KB Output is correct
68 Correct 1314 ms 106796 KB Output is correct
69 Correct 1668 ms 116056 KB Output is correct