oj.uz

답안 #597107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597107 2022-07-15T13:55:09 Z KoD 게임 (APIO22_game) C++17
60 / 100
 1804 ms 262144 KB 
#include "game.h"
#include <bits/stdc++.h>

using std::pair;
using std::tuple;
using std::queue;
// using std::set;
template <class T> using set = std::unordered_set<T>;
using std::vector;

bool contains(set<int>& set, const int x) {
    return set.find(x) != set.end();
}

struct Interval {
    int mid, par, lch, rch;
    set<int> from, to;
    explicit Interval(const int m) : mid(m), par(-1), lch(-1), rch(-1), from(), to() {}
};

int N, K;
vector<vector<int>> graph, revgraph;
vector<Interval> segtree;

int build(int l, int r) {
    const int u = (int)segtree.size();
    const int m = (l + r) / 2;
    segtree.emplace_back(m);
    if (l < m) {
        segtree[u].lch = build(l, m);
        segtree[segtree[u].lch].par = u;
    }
    if (m + 1 < r) {
        segtree[u].rch = build(m + 1, r);
        segtree[segtree[u].rch].par = u;
    }
    for (int i = l; i < m; ++i)
        segtree[u].from.insert(i);
    for (int i = m + 1; i < r; ++i)
        segtree[u].to.insert(i);
    return u;
}

bool check(int x, int u) {
    const int p = segtree[x].par;
    if (p == -1) {
        return true;
    } else {
        if (segtree[p].lch == x) {
            return contains(segtree[p].from, u);
        } else {
            return contains(segtree[p].to, u);
        }
    }
}

void init(int n, int k) {
    N = n;
    K = k;
    graph.resize(n);
    revgraph.resize(n);
    build(0, k);
}

bool insert_recursive(int x, int u);
bool insert_recursive_rev(int x, int u);
bool add_recursive(int x, int u, int v);

bool insert_recursive(int x, int u) {
    auto& data = segtree[x];
    if (!check(x, u))
        return false;
    if (data.mid == u)
        return true;
    if (data.to.insert(u).second) {
        if (contains(data.from, u))
            return true;
        for (const int v : graph[u])
            if (add_recursive(x, u, v))
                return true;
    }
    return false;
}

bool insert_recursive_rev(int x, int u) {
    auto& data = segtree[x];
    if (!check(x, u))
        return false;
    if (data.mid == u)
        return true;
    if (data.from.insert(u).second) {
        if (contains(data.to, u))
            return true;
        for (const int v : revgraph[u])
            if (add_recursive(x, v, u))
                return true;
    }
    return false;
}

vector<tuple<int, int, int>> stack;

bool add_recursive(int x, int u, int v) {
    auto& data = segtree[x];
    if ((contains(data.from, v) or v == data.mid)) {
        if (insert_recursive_rev(x, u))
            return true;
        if (data.lch != -1)
            stack.emplace_back(data.lch, u, v);
    }
    if ((contains(data.to, u) or u == data.mid)) {
        if (insert_recursive(x, v))
            return true;
        if (data.rch != -1)
            stack.emplace_back(data.rch, u, v);
    }
    return false;
}

int add_teleporter(int u, int v) {
    graph[u].push_back(v);
    revgraph[v].push_back(u);
    stack.emplace_back(0, u, v);
    while (!stack.empty()) {
        const auto [x, u, v] = stack.back();
        stack.pop_back();
        if (add_recursive(x, u, v))
            return true;
    }
    return false;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 4 ms 848 KB Output is correct
26 Correct 5 ms 652 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 4 ms 848 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 4 ms 848 KB Output is correct
26 Correct 5 ms 652 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 4 ms 848 KB Output is correct
30 Correct 17 ms 2976 KB Output is correct
31 Correct 6 ms 2612 KB Output is correct
32 Correct 39 ms 8220 KB Output is correct
33 Correct 21 ms 4200 KB Output is correct
34 Correct 114 ms 22252 KB Output is correct
35 Correct 129 ms 16928 KB Output is correct
36 Correct 154 ms 10716 KB Output is correct
37 Correct 149 ms 16536 KB Output is correct
38 Correct 65 ms 8208 KB Output is correct
39 Correct 85 ms 10384 KB Output is correct
40 Correct 174 ms 21100 KB Output is correct
41 Correct 116 ms 14748 KB Output is correct
42 Correct 76 ms 10792 KB Output is correct
43 Correct 168 ms 18216 KB Output is correct
44 Correct 117 ms 16536 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 4 ms 848 KB Output is correct
26 Correct 5 ms 652 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 4 ms 848 KB Output is correct
30 Correct 17 ms 2976 KB Output is correct
31 Correct 6 ms 2612 KB Output is correct
32 Correct 39 ms 8220 KB Output is correct
33 Correct 21 ms 4200 KB Output is correct
34 Correct 114 ms 22252 KB Output is correct
35 Correct 129 ms 16928 KB Output is correct
36 Correct 154 ms 10716 KB Output is correct
37 Correct 149 ms 16536 KB Output is correct
38 Correct 65 ms 8208 KB Output is correct
39 Correct 85 ms 10384 KB Output is correct
40 Correct 174 ms 21100 KB Output is correct
41 Correct 116 ms 14748 KB Output is correct
42 Correct 76 ms 10792 KB Output is correct
43 Correct 168 ms 18216 KB Output is correct
44 Correct 117 ms 16536 KB Output is correct
45 Correct 243 ms 25940 KB Output is correct
46 Correct 13 ms 15312 KB Output is correct
47 Correct 16 ms 15908 KB Output is correct
48 Correct 425 ms 66580 KB Output is correct
49 Correct 296 ms 34568 KB Output is correct
50 Runtime error 1804 ms 262144 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -