oj.uz

답안 #630451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630451 2022-08-16T11:31:32 Z Ooops_sorry 게임 (APIO22_game) C++17
60 / 100
 4000 ms 48816 KB 
#include<bits/stdc++.h>

using namespace std;

mt19937 rnd(51);

#define ll long long
#define pb push_back
#define ld long double

const int N = 3e5 + 10, INF = 1e9, K = 500;
int n, k, in_block[N], out_block[N], in[N], out[N], block[N];
bool used[N];
vector<int> g[N], gr[N];
bool cycle = 0;
set<int> need;

void dfs_block(int v) {
    if (v >= k && out_block[v] < in_block[v]) {
        cycle = 1;
    }
    if (v >= k && !used[v] && out_block[v] == in_block[v]) {
        need.insert(in_block[v]);
        block[v] = in_block[v];
        used[v] = 1;
    }
    for (auto to : g[v]) {
        if (in_block[v] > in_block[to]) {
            in_block[to] = in_block[v];
            dfs_block(to);
        }
    }
}

void zhfs_block(int v) {
    if (v >= k && out_block[v] < in_block[v]) {
        cycle = 1;
    }
    if (v >= k && !used[v] && out_block[v] == in_block[v]) {
        need.insert(in_block[v]);
        block[v] = in_block[v];
        used[v] = 1;
    }
    for (auto to : gr[v]) {
        if (out_block[v] < out_block[to]) {
            out_block[to] = out_block[v];
            zhfs_block(to);
        }
    }
}

void dfs(int v) {
    if (v >= k && out[v] <= in[v]) {
        cycle = 1;
    }
    for (auto to : g[v]) {
        if (block[v] == block[to] && in[v] > in[to]) {
            in[to] = in[v];
            dfs(to);
        }
    }
}

void zhfs(int v) {
    if (v >= k && out[v] <= in[v]) {
        cycle = 1;
    }
    for (auto to : gr[v]) {
        if (block[v] == block[to] && out[v] < out[to]) {
            out[to] = out[v];
            zhfs(to);
        }
    }
}

int add_teleporter(int u, int v) {
    if (max(u, v) < k) {
        if (u >= v) {
            cycle = 1;
        }
    } else {
        g[u].pb(v);
        gr[v].pb(u);
        if (in_block[v] < in_block[u]) {
            in_block[v] = in_block[u];
            dfs_block(v);
        }
        if (out_block[u] > out_block[v]) {
            out_block[u] = out_block[v];
            zhfs_block(u);
        }
        for (auto v : need) {
            for (int vert = v * K; vert < min(k, (v + 1) * K); vert++) {
                zhfs(vert);
                dfs(vert);
            }
        }
        if (block[v] == block[u] && in[v] < in[u]) {
            in[v] = in[u];
            dfs(v);
        }
        if (block[v] == block[u] && out[u] > out[v]) {
            out[u] = out[v];
            zhfs(u);
        }
    }
    return cycle;
}

void init(int n_, int k_) {
    n = n_, k = k_;
    for (int i = 0; i < n; i++) {
        in_block[i] = -INF, out_block[i] = INF;
        in[i] = -INF, out[i] = INF;
        block[i] = -(i + 1);
    }
    for (int i = 0; i < k; i++) {
        in_block[i] = out_block[i] = block[i] = i / K;
        in[i] = out[i] = i;
        if (i + 1 < k) {
            add_teleporter(i, i + 1);
        }
    }
}

#ifdef LOCAL

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<pair<int,int>> e(m);
    for (int i = 0; i < m; i++) {
        cin >> e[i].first >> e[i].second;
    }
    init(n, k);
    int i;
    for (i = 0; i < m; i++) {
        int res = add_teleporter(e[i].first, e[i].second);
        assert(res == 0 || res == 1);
        if (res == 1) {
            break;
        }
    }
    cout << i << endl;
    return 0;
}

#endif // LOCAL

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14416 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 8 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14416 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 8 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14416 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14312 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14416 KB Output is correct
16 Correct 8 ms 14396 KB Output is correct
17 Correct 9 ms 14416 KB Output is correct
18 Correct 8 ms 14416 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 7 ms 14416 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14464 KB Output is correct
24 Correct 15 ms 14644 KB Output is correct
25 Correct 17 ms 14544 KB Output is correct
26 Correct 17 ms 14544 KB Output is correct
27 Correct 44 ms 14512 KB Output is correct
28 Correct 16 ms 14416 KB Output is correct
29 Correct 25 ms 14504 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14416 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 8 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14416 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14312 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14416 KB Output is correct
16 Correct 8 ms 14396 KB Output is correct
17 Correct 9 ms 14416 KB Output is correct
18 Correct 8 ms 14416 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 7 ms 14416 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14464 KB Output is correct
24 Correct 15 ms 14644 KB Output is correct
25 Correct 17 ms 14544 KB Output is correct
26 Correct 17 ms 14544 KB Output is correct
27 Correct 44 ms 14512 KB Output is correct
28 Correct 16 ms 14416 KB Output is correct
29 Correct 25 ms 14504 KB Output is correct
30 Correct 47 ms 16096 KB Output is correct
31 Correct 24 ms 15320 KB Output is correct
32 Correct 29 ms 17808 KB Output is correct
33 Correct 30 ms 16912 KB Output is correct
34 Correct 53 ms 18656 KB Output is correct
35 Correct 195 ms 17464 KB Output is correct
36 Correct 62 ms 16840 KB Output is correct
37 Correct 447 ms 17132 KB Output is correct
38 Correct 1315 ms 16732 KB Output is correct
39 Correct 1449 ms 16796 KB Output is correct
40 Correct 380 ms 18632 KB Output is correct
41 Correct 123 ms 17164 KB Output is correct
42 Correct 381 ms 16868 KB Output is correct
43 Correct 729 ms 18060 KB Output is correct
44 Correct 227 ms 18696 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14416 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 8 ms 14416 KB Output is correct
4 Correct 8 ms 14320 KB Output is correct
5 Correct 8 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14416 KB Output is correct
9 Correct 7 ms 14416 KB Output is correct
10 Correct 8 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14312 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14416 KB Output is correct
16 Correct 8 ms 14396 KB Output is correct
17 Correct 9 ms 14416 KB Output is correct
18 Correct 8 ms 14416 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 7 ms 14416 KB Output is correct
22 Correct 8 ms 14544 KB Output is correct
23 Correct 9 ms 14464 KB Output is correct
24 Correct 15 ms 14644 KB Output is correct
25 Correct 17 ms 14544 KB Output is correct
26 Correct 17 ms 14544 KB Output is correct
27 Correct 44 ms 14512 KB Output is correct
28 Correct 16 ms 14416 KB Output is correct
29 Correct 25 ms 14504 KB Output is correct
30 Correct 47 ms 16096 KB Output is correct
31 Correct 24 ms 15320 KB Output is correct
32 Correct 29 ms 17808 KB Output is correct
33 Correct 30 ms 16912 KB Output is correct
34 Correct 53 ms 18656 KB Output is correct
35 Correct 195 ms 17464 KB Output is correct
36 Correct 62 ms 16840 KB Output is correct
37 Correct 447 ms 17132 KB Output is correct
38 Correct 1315 ms 16732 KB Output is correct
39 Correct 1449 ms 16796 KB Output is correct
40 Correct 380 ms 18632 KB Output is correct
41 Correct 123 ms 17164 KB Output is correct
42 Correct 381 ms 16868 KB Output is correct
43 Correct 729 ms 18060 KB Output is correct
44 Correct 227 ms 18696 KB Output is correct
45 Correct 246 ms 31692 KB Output is correct
46 Correct 15 ms 20712 KB Output is correct
47 Correct 15 ms 20524 KB Output is correct
48 Correct 422 ms 48816 KB Output is correct
49 Correct 279 ms 39240 KB Output is correct
50 Execution timed out 4010 ms 41784 KB Time limit exceeded
51 Halted 0 ms 0 KB -