oj.uz

Submission #776267

# Submission time Handle Problem Language Result Execution time Memory
776267 2023-07-07T14:08:47 Z eltu0815 Jail (JOI22_jail) C++14
0 / 100
 5 ms 8788 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, m, tt;
int parent[120005][25];
int s[120005], t[120005], dep[120005], deg[120005];
vector<int> can[120005];
vector<int> graph[120005];
vector<int> DAG[120005];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> tt;
    while(tt--) {
        cin >> n;
        for(int i = 1; i <= n; ++i) graph[i].clear(), DAG[i].clear(), can[i].clear();
        for(int i = 1; i <= n; ++i) deg[i] = 0;
        for(int i = 1; i <= n; ++i) for(int j = 0; j <= 20; ++j) parent[i][j] = 0;
        for(int i = 1; i <= n - 1; ++i) {
            int a, b; cin >> a >> b;
            graph[a].push_back(b);
            graph[b].push_back(a);
        }
        
        cin >> m;
        for(int i = 1; i <= m; ++i) cin >> s[i] >> t[i];
        
        auto dfs = [&](auto&& self, int node, int par) -> void {
            parent[node][0] = par; dep[node] = dep[par] + 1;
            for(auto v : graph[node]) if(v != par) self(self, v, node);
        };
        dfs(dfs, 1, 0);
        for(int j = 1; j < 20; ++j) for(int i = 1; i <= n; ++i) parent[i][j] = parent[parent[i][j - 1]][j - 1];
        
        auto LCA = [&](int u, int v) -> int {
            if(dep[u] < dep[v]) swap(u, v);
            int diff = dep[u] - dep[v], j = 0;
            while(diff) {
                if(diff & 1) u = parent[u][j];
                diff >>= 1; ++j;
            }
            if(u == v) return u;
            for(int i = 19; i >= 0; --i) {
                if(parent[u][i] != parent[v][i]) {
                    u = parent[u][i];
                    v = parent[v][i];
                }
            }
            return parent[u][0];
        };
        
        for(int i = 1; i <= m; ++i) can[t[i]].push_back(i);
        for(int i = 1; i <= m; ++i) {
            int p = LCA(s[i], t[i]);
            for(int tmp : {s[i], t[i]}) {
                while(tmp != p) {
                    for(auto j : can[tmp]) {
                        if(j == i) continue;
                        DAG[j].push_back(i);
                        deg[i]++;
                    }
                    tmp = parent[tmp][0];
                }
            }
        }
        
        queue<int> q; int cnt = 0;
        for(int i = 1; i <= m; ++i) if(deg[i] == 0) q.push(i);
        while(!q.empty()) {
            int node = q.front(); q.pop(); ++cnt;
            for(auto v : DAG[node]) if(--deg[v] == 0) q.push(v);
        }
        
        if(cnt == m) cout << "Yes\n";
        else cout << "No\n";
    }
    
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 4 ms 8788 KB Output is correct
3 Incorrect 4 ms 8776 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8784 KB Output is correct
2 Incorrect 4 ms 8788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8784 KB Output is correct
2 Incorrect 4 ms 8788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8784 KB Output is correct
2 Incorrect 4 ms 8788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8784 KB Output is correct
2 Incorrect 4 ms 8788 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8784 KB Output is correct
2 Correct 5 ms 8788 KB Output is correct
3 Correct 4 ms 8788 KB Output is correct
4 Incorrect 5 ms 8720 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8788 KB Output is correct
2 Correct 4 ms 8788 KB Output is correct
3 Incorrect 4 ms 8776 KB Output isn't correct
4 Halted 0 ms 0 KB -