oj.uz

답안 #597088

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

using std::pair;
using std::queue;
using std::set;
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;
}

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 and add_recursive(data.lch, u, v))
            return true;
    }
    if (contains(data.to, u) or u == data.mid) {
        if (insert_recursive(x, v))
            return true;
        if (data.rch != -1 and add_recursive(data.rch, u, v))
            return true;
    }
    return false;
}

int add_teleporter(int u, int v) {
    graph[u].push_back(v);
    revgraph[v].push_back(u);
    static int counter = 0;
    counter++;
    const bool ret = add_recursive(0, u, v);
    return ret;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 340 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 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 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 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 1 ms 340 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 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 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 3 ms 516 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 4 ms 848 KB Output is correct
25 Correct 5 ms 836 KB Output is correct
26 Correct 12 ms 704 KB Output is correct
27 Correct 7 ms 848 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 776 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 340 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 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 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 3 ms 516 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 4 ms 848 KB Output is correct
25 Correct 5 ms 836 KB Output is correct
26 Correct 12 ms 704 KB Output is correct
27 Correct 7 ms 848 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 776 KB Output is correct
30 Correct 19 ms 2972 KB Output is correct
31 Correct 9 ms 2596 KB Output is correct
32 Correct 45 ms 9696 KB Output is correct
33 Correct 30 ms 4224 KB Output is correct
34 Correct 316 ms 24924 KB Output is correct
35 Correct 277 ms 19368 KB Output is correct
36 Correct 210 ms 11408 KB Output is correct
37 Correct 382 ms 17480 KB Output is correct
38 Correct 136 ms 8584 KB Output is correct
39 Correct 213 ms 10964 KB Output is correct
40 Correct 371 ms 22516 KB Output is correct
41 Correct 240 ms 16476 KB Output is correct
42 Correct 154 ms 11816 KB Output is correct
43 Correct 384 ms 19476 KB Output is correct
44 Correct 286 ms 18068 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 340 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 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 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 3 ms 516 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 4 ms 848 KB Output is correct
25 Correct 5 ms 836 KB Output is correct
26 Correct 12 ms 704 KB Output is correct
27 Correct 7 ms 848 KB Output is correct
28 Correct 4 ms 720 KB Output is correct
29 Correct 5 ms 776 KB Output is correct
30 Correct 19 ms 2972 KB Output is correct
31 Correct 9 ms 2596 KB Output is correct
32 Correct 45 ms 9696 KB Output is correct
33 Correct 30 ms 4224 KB Output is correct
34 Correct 316 ms 24924 KB Output is correct
35 Correct 277 ms 19368 KB Output is correct
36 Correct 210 ms 11408 KB Output is correct
37 Correct 382 ms 17480 KB Output is correct
38 Correct 136 ms 8584 KB Output is correct
39 Correct 213 ms 10964 KB Output is correct
40 Correct 371 ms 22516 KB Output is correct
41 Correct 240 ms 16476 KB Output is correct
42 Correct 154 ms 11816 KB Output is correct
43 Correct 384 ms 19476 KB Output is correct
44 Correct 286 ms 18068 KB Output is correct
45 Correct 249 ms 25924 KB Output is correct
46 Correct 14 ms 15312 KB Output is correct
47 Correct 13 ms 15736 KB Output is correct
48 Correct 510 ms 63476 KB Output is correct
49 Correct 270 ms 34612 KB Output is correct
50 Execution timed out 4019 ms 258092 KB Time limit exceeded
51 Halted 0 ms 0 KB -