제출 #566915

#제출 시각아이디문제언어결과실행 시간메모리
566915zaneyuJail (JOI22_jail)C++14
61 / 100
5060 ms28364 KiB
/*input 2 7 1 2 2 3 3 4 4 5 3 6 6 7 2 4 1 5 7 4 1 2 1 3 1 4 3 2 3 3 4 4 2 */ #include<bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set; #pragma GCC optimize("Ofast") //#pragma GCC target("avx2") //order_of_key #of elements less than x // find_by_order kth element using ll=long long; using ld=long double; using pii=pair<int,int>; #define f first #define s second #define pb push_back #define REP(i,n) for(int i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() #define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end())))) const ll maxn=2e5+5; const ll maxlg=__lg(maxn)+2; const ll INF64=4e18; const int INF=0x3f3f3f3f; const ll MOD=1e9+7; const ld PI=acos(-1); const ld eps=1e-6; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) template<typename T1,typename T2> ostream& operator<<(ostream& out,pair<T1,T2> P){ out<<P.f<<' '<<P.s; return out; } template<typename T> ostream& operator<<(ostream& out,vector<T> V){ REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":""); return out; } ll mult(ll a,ll b){ return a*b%MOD; } ll mypow(ll a,ll b){ a%=MOD; if(a==0) return 0; if(b<=0) return 1; ll res=1LL; while(b){ if(b&1) res=(res*a)%MOD; a=(a*a)%MOD; b>>=1; } return res; } int d; bool hv[maxn]; bool wk=1; vector<int> v[maxn]; int in[maxn],out[maxn]; int cur; vector<int> vv[maxn]; bool dfs(int u,int p){ if(u==d){ return true; } for(int x:v[u]){ if(x==p) continue; if(dfs(x,u)){ if(in[x]) vv[in[x]].pb(cur); if(x!=d and out[x]) vv[cur].pb(out[x]); return true; } } return false; } int vis[maxn]; void dfs2(int u){ vis[u]=1; for(int x:vv[u]){ if(!vis[x]) dfs2(x); else if(vis[x]==1){ wk=0; break; } } vis[u]=2; } void solve(){ int n,m; cin>>n; wk=1; REP(i,n-1){ int a,b; cin>>a>>b; --a,--b; v[a].pb(b),v[b].pb(a); } wk=1; cin>>m; vector<pii> asd; REP1(i,m){ int a,b; cin>>a>>b; --a,--b; in[a]=i,out[b]=i; asd.pb({a,b}); } REP(i,sz(asd)){ int a=asd[i].f,b=asd[i].s; d=b; cur=i+1; dfs(a,-1); if(out[a]) vv[cur].pb(out[a]); } //REP1(i,m) cout<<i<<' '<<vv[i]<<'\n'; REP1(i,m){ if(!vis[i]) dfs2(i); } if(wk){ cout<<"Yes\n"; } else cout<<"No\n"; REP(i,n) v[i].clear(),hv[i]=0,in[i]=out[i]=0; REP1(i,m) vv[i].clear(),vis[i]=0; } int main(){ 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...