oj.uz

답안 #890816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890816 2023-12-22T03:45:13 Z vjudge1 Jail (JOI22_jail) C++17
61 / 100
 225 ms 32424 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

void solve(){
    int n; cin >> n;
    vector <vector<int>> G(n);
    bool Qflag = true;
    for ( int i = 0; i + 1 < n; i++ ){
        int u, v; cin >> u >> v;
        --u, --v;
        G[u].pb(v), G[v].pb(u);
        Qflag &= (u + 1 == v);
    }
    int m; cin >> m;
    vector <int> S(m), T(m);
    for ( int i = 0; i < m; i++ ){
        cin >> S[i] >> T[i];
        --S[i], --T[i];
    }
    if ( Qflag ){
        vector <int> pf(n + 1);
        vector <ar<int,2>> A;
        for ( int i = 0; i < m; i++ ){
            if ( S[i] > T[i] ){
                pf[T[i]]++;
                pf[S[i] + 1]--;
            }
            A.pb({min(S[i], T[i]), max(S[i], T[i])});
        }
        for ( int i = 1; i < n; i++ ){
            pf[i] += pf[i - 1];
        }
        for ( int i = 0; i < m; i++ ){
            if ( S[i] < T[i] ){
                int s = pf[T[i]] - (S[i] ? pf[S[i] - 1] : 0);
                if ( s ){
                    cout << "No\n";
                    return;
                }
            }
        }
        sort(all(A));
        int mx = -1;
        for ( auto &[l, r]: A ){
            if ( mx >= r ){
                cout << "No\n";
                return;
            } chmax(mx, r);
        }
        cout << "Yes\n"; return;
    }
    vector <vector<int>> up(20, vector <int> (n));
    vector <int> d(n), tin(n), tout(n);
    int timer = 0;
    auto dfs = [&](auto dfs, int u, int p) -> void{
        up[0][u] = p;
        for ( int i = 1; i < 20; i++ ){
            up[i][u] = up[i - 1][up[i - 1][u]];
        }
        tin[u] = ++timer;
        for ( auto &v: G[u] ){
            if ( v != p ){
                d[v] = d[u] + 1;
                dfs(dfs, v, u);
            }
        } tout[u] = timer;
    };
    dfs(dfs, 0, 0);
    auto lca = [&](int u, int v){
        if ( d[u] < d[v] ) swap(u, v);
        int df = d[u] - d[v];
        for ( int i = 0; i < 20; i++ ){
            if ( df >> i & 1 ){
                u = up[i][u];
            }
        }
        if ( u == v ){
            return u;
        }
        for ( int i = 19; i >= 0; i-- ){
            if ( up[i][u] != up[i][v] ){
                u = up[i][u];
                v = up[i][v];
            }
        }
        return up[0][u];
    };
    auto isPar = [&](int u, int v){
        return tin[u] <= tin[v] && tout[u] >= tout[v];
    };
    auto onPath = [&](int u, int x, int v){
        return (isPar(x, u) || isPar(x, v)) && isPar(lca(u, v), x);
    };
    auto bad = [&](int j, int i){
        return onPath(S[i], S[j], T[i]) || onPath(S[j], T[i], T[j]);
    };
    vector <vector<int>> P(m);
    for ( int i = 0; i < m; i++ ){
        for ( int j = i + 1; j < m; j++ ){
            if ( bad(i, j) ){
                P[i].pb(j);
            }
            if ( bad(j, i) ){
                P[j].pb(i);
            }
        }
    }
    vector <int> us(m);
    auto dfs2 = [&](auto dfs2, int u) -> bool{
        us[u] = 1;
        for ( auto &v: P[u] ){
            if ( !us[v] ){
                if ( !dfs2(dfs2, v) ){
                    return false;
                }
            } else if ( us[v] == 1 ){
                return false;
            }
        }
        us[u] = 2;
        return true;
    };
    bool flag = true;
    for ( int i = 0; i < m; i++ ){
        if ( !us[i] ){
            flag &= dfs2(dfs2, i);
        }
    }
    cout << (flag ? "Yes\n" : "No\n");
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t;
    while ( t-- ){
        solve();
    }

    cout << '\n';
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 10 ms 460 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 416 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 416 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 2 ms 500 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 416 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 2 ms 500 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 5 ms 424 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 2 ms 768 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 7 ms 528 KB Output is correct
35 Correct 8 ms 348 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 348 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 2 ms 416 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 2 ms 500 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 5 ms 424 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 2 ms 768 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 7 ms 528 KB Output is correct
35 Correct 8 ms 348 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 23 ms 860 KB Output is correct
39 Correct 25 ms 7760 KB Output is correct
40 Correct 225 ms 2940 KB Output is correct
41 Correct 102 ms 1936 KB Output is correct
42 Correct 138 ms 3160 KB Output is correct
43 Correct 31 ms 1992 KB Output is correct
44 Correct 54 ms 604 KB Output is correct
45 Correct 66 ms 29104 KB Output is correct
46 Correct 66 ms 29252 KB Output is correct
47 Correct 52 ms 32424 KB Output is correct
48 Correct 56 ms 32420 KB Output is correct
49 Correct 57 ms 29408 KB Output is correct
50 Correct 53 ms 29308 KB Output is correct
51 Correct 47 ms 30120 KB Output is correct
52 Correct 72 ms 30352 KB Output is correct
53 Correct 62 ms 2324 KB Output is correct
54 Correct 78 ms 29956 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 4 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 10 ms 460 KB Output isn't correct
5 Halted 0 ms 0 KB -