oj.uz

Submission #994259

# Submission time Handle Problem Language Result Execution time Memory
994259 2024-06-07T10:01:42 Z vjudge1 Jail (JOI22_jail) C++17
5 / 100
 43 ms 19548 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);
    for (int i = 0; i < m; i++) {
        cin >> edges[i].first >> edges[i].second;
    }

    sort(edges.begin(), edges.end());
    for (int i = 1; i < m; i++) {
        ok &= edges[i-1].second < edges[i].second;
    }

    cout << (ok?"Yes\n":"No\n");

    return;
    auto calc = [&](int u, int v, vector<int> &indices, bool add_lca) {
        while (!is_ancestor(u, v)) {
            indices.emplace_back(u);
            u = par[u];
        }
        if (add_lca) indices.emplace_back(u);
    };
    vector<int> cnt(m+1, 0);
    for (int i = 1; i <= m; i++) {
        vector<int> indices;
        {
            auto [u, v] = edges[i];
            calc(u, v, indices, false);
            calc(v, u, indices, true);
        }
        
        vector<int> to_rem;
        for (int u : indices) {
            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);
            }
        }
        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;
}

Subtask #1
5.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 7 ms 9052 KB Output is correct
5 Correct 12 ms 9048 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 14 ms 9652 KB Output is correct
10 Correct 27 ms 18708 KB Output is correct
11 Correct 3 ms 9052 KB Output is correct
12 Correct 14 ms 9216 KB Output is correct
13 Correct 33 ms 19008 KB Output is correct
14 Correct 30 ms 19036 KB Output is correct
15 Correct 31 ms 19032 KB Output is correct
16 Correct 43 ms 19536 KB Output is correct
17 Correct 32 ms 19024 KB Output is correct
18 Correct 37 ms 19548 KB Output is correct
19 Correct 32 ms 19036 KB Output is correct
20 Correct 32 ms 19148 KB Output is correct
21 Correct 34 ms 19024 KB Output is correct
22 Correct 30 ms 19036 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Incorrect 2 ms 9052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Incorrect 2 ms 9052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Incorrect 2 ms 9052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9048 KB Output is correct
4 Incorrect 2 ms 9052 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 1 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 3 ms 9052 KB Output is correct
6 Incorrect 2 ms 9052 KB Output isn't correct
7 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 7 ms 9052 KB Output is correct
5 Correct 12 ms 9048 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 14 ms 9652 KB Output is correct
10 Correct 27 ms 18708 KB Output is correct
11 Correct 3 ms 9052 KB Output is correct
12 Correct 14 ms 9216 KB Output is correct
13 Correct 33 ms 19008 KB Output is correct
14 Correct 30 ms 19036 KB Output is correct
15 Correct 31 ms 19032 KB Output is correct
16 Correct 43 ms 19536 KB Output is correct
17 Correct 32 ms 19024 KB Output is correct
18 Correct 37 ms 19548 KB Output is correct
19 Correct 32 ms 19036 KB Output is correct
20 Correct 32 ms 19148 KB Output is correct
21 Correct 34 ms 19024 KB Output is correct
22 Correct 30 ms 19036 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 2 ms 9048 KB Output is correct
26 Incorrect 2 ms 9052 KB Output isn't correct
27 Halted 0 ms 0 KB -