Submission #546329

#TimeUsernameProblemLanguageResultExecution timeMemory
546329Jarif_RahmanJail (JOI22_jail)C++17
72 / 100
3531 ms1048576 KiB
#include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; int n, m; vector<vector<int>> v; vector<int> s, t; vector<vector<int>> sth; vector<int> state; vector<int> p; vector<int> d; bool cycle; void dfs1(int nd, int ss, int dis){ for(int x: v[nd]) if(x != ss) dfs1(x, nd, dis+1); p[nd] = ss; d[nd] = dis; } void dfs2(int nd){ if(state[nd] == 1){ cycle = 1; return; } if(state[nd] == 2) return; state[nd] = 1; for(int x: sth[nd]) dfs2(x); state[nd] = 2; } void solve(){ cin >> n; v.assign(n, {}); p.assign(n, 0); d.assign(n, 0); sth.assign(2*n, {}); state.assign(2*n, 0); for(int i = 0; i < n-1; i++){ int a, b; cin >> a >> b; a--, b--; v[a].pb(b); v[b].pb(a); } dfs1(0, -1, 0); cin >> m; s.assign(m, 0); t.assign(m, 0); for(int i = 0; i < m; i++) cin >> s[i] >> t[i], s[i]--, t[i]--; for(int i = 0; i < m; i++){ sth[s[i]].pb(t[i]+n); } auto get_path = [&](int a, int b){ vector<int> rt; if(d[a] > d[b]) swap(a, b); while(d[a] != d[b]) rt.pb(b), b = p[b]; while(a != b) rt.pb(a), rt.pb(b), a = p[a], b = p[b]; rt.pb(a); return rt; }; for(int i = 0; i < m; i++){ for(int x: get_path(s[i], t[i])){ if(x != s[i]) sth[t[i]+n].pb(x); if(x != t[i]) sth[x+n].pb(s[i]); } } cycle = 0; for(int i = 0; i < n; i++) if(state[i] == 0) dfs2(i); cout << (cycle?"No\n":"Yes\n"); } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int T; cin >> T; while(T--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...