oj.uz

Submission #994211

# Submission time Handle Problem Language Result Execution time Memory
994211 2024-06-07T09:02:31 Z vjudge1 Jail (JOI22_jail) C++17
61 / 100
 5000 ms 1041232 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) {
    col[u] = 1;
    for (int v : g2[u]) {
        if (col[v] == 0) dfs2(v);
        else if (col[v] == 1) ok = false;
    }
    col[u] = 2;
}
    
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];
        }
    };
    vector<int> cnt(m+1, 0);
    for (int i = 1; i <= m; i++) {
        auto [u, v] = edges[i];
        vector<int> to_rem;
        while (u != -1) {
            if (e[u] && e[u] != i) {
                to_rem.emplace_back(e[u]);
                cnt[e[u]]++;
                g2[i].emplace_back(e[u]);
            }
            if (s[u] && s[u] != i) {
                to_rem.emplace_back(s[u]);
                cnt[s[u]]++;
                g2[s[u]].emplace_back(i);
            }
            u = nxt(u, v);
        }
        for (int i : to_rem) {
            if (cnt[i] == 2) ok = false;
            else cnt[i] = 0;
        }
    }

    for (int i = 1; i <= m; i++) {
        if (col[i] == 0) dfs2(i);
    }
    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:72:5: warning: control reaches end of non-void function [-Wreturn-type]
   72 |     };
      |     ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9168 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 7 ms 9052 KB Output is correct
5 Correct 12 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 9308 KB Output is correct
9 Correct 86 ms 11460 KB Output is correct
10 Correct 324 ms 20056 KB Output is correct
11 Correct 5 ms 9048 KB Output is correct
12 Correct 34 ms 9304 KB Output is correct
13 Correct 125 ms 49080 KB Output is correct
14 Correct 134 ms 63328 KB Output is correct
15 Execution timed out 5085 ms 1041232 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 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 9048 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9220 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 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 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9220 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 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 9048 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9220 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 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 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9220 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 2 ms 9048 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 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9208 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 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 9048 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9220 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 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 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9220 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 2 ms 9048 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 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9208 KB Output is correct
29 Correct 4 ms 9308 KB Output is correct
30 Correct 2 ms 9052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 3 ms 9052 KB Output is correct
35 Correct 3 ms 9052 KB Output is correct
36 Correct 2 ms 9232 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 9048 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 9048 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 9220 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 2 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 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9220 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 2 ms 9052 KB Output is correct
16 Correct 2 ms 9052 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 2 ms 9048 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 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 1 ms 9208 KB Output is correct
29 Correct 4 ms 9308 KB Output is correct
30 Correct 2 ms 9052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 3 ms 9052 KB Output is correct
35 Correct 3 ms 9052 KB Output is correct
36 Correct 2 ms 9232 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct
38 Correct 88 ms 11604 KB Output is correct
39 Correct 323 ms 20048 KB Output is correct
40 Correct 52 ms 10580 KB Output is correct
41 Correct 18 ms 9308 KB Output is correct
42 Correct 44 ms 10776 KB Output is correct
43 Correct 15 ms 9304 KB Output is correct
44 Correct 7 ms 9308 KB Output is correct
45 Correct 32 ms 13092 KB Output is correct
46 Correct 29 ms 13136 KB Output is correct
47 Correct 72 ms 15708 KB Output is correct
48 Correct 75 ms 15940 KB Output is correct
49 Correct 37 ms 13148 KB Output is correct
50 Correct 37 ms 13148 KB Output is correct
51 Correct 22 ms 13912 KB Output is correct
52 Correct 23 ms 14024 KB Output is correct
53 Correct 8 ms 9564 KB Output is correct
54 Correct 30 ms 12948 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 1 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 5 ms 9212 KB Output is correct
6 Correct 2 ms 9052 KB Output is correct
7 Correct 2 ms 9052 KB Output is correct
8 Correct 1 ms 9052 KB Output is correct
9 Correct 1 ms 9052 KB Output is correct
10 Correct 1 ms 9052 KB Output is correct
11 Correct 1 ms 9056 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 15 ms 9052 KB Output is correct
14 Correct 18 ms 9060 KB Output is correct
15 Correct 16 ms 9056 KB Output is correct
16 Correct 31 ms 13688 KB Output is correct
17 Correct 98 ms 20312 KB Output is correct
18 Correct 227 ms 43708 KB Output is correct
19 Correct 36 ms 13660 KB Output is correct
20 Correct 43 ms 13800 KB Output is correct
21 Correct 38 ms 13680 KB Output is correct
22 Correct 79 ms 19916 KB Output is correct
23 Correct 62 ms 20204 KB Output is correct
24 Correct 63 ms 19660 KB Output is correct
25 Correct 57 ms 19788 KB Output is correct
26 Correct 62 ms 19848 KB Output is correct
27 Execution timed out 5096 ms 17140 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 9168 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 7 ms 9052 KB Output is correct
5 Correct 12 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 9308 KB Output is correct
9 Correct 86 ms 11460 KB Output is correct
10 Correct 324 ms 20056 KB Output is correct
11 Correct 5 ms 9048 KB Output is correct
12 Correct 34 ms 9304 KB Output is correct
13 Correct 125 ms 49080 KB Output is correct
14 Correct 134 ms 63328 KB Output is correct
15 Execution timed out 5085 ms 1041232 KB Time limit exceeded
16 Halted 0 ms 0 KB -