oj.uz

답안 #709957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709957 2023-03-15T01:36:40 Z GrandTiger1729 Jail (JOI22_jail) C++17
5 / 100
 261 ms 36556 KB 
#include <iostream>
#include <vector>
#include <functional>
using namespace std;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while (t--){
        int n; cin >> n;
        vector<vector<int>> g(n);
        for (int i = 0; i < n - 1; i++){
            int u, v; cin >> u >> v;
            u--, v--;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        vector<bool> vis(n);
        vector<int> dep(n);
        vector<vector<int>> up(n, vector<int>(__lg(n) + 1));
        function<void(int)> dfs = [&](int u){
            vis[u] = 1;
            for (auto &v: g[u]){
                if (vis[v]) continue;
                up[v][0] = u;
                dep[v] = dep[u] + 1;
                dfs(v);
            }
            vis[u] = 0;
        };
        dfs(0);
        for (int j = 1; j <= __lg(n); j++){
            for (int i = 0; i < n; i++){
                up[i][j] = up[up[i][j - 1]][j - 1];
            }
        }
        auto lca = [&](int u, int v){
            if (dep[u] < dep[v]) swap(u, v);
            for (int i = __lg(n); i >= 0; i--){
                if (dep[up[u][i]] >= dep[v]){
                    u = up[u][i];
                }
            }
            if (u == v) return u;
            for (int i = __lg(n); i >= 0; i--){
                if (up[u][i] != up[v][i]){
                    u = up[u][i];
                    v = up[v][i];
                }
            }
            return up[u][0];
        };
        vector<pair<int, int>> tag(n);
        for (int i = 0; i < n; i++){
            tag[i] = make_pair(i, i);
        }
        int q; cin >> q;
        while (q--){
            int u, v; cin >> u >> v;
            u--, v--;
            int l = lca(u, v);
            if (dep[l] < dep[tag[u].first]){
                tag[u].first = l;
            }
            if (dep[l] < dep[tag[v].second]){
                tag[v].second = l;
            }
        }
        bool flag = 0;
        function<void(int)> solve = [&](int u){
            vis[u] = 1;
            pair<int, int> res{u, u};
            for (auto &v: g[u]){
                if (vis[v]) continue;
                solve(v);
                if (dep[tag[v].first] <= dep[u] && dep[tag[v].second] <= dep[u])
                    flag = 1;
                if ((tag[u].first != u && dep[tag[v].first] <= dep[tag[u].first]) \
                         || (tag[u].second != u && dep[tag[v].second] <= dep[tag[u].second]))
                    flag = 1;
                if (dep[tag[v].first] <= dep[res.first])
                    res.first = tag[v].first;
                if (dep[tag[v].second] <= dep[res.second])
                    res.second = tag[v].second;
            }
            if (dep[res.first] <= dep[tag[u].first])
                tag[u].first = res.first;
            if (dep[res.second] <= dep[tag[u].second])
                tag[u].second = res.second;
            vis[u] = 0;
        };
        solve(0);
        cout << (!flag? "Yes": "No") << '\n';
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 18 ms 344 KB Output is correct
5 Correct 37 ms 972 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 46 ms 3088 KB Output is correct
10 Correct 75 ms 35068 KB Output is correct
11 Correct 7 ms 436 KB Output is correct
12 Correct 47 ms 1216 KB Output is correct
13 Correct 85 ms 35656 KB Output is correct
14 Correct 84 ms 35680 KB Output is correct
15 Correct 157 ms 35628 KB Output is correct
16 Correct 261 ms 36556 KB Output is correct
17 Correct 93 ms 35820 KB Output is correct
18 Correct 115 ms 36428 KB Output is correct
19 Correct 95 ms 35740 KB Output is correct
20 Correct 89 ms 35736 KB Output is correct
21 Correct 89 ms 35728 KB Output is correct
22 Correct 89 ms 35780 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 28.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 11 ms 332 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 18 ms 344 KB Output is correct
5 Correct 37 ms 972 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 46 ms 3088 KB Output is correct
10 Correct 75 ms 35068 KB Output is correct
11 Correct 7 ms 436 KB Output is correct
12 Correct 47 ms 1216 KB Output is correct
13 Correct 85 ms 35656 KB Output is correct
14 Correct 84 ms 35680 KB Output is correct
15 Correct 157 ms 35628 KB Output is correct
16 Correct 261 ms 36556 KB Output is correct
17 Correct 93 ms 35820 KB Output is correct
18 Correct 115 ms 36428 KB Output is correct
19 Correct 95 ms 35740 KB Output is correct
20 Correct 89 ms 35736 KB Output is correct
21 Correct 89 ms 35728 KB Output is correct
22 Correct 89 ms 35780 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Incorrect 2 ms 340 KB Output isn't correct
27 Halted 0 ms 0 KB -