oj.uz

Submission #566915

# Submission time Handle Problem Language Result Execution time Memory
566915 2022-05-23T06:19:10 Z zaneyu Jail (JOI22_jail) C++14
61 / 100
 5000 ms 28364 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];
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();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9672 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 25 ms 9684 KB Output is correct
5 Correct 48 ms 9684 KB Output is correct
6 Correct 7 ms 9620 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 9 ms 9812 KB Output is correct
9 Correct 256 ms 12432 KB Output is correct
10 Correct 1035 ms 23428 KB Output is correct
11 Correct 15 ms 9684 KB Output is correct
12 Correct 87 ms 9868 KB Output is correct
13 Execution timed out 5060 ms 28364 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.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 7 ms 9708 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 9 ms 9684 KB Output is correct
6 Correct 8 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9712 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9704 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct

Subtask #3
16.0 / 16.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 7 ms 9708 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 9 ms 9684 KB Output is correct
6 Correct 8 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9712 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9704 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 9 ms 9684 KB Output is correct
19 Correct 6 ms 9656 KB Output is correct
20 Correct 7 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 8 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 8 ms 9684 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct

Subtask #4
28.0 / 28.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 7 ms 9708 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 9 ms 9684 KB Output is correct
6 Correct 8 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9712 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9704 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 9 ms 9684 KB Output is correct
19 Correct 6 ms 9656 KB Output is correct
20 Correct 7 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 8 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 8 ms 9684 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct
29 Correct 10 ms 9812 KB Output is correct
30 Correct 9 ms 9740 KB Output is correct
31 Correct 9 ms 9684 KB Output is correct
32 Correct 9 ms 9684 KB Output is correct
33 Correct 9 ms 9684 KB Output is correct
34 Correct 10 ms 9748 KB Output is correct
35 Correct 10 ms 9796 KB Output is correct
36 Correct 8 ms 9684 KB Output is correct
37 Correct 8 ms 9684 KB Output is correct

Subtask #5
12.0 / 12.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 7 ms 9708 KB Output is correct
4 Correct 7 ms 9684 KB Output is correct
5 Correct 9 ms 9684 KB Output is correct
6 Correct 8 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 7 ms 9712 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9704 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 7 ms 9684 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 9 ms 9684 KB Output is correct
19 Correct 6 ms 9656 KB Output is correct
20 Correct 7 ms 9684 KB Output is correct
21 Correct 7 ms 9684 KB Output is correct
22 Correct 8 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 8 ms 9684 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct
29 Correct 10 ms 9812 KB Output is correct
30 Correct 9 ms 9740 KB Output is correct
31 Correct 9 ms 9684 KB Output is correct
32 Correct 9 ms 9684 KB Output is correct
33 Correct 9 ms 9684 KB Output is correct
34 Correct 10 ms 9748 KB Output is correct
35 Correct 10 ms 9796 KB Output is correct
36 Correct 8 ms 9684 KB Output is correct
37 Correct 8 ms 9684 KB Output is correct
38 Correct 253 ms 12236 KB Output is correct
39 Correct 1129 ms 23308 KB Output is correct
40 Correct 462 ms 11248 KB Output is correct
41 Correct 432 ms 10000 KB Output is correct
42 Correct 210 ms 11460 KB Output is correct
43 Correct 84 ms 10096 KB Output is correct
44 Correct 54 ms 9880 KB Output is correct
45 Correct 1231 ms 14564 KB Output is correct
46 Correct 1269 ms 14564 KB Output is correct
47 Correct 547 ms 18236 KB Output is correct
48 Correct 596 ms 18280 KB Output is correct
49 Correct 1036 ms 14724 KB Output is correct
50 Correct 1004 ms 14704 KB Output is correct
51 Correct 244 ms 15704 KB Output is correct
52 Correct 250 ms 15680 KB Output is correct
53 Correct 55 ms 10100 KB Output is correct
54 Correct 1089 ms 14520 KB Output is correct

Subtask #6
0 / 11.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 5 ms 9596 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 16 ms 9724 KB Output is correct
6 Correct 6 ms 9712 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 8 ms 9716 KB Output is correct
13 Correct 48 ms 9724 KB Output is correct
14 Correct 75 ms 9724 KB Output is correct
15 Correct 60 ms 9684 KB Output is correct
16 Execution timed out 5042 ms 14860 KB Time limit exceeded
17 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 5 ms 9672 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 25 ms 9684 KB Output is correct
5 Correct 48 ms 9684 KB Output is correct
6 Correct 7 ms 9620 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 9 ms 9812 KB Output is correct
9 Correct 256 ms 12432 KB Output is correct
10 Correct 1035 ms 23428 KB Output is correct
11 Correct 15 ms 9684 KB Output is correct
12 Correct 87 ms 9868 KB Output is correct
13 Execution timed out 5060 ms 28364 KB Time limit exceeded
14 Halted 0 ms 0 KB -