oj.uz

Submission #709973

# Submission time Handle Problem Language Result Execution time Memory
709973 2023-03-15T02:14:53 Z KoD Seats (IOI18_seats) C++17
100 / 100
 2558 ms 69120 KB 
#include "seats.h"
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
#include <limits>
#include <iterator>

namespace kod {

using std::cerr;
using std::endl;
using std::vector;
using std::pair;
using std::begin;
using std::end;

constexpr int inf = std::numeric_limits<int>::max() / 2;

struct info {
    int min, count;
    static info id() { return {inf, 0}; }
};

class lazy_segtree {
  public:
    lazy_segtree() = default;

    explicit lazy_segtree(const int n) {
        logn = 0;
        while ((1 << logn) < n) logn += 1;
        size = 1 << logn;
        data.resize(2 * size, info::id());
        lazy.resize(size);
        for (int i = 0; i < n; ++i) {
            data[i + size] = {0, 1};
        }
        for (int i = size - 1; i > 0; --i) {
            fetch(i);
        }
    }

    void add(int l, int r, const int x) {
        l += size;
        r += size;
        push(l);
        push(r);
        const int lc = l;
        const int rc = r;
        while (l < r) {
            if (l & 1) apply(l++, x);
            if (r & 1) apply(--r, x);
            l >>= 1;
            r >>= 1;
        }
        pull(lc);
        pull(rc);
    }

    info get() const {
        return data[1];
    }

  private:
    int size, logn;
    vector<info> data;
    vector<int> lazy;

    void apply(const int i, const int e) {
        data[i].min += e;
        if (i < size) lazy[i] += e;
    }

    void fetch(const int i) {
        const auto& l = data[2 * i + 0];
        const auto& r = data[2 * i + 1];
        const int m = std::min(l.min, r.min);
        data[i].min = m;
        data[i].count = (m == l.min ? l.count : 0) + (m == r.min ? r.count : 0);
    }

    void flush(const int i) {
        apply(2 * i + 0, lazy[i]);
        apply(2 * i + 1, lazy[i]);
        lazy[i] = 0;
    }

    void push(const int i) {
        const int lsb = __builtin_ctz(i);
        for (int d = logn; d > lsb; --d) {
            flush(i >> d);
        }
    }

    void pull(int i) {
        i >>= __builtin_ctz(i);
        while (i > 1) fetch(i >>= 1);
    }
};

int N, H, W;
vector<int> id, grid;
lazy_segtree seg;

void update(const int x, const int c) {
    vector<int> list;
    for (const int a : {0, 1}) {
        for (const int b : {0, W}) {
            list.push_back(grid[x + a + b]);
        }
    }
    std::sort(begin(list), end(list));
    seg.add(list[0], list[1], c);
    seg.add(list[2], list[3], c);
}

void init() {
    grid.resize(H * W, N);
    for (int i = 0; i < N; ++i) {
        grid[id[i]] = i;
    }
    seg = lazy_segtree(N);
    for (int i = 0; i < H - 1; ++i) {
        for (int j = 0; j < W - 1; ++j) {
            update(i * W + j, 1);
        }
    }
}

void cell(const int x, const int a) {
    for (const int a : {0, 1}) {
        for (const int b : {0, W}) {
            update(x - a - b, -1);
        }
    }
    grid[x] = a;
    id[a] = x;
    for (const int a : {0, 1}) {
        for (const int b : {0, W}) {
            update(x - a - b, 1);
        }
    }
}

int swap(const int a, const int b) {
    const int x = id[a];
    const int y = id[b];
    cell(x, b);
    cell(y, a);
    const auto ret = seg.get();
    return ret.min == 4 ? ret.count : 0;
}

}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    kod::N = H * W;
    kod::H = H + 2;
    kod::W = W + 2;
    kod::id.resize(H * W);
    for (int i = 0; i < H * W; ++i) {
        kod::id[i] = (R[i] + 1) * (W + 2) + (C[i] + 1);
    }
    kod::init();
}

int swap_seats(int a, int b) {
    return kod::swap(a, b);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 460 KB Output is correct
2 Correct 30 ms 416 KB Output is correct
3 Correct 40 ms 432 KB Output is correct
4 Correct 29 ms 412 KB Output is correct
5 Correct 30 ms 408 KB Output is correct
6 Correct 39 ms 424 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 38 ms 432 KB Output is correct
9 Correct 49 ms 412 KB Output is correct
10 Correct 35 ms 420 KB Output is correct
11 Correct 34 ms 416 KB Output is correct
12 Correct 29 ms 436 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 460 KB Output is correct
2 Correct 30 ms 416 KB Output is correct
3 Correct 40 ms 432 KB Output is correct
4 Correct 29 ms 412 KB Output is correct
5 Correct 30 ms 408 KB Output is correct
6 Correct 39 ms 424 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 38 ms 432 KB Output is correct
9 Correct 49 ms 412 KB Output is correct
10 Correct 35 ms 420 KB Output is correct
11 Correct 34 ms 416 KB Output is correct
12 Correct 29 ms 436 KB Output is correct
13 Correct 78 ms 1068 KB Output is correct
14 Correct 81 ms 1064 KB Output is correct
15 Correct 64 ms 1104 KB Output is correct
16 Correct 57 ms 1160 KB Output is correct
17 Correct 65 ms 1116 KB Output is correct
18 Correct 64 ms 1072 KB Output is correct
19 Correct 74 ms 1092 KB Output is correct
20 Correct 71 ms 1108 KB Output is correct
21 Correct 67 ms 1148 KB Output is correct
22 Correct 61 ms 1148 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1814 ms 60316 KB Output is correct
2 Correct 1226 ms 60316 KB Output is correct
3 Correct 1187 ms 60312 KB Output is correct
4 Correct 1084 ms 60324 KB Output is correct
5 Correct 1049 ms 60316 KB Output is correct
6 Correct 1163 ms 60320 KB Output is correct
7 Correct 1120 ms 60324 KB Output is correct
8 Correct 1145 ms 60316 KB Output is correct
9 Correct 1175 ms 60316 KB Output is correct
10 Correct 1125 ms 60316 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1072 KB Output is correct
2 Correct 171 ms 6332 KB Output is correct
3 Correct 1117 ms 60320 KB Output is correct
4 Correct 1681 ms 60316 KB Output is correct
5 Correct 1664 ms 68188 KB Output is correct
6 Correct 1846 ms 68168 KB Output is correct
7 Correct 1218 ms 63000 KB Output is correct
8 Correct 1148 ms 60424 KB Output is correct
9 Correct 1082 ms 60468 KB Output is correct
10 Correct 1175 ms 61116 KB Output is correct
11 Correct 1220 ms 64256 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 2220 KB Output is correct
2 Correct 190 ms 1956 KB Output is correct
3 Correct 266 ms 2036 KB Output is correct
4 Correct 337 ms 2096 KB Output is correct
5 Correct 495 ms 2632 KB Output is correct
6 Correct 2008 ms 69116 KB Output is correct
7 Correct 2053 ms 68928 KB Output is correct
8 Correct 1979 ms 69120 KB Output is correct
9 Correct 2501 ms 69052 KB Output is correct
10 Correct 1990 ms 69044 KB Output is correct
11 Correct 1977 ms 68924 KB Output is correct
12 Correct 1907 ms 69048 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 460 KB Output is correct
2 Correct 30 ms 416 KB Output is correct
3 Correct 40 ms 432 KB Output is correct
4 Correct 29 ms 412 KB Output is correct
5 Correct 30 ms 408 KB Output is correct
6 Correct 39 ms 424 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 38 ms 432 KB Output is correct
9 Correct 49 ms 412 KB Output is correct
10 Correct 35 ms 420 KB Output is correct
11 Correct 34 ms 416 KB Output is correct
12 Correct 29 ms 436 KB Output is correct
13 Correct 78 ms 1068 KB Output is correct
14 Correct 81 ms 1064 KB Output is correct
15 Correct 64 ms 1104 KB Output is correct
16 Correct 57 ms 1160 KB Output is correct
17 Correct 65 ms 1116 KB Output is correct
18 Correct 64 ms 1072 KB Output is correct
19 Correct 74 ms 1092 KB Output is correct
20 Correct 71 ms 1108 KB Output is correct
21 Correct 67 ms 1148 KB Output is correct
22 Correct 61 ms 1148 KB Output is correct
23 Correct 1814 ms 60316 KB Output is correct
24 Correct 1226 ms 60316 KB Output is correct
25 Correct 1187 ms 60312 KB Output is correct
26 Correct 1084 ms 60324 KB Output is correct
27 Correct 1049 ms 60316 KB Output is correct
28 Correct 1163 ms 60320 KB Output is correct
29 Correct 1120 ms 60324 KB Output is correct
30 Correct 1145 ms 60316 KB Output is correct
31 Correct 1175 ms 60316 KB Output is correct
32 Correct 1125 ms 60316 KB Output is correct
33 Correct 66 ms 1072 KB Output is correct
34 Correct 171 ms 6332 KB Output is correct
35 Correct 1117 ms 60320 KB Output is correct
36 Correct 1681 ms 60316 KB Output is correct
37 Correct 1664 ms 68188 KB Output is correct
38 Correct 1846 ms 68168 KB Output is correct
39 Correct 1218 ms 63000 KB Output is correct
40 Correct 1148 ms 60424 KB Output is correct
41 Correct 1082 ms 60468 KB Output is correct
42 Correct 1175 ms 61116 KB Output is correct
43 Correct 1220 ms 64256 KB Output is correct
44 Correct 178 ms 2220 KB Output is correct
45 Correct 190 ms 1956 KB Output is correct
46 Correct 266 ms 2036 KB Output is correct
47 Correct 337 ms 2096 KB Output is correct
48 Correct 495 ms 2632 KB Output is correct
49 Correct 2008 ms 69116 KB Output is correct
50 Correct 2053 ms 68928 KB Output is correct
51 Correct 1979 ms 69120 KB Output is correct
52 Correct 2501 ms 69052 KB Output is correct
53 Correct 1990 ms 69044 KB Output is correct
54 Correct 1977 ms 68924 KB Output is correct
55 Correct 1907 ms 69048 KB Output is correct
56 Correct 245 ms 1964 KB Output is correct
57 Correct 363 ms 1920 KB Output is correct
58 Correct 556 ms 2680 KB Output is correct
59 Correct 1728 ms 61308 KB Output is correct
60 Correct 2459 ms 61260 KB Output is correct
61 Correct 1629 ms 61292 KB Output is correct
62 Correct 1869 ms 65152 KB Output is correct
63 Correct 2558 ms 63868 KB Output is correct
64 Correct 1883 ms 62064 KB Output is correct
65 Correct 1799 ms 61336 KB Output is correct
66 Correct 1945 ms 61348 KB Output is correct
67 Correct 1865 ms 62040 KB Output is correct
68 Correct 1839 ms 63868 KB Output is correct
69 Correct 2297 ms 65184 KB Output is correct