oj.uz

답안 #950818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950818 2024-03-20T18:15:43 Z vladilius Jail (JOI22_jail) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int q; cin>>q;
    while (q--){
        int n; cin>>n;
        vector<int> g[n + 1];
        for (int i = 1; i < n; i++){
            int a, b; cin>>a>>b;
            g[a].push_back(b);
            g[b].push_back(a);
        }
        int m; cin>>m;
        vector<int> s(m + 1), t(m + 1);
        for (int i = 1; i <= m; i++){
            cin>>s[i]>>t[i];
        }
        
        // pre
        vector<int> tin(n + 1), tout(n + 1), pw[n + 1];
        int lg = ceil(log2(n)) + 1;
        for (int i = 1; i <= n; i++){
            pw[i].resize(lg);
        }
        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]);
        };
        auto lca = [&](int x, int y){
            if (check(x, y)) return x;
            if (check(y, x)) return y;
            for (int i = lg - 1; i >= 0; i--){
                if (!check(pw[x][i], y)){
                    x = pw[x][i];
                }
            }
            return pw[x][0];
        };
        
        FT T(n);
        auto upd = [&](int v, int k){
            T.upd(tin[v], k);
            T.upd(tout[v] + 1, -k);
        };
        vector<int> l(n + 1);
        vector<bool> used(n + 1);
        for (int i = 1; i <= m; i++){
            upd(s[i], 1);
            l[i] = lca(s[i], t[i]);
            used[s[i]] = true;
        }
        
        auto get = [&](int i){
            return T.get(s[i]) + T.get(t[i]) - 2 * T.get(l[i]) + used[l[i]];
        };
        
        vector<bool> vis(n + 1);
        bool out = true;
        for (int i = 1; i <= m; i++){
            bool ind = false;
            for (int j = 1; j <= m; j++){
                if (vis[j]) continue;
                int f = get(j);
                if (f <= 1){
                    vis[j] = ind = true;
                    upd(s[j], -1);
                    upd(t[j], 1);
                    break;
                }
            }
            if (!ind){
                out = false;
                break;
            }
        }
        cout<<(out ? "Yes" : "No")<<"\n";
    }
}

Subtask #1
0 / 5.0

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

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 28.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

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