oj.uz

Submission #890798

# Submission time Handle Problem Language Result Execution time Memory
890798 2023-12-22T03:33:09 Z vjudge1 Jail (JOI22_jail) C++17
49 / 100
 5000 ms 483580 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);
    for ( int i = 0; i + 1 < n; i++ ){
        int u, v; cin >> u >> v;
        --u, --v;
        G[u].pb(v), G[v].pb(u);
    }
    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];
    }
    vector <int> tmp;
    auto dfs = [&](auto dfs, int u, int p, int des) -> bool{
        if ( u == des ){
            return true;
        }
        for ( auto &v: G[u] ){
            if ( v != p ){
                if ( dfs(dfs, v, u, des) ){
                    tmp.pb(u);
                    return true;
                }
            }
        }
        return false;
    };
    vector <vector<int>> lst(m);
    for ( int i = 0; i < m; i++ ){
        tmp.clear();
        dfs(dfs, S[i], -1, T[i]);
        reverse(all(tmp));
        tmp.pb(T[i]);
        lst[i] = tmp;
    }
    auto bad = [&](int j, int i){
        for ( auto &u: lst[i] ){
            if ( u == S[j] ){
                return true;
            }
        }
        for ( auto &u: lst[j] ){
            if ( u == T[i] ){
                return true;
            }
        }
        return false;
    };
    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

# Verdict Execution time Memory 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 Correct 10 ms 348 KB Output is correct
5 Correct 20 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 10 ms 524 KB Output is correct
9 Correct 3481 ms 24424 KB Output is correct
10 Execution timed out 5064 ms 482476 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 0 ms 600 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 14 ms 604 KB Output is correct
30 Correct 4 ms 548 KB Output is correct
31 Correct 7 ms 544 KB Output is correct
32 Correct 5 ms 600 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 6 ms 348 KB Output is correct
35 Correct 16 ms 704 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 4 ms 348 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 14 ms 604 KB Output is correct
30 Correct 4 ms 548 KB Output is correct
31 Correct 7 ms 544 KB Output is correct
32 Correct 5 ms 600 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 6 ms 348 KB Output is correct
35 Correct 16 ms 704 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 3467 ms 25972 KB Output is correct
39 Execution timed out 5025 ms 483580 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 66 ms 956 KB Output is correct
14 Correct 67 ms 1328 KB Output is correct
15 Correct 92 ms 1104 KB Output is correct
16 Execution timed out 5048 ms 10772 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory 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 Correct 10 ms 348 KB Output is correct
5 Correct 20 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 10 ms 524 KB Output is correct
9 Correct 3481 ms 24424 KB Output is correct
10 Execution timed out 5064 ms 482476 KB Time limit exceeded
11 Halted 0 ms 0 KB -