oj.uz

Submission #567035

# Submission time Handle Problem Language Result Execution time Memory
567035 2022-05-23T07:25:52 Z zaneyu Jail (JOI22_jail) C++14
0 / 100
 5000 ms 537240 KB 
/*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];
int vis[maxn];
int par[maxn];
int dep[maxn];
void dfs(int u,int p){
    par[u]=p;
    for(int x:v[u]){
        if(x==p) continue;
        dep[x]=dep[u]+1;
        dfs(x,u);
    }
}

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);
    }
    dfs(0,-1);
    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;
        cur=i+1;
        if(in[b]) vv[in[b]].pb(cur);
        if(out[a]) vv[cur].pb(out[a]);
        vector<int> pth;
        while(a!=b){
            if(dep[a]>dep[b]){
                a=par[a];
                pth.pb(a);
            }
            else{
                b=par[b];
                pth.pb(b);               
            }
        }
        SORT_UNIQUE(pth);
        for(int a:pth){
            if(a==asd[i].f or a==b) continue;
            if(in[a]) vv[in[a]].pb(cur);
            if(out[a]) vv[cur].pb(out[a]);
        } 
    }
    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();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 29 ms 9684 KB Output is correct
5 Correct 58 ms 9684 KB Output is correct
6 Correct 10 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 10 ms 9812 KB Output is correct
9 Correct 296 ms 12304 KB Output is correct
10 Correct 1523 ms 20816 KB Output is correct
11 Correct 17 ms 9684 KB Output is correct
12 Correct 90 ms 9740 KB Output is correct
13 Correct 283 ms 49644 KB Output is correct
14 Correct 334 ms 63924 KB Output is correct
15 Execution timed out 5072 ms 537240 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9628 KB Output is correct
3 Correct 8 ms 9684 KB Output is correct
4 Incorrect 8 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9628 KB Output is correct
3 Correct 8 ms 9684 KB Output is correct
4 Incorrect 8 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9628 KB Output is correct
3 Correct 8 ms 9684 KB Output is correct
4 Incorrect 8 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9628 KB Output is correct
3 Correct 8 ms 9684 KB Output is correct
4 Incorrect 8 ms 9684 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9620 KB Output is correct
4 Correct 5 ms 9600 KB Output is correct
5 Correct 19 ms 9668 KB Output is correct
6 Incorrect 7 ms 9684 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 29 ms 9684 KB Output is correct
5 Correct 58 ms 9684 KB Output is correct
6 Correct 10 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 10 ms 9812 KB Output is correct
9 Correct 296 ms 12304 KB Output is correct
10 Correct 1523 ms 20816 KB Output is correct
11 Correct 17 ms 9684 KB Output is correct
12 Correct 90 ms 9740 KB Output is correct
13 Correct 283 ms 49644 KB Output is correct
14 Correct 334 ms 63924 KB Output is correct
15 Execution timed out 5072 ms 537240 KB Time limit exceeded
16 Halted 0 ms 0 KB -