oj.uz

Submission #994199

# Submission time Handle Problem Language Result Execution time Memory
994199 2024-06-07T08:42:42 Z vjudge1 Jail (JOI22_jail) C++17
61 / 100
 5000 ms 1048576 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 120'001;

vector<int> g[MAXN], g2[MAXN];
int tin[MAXN], tout[MAXN], s[MAXN], e[MAXN], par[MAXN], col[MAXN], hv[MAXN], timer;
bool ok;

void dfs(int u, int p = -1) {
    tin[u] = timer++;
    par[u] = p;
    for (int v : g[u]) {
        if (v != p) dfs(v, u);
    }
    tout[u] = timer++;
}

void dfs2(int u, stack<int> &top) {
    col[u] = 1;
    for (int v : g2[u]) {
        if (col[v] == 0) dfs2(v, top);
        else if (col[v] == 1) ok = false;
    }
    col[u] = 2;
    top.push(u);
}

bool is_ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[v] <= tout[u];
}

void solve() {
    int n; cin >> n;
    ok = true;
    fill(s, s+n+1, 0);
    fill(e, e+n+1, 0);
    fill(col, col+n+1, 0);
    fill(hv, hv+n+1, 0);
    timer = 1;
    for (int i = 1; i <= n; i++) {
        g[i].clear();
        g2[i].clear();
    }
    for (int i = 0; i < n-1; i++) {
        int u, v; cin >> u >> v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    dfs(1);
    int m; cin >> m;
    vector<pair<int, int>> edges(m+1);
    for (int i = 1; i <= m; i++) {
        cin >> edges[i].first >> edges[i].second;
        auto [u, v] = edges[i];
        s[u] = e[v] = i;
        hv[edges[i].first] = i;
    }

    auto nxt = [&](int u, int v) {
        if (u == v) return -1;
        if (is_ancestor(u, v)) {
            for (int i : g[u]) {
                if (par[u] != i && is_ancestor(i, v)) {
                    return i;
                }
            }
        } else {
            return par[u];
        }
    };

    for (int i = 1; i <= m; i++) {
        auto [u, v] = edges[i];
        while (u != -1) {
            if (e[u] && e[u] != i) {
                g2[i].emplace_back(e[u]);
            }
            if (s[u] && s[u] != i) {
                g2[s[u]].emplace_back(i);
            }
            u = nxt(u, v);
        }
    }

    function<void(int,int)> mv = [&](int idx, int p) {
        if (!ok) return;
        int v = nxt(edges[idx].first, edges[idx].second);
        if (v == -1 || v == p) {
            ok = false;
            return;
        }
        if (hv[v]) {
            mv(hv[v], edges[idx].first);
        }
        hv[edges[idx].first] = 0;
        hv[v] = idx;
        edges[idx].first = v;
    };

    stack<int> top;
    for (int i = 1; i <= m; i++) {
        if (col[i] == 0) dfs2(i, top);
    }
    while (!top.empty() && ok) {
        int i = top.top(); top.pop();
        while (edges[i].first != edges[i].second && ok) {
            mv(i, -1);
        }
    }
    cout << (ok?"Yes\n":"No\n");
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Compilation message

jail.cpp: In lambda function:
jail.cpp:73:5: warning: control reaches end of non-void function [-Wreturn-type]
   73 |     };
      |     ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 6 ms 9052 KB Output is correct
5 Correct 12 ms 9224 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9304 KB Output is correct
9 Correct 91 ms 11644 KB Output is correct
10 Correct 704 ms 20052 KB Output is correct
11 Correct 4 ms 9048 KB Output is correct
12 Correct 24 ms 9304 KB Output is correct
13 Correct 142 ms 49056 KB Output is correct
14 Correct 109 ms 62684 KB Output is correct
15 Runtime error 4116 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9052 KB Output is correct
2 Correct 1 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9172 KB Output is correct
12 Correct 2 ms 9048 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9052 KB Output is correct
2 Correct 1 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9172 KB Output is correct
12 Correct 2 ms 9048 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 1 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9048 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 1 ms 9052 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9140 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 1 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 1 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9052 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9052 KB Output is correct
2 Correct 1 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9172 KB Output is correct
12 Correct 2 ms 9048 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 1 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9048 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 1 ms 9052 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9140 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 1 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 1 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9052 KB Output is correct
29 Correct 3 ms 9308 KB Output is correct
30 Correct 3 ms 9052 KB Output is correct
31 Correct 3 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9048 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 3 ms 9052 KB Output is correct
36 Correct 2 ms 9052 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9052 KB Output is correct
2 Correct 1 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 2 ms 9052 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9172 KB Output is correct
12 Correct 2 ms 9048 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 1 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9048 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 1 ms 9052 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9140 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 1 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 1 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9052 KB Output is correct
29 Correct 3 ms 9308 KB Output is correct
30 Correct 3 ms 9052 KB Output is correct
31 Correct 3 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9048 KB Output is correct
34 Correct 2 ms 9052 KB Output is correct
35 Correct 3 ms 9052 KB Output is correct
36 Correct 2 ms 9052 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct
38 Correct 105 ms 11592 KB Output is correct
39 Correct 702 ms 20052 KB Output is correct
40 Correct 48 ms 10588 KB Output is correct
41 Correct 27 ms 9312 KB Output is correct
42 Correct 51 ms 10672 KB Output is correct
43 Correct 14 ms 9312 KB Output is correct
44 Correct 6 ms 9316 KB Output is correct
45 Correct 28 ms 13148 KB Output is correct
46 Correct 29 ms 13148 KB Output is correct
47 Correct 155 ms 15928 KB Output is correct
48 Correct 161 ms 15708 KB Output is correct
49 Correct 36 ms 13144 KB Output is correct
50 Correct 51 ms 13148 KB Output is correct
51 Correct 23 ms 13916 KB Output is correct
52 Correct 22 ms 14076 KB Output is correct
53 Correct 8 ms 9576 KB Output is correct
54 Correct 29 ms 12892 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 4 ms 9052 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 1 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 2 ms 9048 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 13 ms 9296 KB Output is correct
14 Correct 20 ms 9220 KB Output is correct
15 Correct 21 ms 9048 KB Output is correct
16 Correct 33 ms 13660 KB Output is correct
17 Correct 87 ms 22864 KB Output is correct
18 Correct 196 ms 48236 KB Output is correct
19 Correct 44 ms 15224 KB Output is correct
20 Correct 41 ms 15184 KB Output is correct
21 Correct 55 ms 15188 KB Output is correct
22 Correct 71 ms 22224 KB Output is correct
23 Correct 56 ms 22344 KB Output is correct
24 Correct 75 ms 21744 KB Output is correct
25 Correct 55 ms 21832 KB Output is correct
26 Correct 78 ms 21964 KB Output is correct
27 Execution timed out 5041 ms 19652 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 6 ms 9052 KB Output is correct
5 Correct 12 ms 9224 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 3 ms 9304 KB Output is correct
9 Correct 91 ms 11644 KB Output is correct
10 Correct 704 ms 20052 KB Output is correct
11 Correct 4 ms 9048 KB Output is correct
12 Correct 24 ms 9304 KB Output is correct
13 Correct 142 ms 49056 KB Output is correct
14 Correct 109 ms 62684 KB Output is correct
15 Runtime error 4116 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -