oj.uz

Submission #546971

# Submission time Handle Problem Language Result Execution time Memory
546971 2022-04-09T05:11:12 Z ngrace Jail (JOI22_jail) C++14
77 / 100
 5000 ms 479392 KB 
#include <vector>
#include <iostream>
#include <utility>
#include <set>
#include <algorithm>
using namespace std;
#define v vector
#define pii pair<int,int>
#define fi first
#define se second
 
int N,M;
int anc=20;
v<v<int>> adj;
v<int> depth;
v<v<int>> par;
v<int> ps;
v<int> pe;
v<v<int>> num;
void dfs(int cur, int from){
    if(depth[cur]!=-1) return;
    depth[cur]=depth[from]+1;
    par[cur][0]=from;
    if(ps[cur]!=-1) num[cur][0]++;
    if(pe[cur]!=-1) num[cur][0]++;
    for(int it:adj[cur]) dfs(it, cur);
}
bool is_anc(int cur, int other){
    for(int i=anc-1; i>=0; i--){
        if(depth[par[cur][i]]>=depth[other]) cur=par[cur][i];
    }
    if(cur==other) return true;
    return false;
}
 
int lca(int a, int b){
    if(depth[a]<depth[b]) swap(a,b);
    for(int i=anc-1; i>=0; i--){
        if(depth[par[a][i]]>=depth[b]) a=par[a][i];
    }
    if(a==b) return a;
    for(int i=anc-1; i>=0; i--){
        if(par[a][i]!=par[b][i]){
            a=par[a][i];
            b=par[b][i];
        }
    }
    return par[a][0];
}

v<set<int>> diadj;
v<bool> prevrec;
v<bool> vis;
bool find_cycle(int cur){
    if(!vis[cur]){
        vis[cur]=true;
        prevrec[cur]=true;
        for(int it:diadj[cur]){
            if(!vis[it] && find_cycle(it)){
                return true;
            }
            else if(prevrec[it]){
                return true;
            }
        }
    }
    prevrec[cur]=false;
    return false;
}
 
int main(){
    int Q;
    cin>>Q;
    for(int q=0;q<Q;q++){
        cin>>N;
        adj=v<v<int>>(N);
        bool subone=true;
        for(int i=0; i<N-1; i++){
            int a,b;
            cin>>a>>b;
            a--;
            b--;
            adj[a].push_back(b);
            adj[b].push_back(a);
            if(a+1!=b) subone=false;
        }

        if(subone){
            cin>>M;
            v<pii> rooms(M);
            v<pii> rooms2(M);
            for(int i=0; i<M; i++){
                int a,b;
                cin>>a>>b;
                if(b>=a){
                    rooms.push_back({a,b});
                    rooms2.push_back({-a,b});
                    rooms2.push_back({-b,a});
                }
                else{
                    rooms.push_back({a,-b});
                    rooms.push_back({b,-a});
                    rooms2.push_back({-a,-b});
                }
            }
 
            sort(rooms.begin(), rooms.end());
            sort(rooms2.begin(),rooms2.end());
 
            pii cur={-1,-1};
            pii def={-1,-1};
            bool out=true;
            for(pii it:rooms){
                if(it.se<=0){
                    if(cur!=def && cur.se>=it.fi){
                        out=false;
                        break;
                    }
                }
                else{
                    if(it.se<cur.se){
                        out=false;
                        break;
                    }
                    cur=it;
                }
            }
 
            cur={1,1};
            def={1,1};
            for(pii it:rooms2){
                if(it.se>=0){
                    if(cur!=def && cur.se>=it.fi){
                        out=false;
                        break;
                    }
                }
                else{
                    if(it.se<cur.se && cur!=def){
                        out=false;
                        break;
                    }
                    cur=it;
                }
            }
 
            if(out) cout<<"Yes\n";
            else cout<<"No\n";
 
            continue;
        }
 
        cin>>M;
        v<pii> rooms(M);
        ps = v<int>(N,-1);
        pe = v<int>(N,-1);
        for(int i=0; i<M; i++){
            cin>>rooms[i].fi>>rooms[i].se;
            rooms[i].fi--;
            rooms[i].se--;
            ps[rooms[i].fi]=i;
            pe[rooms[i].se]=i;
        }


        depth=v<int>(N,-1);
        par=v<v<int>>(N,v<int>(anc,-1));
        num=v<v<int>>(N,v<int>(anc,0));
        dfs(0,0);
        for(int i=1; i<anc; i++){
            for(int j=0; j<N; j++){
                par[j][i]=par[par[j][i-1]][i-1];
                num[j][i]=num[par[j][i-1]][i-1]+num[j][i-1];
            }
        }


        bool cycle=false;
        diadj = v<set<int>>(M);
        for(int i=0; i<M; i++){
            int a=rooms[i].fi;
            int b=rooms[i].se;
            int l=lca(a,b);

            while(true){
                for(int j=anc-1; j>=0; j--){
                    if(depth[par[a][j]]<depth[l]) continue;
                    if(num[a][j]==0) a=par[a][j];
                }
                if(ps[a]!=-1 && ps[a]!=i) diadj[ps[a]].insert(i);
                if(pe[a]!=-1 && pe[a]!=i) diadj[i].insert(pe[a]);
                if(a==l) break;
                a=par[a][0];
            }
            while(b!=l){
                for(int j=anc-1; j>=0; j--){
                    if(depth[par[b][j]]<=depth[l]) continue;
                    if(num[b][j]==0) b=par[b][j];
                }
                if(ps[b]!=-1 && ps[b]!=i) diadj[ps[b]].insert(i);
                if(pe[b]!=-1 && pe[b]!=i) diadj[i].insert(pe[b]);
                b=par[b][0];
            }

            /**for(int it:diadj[i]){
                if(diadj[it].find(i)!=diadj[it].end()) cycle=true;
                if(cycle) break;
                for(int jt:diadj[it]){
                    if(diadj[jt].find(i)!=diadj[jt].end()) cycle=true;
                    if(cycle=true) break;
                }
                if(cycle) break;
            }
            if(cycle) break;**/
        }

        vis = v<bool>(M,false);
        prevrec = v<bool>(M,false);
        for(int i=0; i<M; i++){
            if(cycle) break;
            if(!vis[i] && find_cycle(i)){
                cycle=true;
                break;
            }
        }
 
        if(cycle) cout<<"No\n";
        else cout<<"Yes\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 23 ms 316 KB Output is correct
5 Correct 48 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 69 ms 788 KB Output is correct
10 Correct 82 ms 6856 KB Output is correct
11 Correct 15 ms 212 KB Output is correct
12 Correct 67 ms 364 KB Output is correct
13 Correct 103 ms 9436 KB Output is correct
14 Correct 109 ms 9516 KB Output is correct
15 Correct 115 ms 9128 KB Output is correct
16 Correct 195 ms 12532 KB Output is correct
17 Correct 125 ms 9368 KB Output is correct
18 Correct 160 ms 12040 KB Output is correct
19 Correct 112 ms 9364 KB Output is correct
20 Correct 138 ms 10112 KB Output is correct
21 Correct 113 ms 9624 KB Output is correct
22 Correct 109 ms 9396 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 8 ms 532 KB Output is correct
32 Correct 5 ms 408 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 23 ms 596 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 5 ms 340 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 8 ms 532 KB Output is correct
32 Correct 5 ms 408 KB Output is correct
33 Correct 4 ms 340 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 23 ms 596 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 86 ms 724 KB Output is correct
39 Correct 73 ms 6856 KB Output is correct
40 Correct 347 ms 6140 KB Output is correct
41 Correct 115 ms 2848 KB Output is correct
42 Correct 331 ms 6792 KB Output is correct
43 Correct 92 ms 2884 KB Output is correct
44 Correct 44 ms 1068 KB Output is correct
45 Correct 173 ms 36532 KB Output is correct
46 Correct 192 ms 36512 KB Output is correct
47 Correct 137 ms 38352 KB Output is correct
48 Correct 163 ms 38352 KB Output is correct
49 Correct 155 ms 36600 KB Output is correct
50 Correct 157 ms 36624 KB Output is correct
51 Correct 147 ms 37124 KB Output is correct
52 Correct 145 ms 37108 KB Output is correct
53 Correct 30 ms 3240 KB Output is correct
54 Correct 183 ms 36556 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 13 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 99 ms 352 KB Output is correct
14 Correct 106 ms 356 KB Output is correct
15 Correct 109 ms 388 KB Output is correct
16 Correct 214 ms 38056 KB Output is correct
17 Correct 757 ms 75248 KB Output is correct
18 Correct 2749 ms 219828 KB Output is correct
19 Correct 228 ms 37964 KB Output is correct
20 Correct 230 ms 38424 KB Output is correct
21 Correct 216 ms 38164 KB Output is correct
22 Correct 744 ms 83024 KB Output is correct
23 Correct 556 ms 83192 KB Output is correct
24 Correct 607 ms 83224 KB Output is correct
25 Correct 563 ms 84792 KB Output is correct
26 Correct 619 ms 84168 KB Output is correct
27 Correct 370 ms 51592 KB Output is correct
28 Correct 385 ms 58516 KB Output is correct
29 Correct 374 ms 53584 KB Output is correct
30 Correct 319 ms 46652 KB Output is correct
31 Correct 290 ms 47480 KB Output is correct
32 Correct 327 ms 45112 KB Output is correct
33 Correct 335 ms 47536 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 23 ms 316 KB Output is correct
5 Correct 48 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 69 ms 788 KB Output is correct
10 Correct 82 ms 6856 KB Output is correct
11 Correct 15 ms 212 KB Output is correct
12 Correct 67 ms 364 KB Output is correct
13 Correct 103 ms 9436 KB Output is correct
14 Correct 109 ms 9516 KB Output is correct
15 Correct 115 ms 9128 KB Output is correct
16 Correct 195 ms 12532 KB Output is correct
17 Correct 125 ms 9368 KB Output is correct
18 Correct 160 ms 12040 KB Output is correct
19 Correct 112 ms 9364 KB Output is correct
20 Correct 138 ms 10112 KB Output is correct
21 Correct 113 ms 9624 KB Output is correct
22 Correct 109 ms 9396 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 3 ms 212 KB Output is correct
39 Correct 4 ms 340 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 6 ms 340 KB Output is correct
43 Correct 4 ms 340 KB Output is correct
44 Correct 5 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 4 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 4 ms 340 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 3 ms 212 KB Output is correct
52 Correct 6 ms 340 KB Output is correct
53 Correct 8 ms 532 KB Output is correct
54 Correct 5 ms 408 KB Output is correct
55 Correct 4 ms 340 KB Output is correct
56 Correct 7 ms 340 KB Output is correct
57 Correct 23 ms 596 KB Output is correct
58 Correct 5 ms 340 KB Output is correct
59 Correct 5 ms 340 KB Output is correct
60 Correct 86 ms 724 KB Output is correct
61 Correct 73 ms 6856 KB Output is correct
62 Correct 347 ms 6140 KB Output is correct
63 Correct 115 ms 2848 KB Output is correct
64 Correct 331 ms 6792 KB Output is correct
65 Correct 92 ms 2884 KB Output is correct
66 Correct 44 ms 1068 KB Output is correct
67 Correct 173 ms 36532 KB Output is correct
68 Correct 192 ms 36512 KB Output is correct
69 Correct 137 ms 38352 KB Output is correct
70 Correct 163 ms 38352 KB Output is correct
71 Correct 155 ms 36600 KB Output is correct
72 Correct 157 ms 36624 KB Output is correct
73 Correct 147 ms 37124 KB Output is correct
74 Correct 145 ms 37108 KB Output is correct
75 Correct 30 ms 3240 KB Output is correct
76 Correct 183 ms 36556 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 13 ms 212 KB Output is correct
82 Correct 2 ms 340 KB Output is correct
83 Correct 3 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 1 ms 316 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 5 ms 340 KB Output is correct
89 Correct 99 ms 352 KB Output is correct
90 Correct 106 ms 356 KB Output is correct
91 Correct 109 ms 388 KB Output is correct
92 Correct 214 ms 38056 KB Output is correct
93 Correct 757 ms 75248 KB Output is correct
94 Correct 2749 ms 219828 KB Output is correct
95 Correct 228 ms 37964 KB Output is correct
96 Correct 230 ms 38424 KB Output is correct
97 Correct 216 ms 38164 KB Output is correct
98 Correct 744 ms 83024 KB Output is correct
99 Correct 556 ms 83192 KB Output is correct
100 Correct 607 ms 83224 KB Output is correct
101 Correct 563 ms 84792 KB Output is correct
102 Correct 619 ms 84168 KB Output is correct
103 Correct 370 ms 51592 KB Output is correct
104 Correct 385 ms 58516 KB Output is correct
105 Correct 374 ms 53584 KB Output is correct
106 Correct 319 ms 46652 KB Output is correct
107 Correct 290 ms 47480 KB Output is correct
108 Correct 327 ms 45112 KB Output is correct
109 Correct 335 ms 47536 KB Output is correct
110 Correct 149 ms 400 KB Output is correct
111 Correct 73 ms 340 KB Output is correct
112 Execution timed out 5068 ms 479392 KB Time limit exceeded
113 Halted 0 ms 0 KB -