oj.uz

Submission #997240

# Submission time Handle Problem Language Result Execution time Memory
997240 2024-06-11T21:41:02 Z vladilius Jail (JOI22_jail) C++17
5 / 100
 86 ms 37608 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define ins insert

struct FT{
    vector<int> bit;
    int n;
    FT(int ns){
        n = ns;
        bit.resize(n + 1);
    }
    void add(int v, int k){
        while (v <= n){
            bit[v] += k;
            v |= (v + 1);
        }
    }
    void upd(int l, int r, int x){
        add(l, x);
        add(r + 1, -x);
    }
    int get(int v){
        int out = 0;
        while (v > 0){
            out += bit[v];
            v = (v & (v + 1)) - 1;
        }
        return out;
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int tt; cin>>tt;
    while (tt--){
        int n; cin>>n;
        vector<int> g[n + 1];
        for (int i = 1; i < n; i++){
            int a, b; cin>>a>>b;
            g[a].pb(b);
            g[b].pb(a);
        }
        
        const int lg = log2(n);
        vector<vector<int>> pw(n + 1, vector<int>(lg + 1));
        vector<int> tin(n + 1), tout(n + 1);
        int timer = 0;
        function<void(int, int)> fill = [&](int v, int pr){
            tin[v] = ++timer;
            pw[v][0] = pr;
            for (int i = 1; i <= lg; i++){
                pw[v][i] = pw[pw[v][i - 1]][i - 1];
            }
            for (int i: g[v]){
                if (i == pr) continue;
                fill(i, v);
            }
            tout[v] = timer;
        };
        fill(1, 1);
        
        auto check = [&](int x, int y){
            return (tin[x] <= tin[y] && tout[x] >= tout[y]);
        };
        
        int m; cin>>m;
        vector<int> s(m + 1), t(m + 1);
        for (int i = 1; i <= m; i++){
            cin>>s[i]>>t[i];
        }
        
        auto lca = [&](int x, int y){
            if (check(x, y)) return x;
            if (check(y, x)) return y;
            for (int i = lg; i >= 0; i--){
                if (!check(pw[x][i], y)){
                    x = pw[x][i];
                }
            }
            return pw[x][0];
        };

        vector<int> p(n + 1);
        for (int i = 1; i <= n; i++) p[i] = i;
        vector<int> w(n + 1);
        for (int i = 1; i <= m; i++) w[s[i]] = i;
        
        pw[1][0] = 0;
        function<int(int)> move = [&](int v){
            if (w[v] || !v) return v;
            if (p[v] == v){
                p[v] = pw[v][0];
            }
            return p[v] = move(p[v]);
        };
        
        vector<int> order;
        function<void(int)> dfs = [&](int v){
            w[s[v]] = 0;
            int l = lca(s[v], t[v]), x;
            while (check(l, x = move(s[v]))){
                dfs(w[x]);
            }
            while (check(l, x = move(t[v]))){
                dfs(w[x]);
            }
            order.pb(v);
        };
        for (int i = 1; i <= m; i++){
            if (w[s[i]]){
                dfs(i);
            }
        }
        
        vector<int> a(n + 1);
        FT T(n);
        auto upd = [&](int v, int k){
            a[v] += k;
            T.upd(tin[v], tout[v], k);
        };
        
        for (int i = 1; i <= m; i++){
            upd(s[i], 1);
        }
        
        auto get = [&](int x, int y){
            int l = lca(x, y);
            return T.get(tin[x]) + T.get(tin[y]) - 2 * T.get(tin[l]) + a[l];
        };
        
        bool out = 1;
        for (int i: order){
            if (get(s[i], t[i]) > 1){
                out = 0;
                break;
            }
            upd(s[i], -1);
            upd(t[i], 1);
        }
        
        cout<<((out) ? "Yes" : "No")<<"\n";
    }
}

Subtask #1
5.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 344 KB Output is correct
4 Correct 10 ms 484 KB Output is correct
5 Correct 21 ms 480 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 26 ms 2024 KB Output is correct
10 Correct 43 ms 33108 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 27 ms 344 KB Output is correct
13 Correct 55 ms 33876 KB Output is correct
14 Correct 51 ms 36044 KB Output is correct
15 Correct 73 ms 36044 KB Output is correct
16 Correct 86 ms 37608 KB Output is correct
17 Correct 73 ms 36132 KB Output is correct
18 Correct 67 ms 37576 KB Output is correct
19 Correct 56 ms 36200 KB Output is correct
20 Correct 53 ms 36184 KB Output is correct
21 Correct 55 ms 36304 KB Output is correct
22 Correct 54 ms 36300 KB Output is correct

Subtask #2
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 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
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 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

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 Incorrect 1 ms 348 KB Output isn't correct
9 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 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 Correct 5 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 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 344 KB Output is correct
4 Correct 10 ms 484 KB Output is correct
5 Correct 21 ms 480 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 26 ms 2024 KB Output is correct
10 Correct 43 ms 33108 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 27 ms 344 KB Output is correct
13 Correct 55 ms 33876 KB Output is correct
14 Correct 51 ms 36044 KB Output is correct
15 Correct 73 ms 36044 KB Output is correct
16 Correct 86 ms 37608 KB Output is correct
17 Correct 73 ms 36132 KB Output is correct
18 Correct 67 ms 37576 KB Output is correct
19 Correct 56 ms 36200 KB Output is correct
20 Correct 53 ms 36184 KB Output is correct
21 Correct 55 ms 36304 KB Output is correct
22 Correct 54 ms 36300 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Incorrect 1 ms 348 KB Output isn't correct
31 Halted 0 ms 0 KB -