oj.uz

Submission #597109

# Submission time Handle Problem Language Result Execution time Memory
597109 2022-07-15T13:57:52 Z KoD Game (APIO22_game) C++17
60 / 100
 1682 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);
}

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

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])
            stack.emplace_back(x, u, v);
    }
    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])
            stack.emplace_back(x, v, u);
    }
    return false;
}

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 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 0 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 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 0 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 0 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 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 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 0 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 0 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 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 760 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 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 0 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 0 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 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 760 KB Output is correct
30 Correct 21 ms 2972 KB Output is correct
31 Correct 7 ms 2676 KB Output is correct
32 Correct 43 ms 8132 KB Output is correct
33 Correct 21 ms 4072 KB Output is correct
34 Correct 86 ms 16440 KB Output is correct
35 Correct 117 ms 15028 KB Output is correct
36 Correct 87 ms 10592 KB Output is correct
37 Correct 149 ms 16328 KB Output is correct
38 Correct 63 ms 8192 KB Output is correct
39 Correct 88 ms 10352 KB Output is correct
40 Correct 117 ms 15292 KB Output is correct
41 Correct 120 ms 13392 KB Output is correct
42 Correct 71 ms 9848 KB Output is correct
43 Correct 180 ms 15980 KB Output is correct
44 Correct 104 ms 14536 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 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 0 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 0 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 1 ms 336 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 848 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 5 ms 632 KB Output is correct
27 Correct 5 ms 848 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 760 KB Output is correct
30 Correct 21 ms 2972 KB Output is correct
31 Correct 7 ms 2676 KB Output is correct
32 Correct 43 ms 8132 KB Output is correct
33 Correct 21 ms 4072 KB Output is correct
34 Correct 86 ms 16440 KB Output is correct
35 Correct 117 ms 15028 KB Output is correct
36 Correct 87 ms 10592 KB Output is correct
37 Correct 149 ms 16328 KB Output is correct
38 Correct 63 ms 8192 KB Output is correct
39 Correct 88 ms 10352 KB Output is correct
40 Correct 117 ms 15292 KB Output is correct
41 Correct 120 ms 13392 KB Output is correct
42 Correct 71 ms 9848 KB Output is correct
43 Correct 180 ms 15980 KB Output is correct
44 Correct 104 ms 14536 KB Output is correct
45 Correct 246 ms 25976 KB Output is correct
46 Correct 13 ms 15288 KB Output is correct
47 Correct 22 ms 15864 KB Output is correct
48 Correct 343 ms 45252 KB Output is correct
49 Correct 257 ms 34504 KB Output is correct
50 Runtime error 1682 ms 262144 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -