oj.uz

답안 #546964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546964 2022-04-09T05:04:51 Z ngrace Jail (JOI22_jail) C++14
77 / 100
 5000 ms 916908 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);

            //if have quick way of checking if any are on the path between x and an ancestor of x then can do the while loops below faster with binary lifting
            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(diadj[i].find(ps[a])!=diadj[i].end()){
                        cycle=true;
                        break;
                    }
                }
                if(pe[a]!=-1 && pe[a]!=i){
                    diadj[i].insert(pe[a]);
                    if(diadj[pe[a]].find(i)!=diadj[pe[a]].end()){
                        cycle=true;
                        break;
                    }
                }
                if(a==l) break;
                a=par[a][0];
            }
            if(cycle) break;
            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(diadj[i].find(ps[b])!=diadj[i].end()){
                        cycle=true;
                        break;
                    }
                }
                if(pe[b]!=-1 && pe[b]!=i){
                    diadj[i].insert(pe[b]);
                    if(diadj[pe[b]].find(i)!=diadj[pe[b]].end()){
                        cycle=true;
                        break;
                    }
                }
                b=par[b][0];
            }
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 26 ms 212 KB Output is correct
5 Correct 49 ms 212 KB Output is correct
6 Correct 2 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 71 ms 724 KB Output is correct
10 Correct 88 ms 6860 KB Output is correct
11 Correct 15 ms 212 KB Output is correct
12 Correct 73 ms 352 KB Output is correct
13 Correct 131 ms 9476 KB Output is correct
14 Correct 113 ms 9600 KB Output is correct
15 Correct 148 ms 9180 KB Output is correct
16 Correct 229 ms 12496 KB Output is correct
17 Correct 113 ms 9372 KB Output is correct
18 Correct 166 ms 12060 KB Output is correct
19 Correct 122 ms 9372 KB Output is correct
20 Correct 122 ms 10284 KB Output is correct
21 Correct 134 ms 9776 KB Output is correct
22 Correct 123 ms 9484 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 6 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 6 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 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 6 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 6 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 4 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 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 300 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 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 6 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 6 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 4 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 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 300 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 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 4 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 4 ms 212 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Correct 7 ms 408 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 6 ms 404 KB Output is correct
35 Correct 11 ms 468 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 6 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 6 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 4 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 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 300 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 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 4 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 4 ms 212 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Correct 7 ms 408 KB Output is correct
33 Correct 6 ms 340 KB Output is correct
34 Correct 6 ms 404 KB Output is correct
35 Correct 11 ms 468 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 68 ms 724 KB Output is correct
39 Correct 75 ms 6860 KB Output is correct
40 Correct 118 ms 2892 KB Output is correct
41 Correct 120 ms 2832 KB Output is correct
42 Correct 99 ms 2972 KB Output is correct
43 Correct 91 ms 2904 KB Output is correct
44 Correct 31 ms 980 KB Output is correct
45 Correct 157 ms 36504 KB Output is correct
46 Correct 183 ms 36492 KB Output is correct
47 Correct 139 ms 38400 KB Output is correct
48 Correct 145 ms 38360 KB Output is correct
49 Correct 148 ms 36580 KB Output is correct
50 Correct 152 ms 36600 KB Output is correct
51 Correct 149 ms 37044 KB Output is correct
52 Correct 144 ms 37016 KB Output is correct
53 Correct 30 ms 3236 KB Output is correct
54 Correct 203 ms 36392 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 14 ms 216 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 55 ms 368 KB Output is correct
14 Correct 102 ms 348 KB Output is correct
15 Correct 89 ms 364 KB Output is correct
16 Correct 217 ms 38032 KB Output is correct
17 Correct 209 ms 40936 KB Output is correct
18 Correct 256 ms 46316 KB Output is correct
19 Correct 237 ms 37952 KB Output is correct
20 Correct 183 ms 37736 KB Output is correct
21 Correct 225 ms 38188 KB Output is correct
22 Correct 258 ms 42288 KB Output is correct
23 Correct 193 ms 39912 KB Output is correct
24 Correct 618 ms 83224 KB Output is correct
25 Correct 352 ms 59660 KB Output is correct
26 Correct 616 ms 84232 KB Output is correct
27 Correct 419 ms 51708 KB Output is correct
28 Correct 370 ms 58564 KB Output is correct
29 Correct 405 ms 53596 KB Output is correct
30 Correct 301 ms 46524 KB Output is correct
31 Correct 353 ms 47572 KB Output is correct
32 Correct 313 ms 45068 KB Output is correct
33 Correct 335 ms 47464 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 26 ms 212 KB Output is correct
5 Correct 49 ms 212 KB Output is correct
6 Correct 2 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 71 ms 724 KB Output is correct
10 Correct 88 ms 6860 KB Output is correct
11 Correct 15 ms 212 KB Output is correct
12 Correct 73 ms 352 KB Output is correct
13 Correct 131 ms 9476 KB Output is correct
14 Correct 113 ms 9600 KB Output is correct
15 Correct 148 ms 9180 KB Output is correct
16 Correct 229 ms 12496 KB Output is correct
17 Correct 113 ms 9372 KB Output is correct
18 Correct 166 ms 12060 KB Output is correct
19 Correct 122 ms 9372 KB Output is correct
20 Correct 122 ms 10284 KB Output is correct
21 Correct 134 ms 9776 KB Output is correct
22 Correct 123 ms 9484 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 6 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 6 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 4 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 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 4 ms 300 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 5 ms 340 KB Output is correct
43 Correct 4 ms 340 KB Output is correct
44 Correct 4 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 4 ms 212 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 340 KB Output is correct
54 Correct 7 ms 408 KB Output is correct
55 Correct 6 ms 340 KB Output is correct
56 Correct 6 ms 404 KB Output is correct
57 Correct 11 ms 468 KB Output is correct
58 Correct 5 ms 340 KB Output is correct
59 Correct 5 ms 340 KB Output is correct
60 Correct 68 ms 724 KB Output is correct
61 Correct 75 ms 6860 KB Output is correct
62 Correct 118 ms 2892 KB Output is correct
63 Correct 120 ms 2832 KB Output is correct
64 Correct 99 ms 2972 KB Output is correct
65 Correct 91 ms 2904 KB Output is correct
66 Correct 31 ms 980 KB Output is correct
67 Correct 157 ms 36504 KB Output is correct
68 Correct 183 ms 36492 KB Output is correct
69 Correct 139 ms 38400 KB Output is correct
70 Correct 145 ms 38360 KB Output is correct
71 Correct 148 ms 36580 KB Output is correct
72 Correct 152 ms 36600 KB Output is correct
73 Correct 149 ms 37044 KB Output is correct
74 Correct 144 ms 37016 KB Output is correct
75 Correct 30 ms 3236 KB Output is correct
76 Correct 203 ms 36392 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 1 ms 212 KB Output is correct
81 Correct 14 ms 216 KB Output is correct
82 Correct 2 ms 340 KB Output is correct
83 Correct 2 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 340 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 4 ms 340 KB Output is correct
89 Correct 55 ms 368 KB Output is correct
90 Correct 102 ms 348 KB Output is correct
91 Correct 89 ms 364 KB Output is correct
92 Correct 217 ms 38032 KB Output is correct
93 Correct 209 ms 40936 KB Output is correct
94 Correct 256 ms 46316 KB Output is correct
95 Correct 237 ms 37952 KB Output is correct
96 Correct 183 ms 37736 KB Output is correct
97 Correct 225 ms 38188 KB Output is correct
98 Correct 258 ms 42288 KB Output is correct
99 Correct 193 ms 39912 KB Output is correct
100 Correct 618 ms 83224 KB Output is correct
101 Correct 352 ms 59660 KB Output is correct
102 Correct 616 ms 84232 KB Output is correct
103 Correct 419 ms 51708 KB Output is correct
104 Correct 370 ms 58564 KB Output is correct
105 Correct 405 ms 53596 KB Output is correct
106 Correct 301 ms 46524 KB Output is correct
107 Correct 353 ms 47572 KB Output is correct
108 Correct 313 ms 45068 KB Output is correct
109 Correct 335 ms 47464 KB Output is correct
110 Correct 110 ms 432 KB Output is correct
111 Correct 91 ms 372 KB Output is correct
112 Correct 190 ms 41648 KB Output is correct
113 Correct 222 ms 39880 KB Output is correct
114 Correct 207 ms 41864 KB Output is correct
115 Correct 130 ms 37444 KB Output is correct
116 Correct 309 ms 42992 KB Output is correct
117 Correct 287 ms 43128 KB Output is correct
118 Correct 176 ms 36488 KB Output is correct
119 Correct 187 ms 36532 KB Output is correct
120 Correct 26 ms 5296 KB Output is correct
121 Correct 601 ms 61232 KB Output is correct
122 Correct 654 ms 61144 KB Output is correct
123 Correct 245 ms 41196 KB Output is correct
124 Correct 160 ms 40208 KB Output is correct
125 Correct 273 ms 41544 KB Output is correct
126 Correct 213 ms 45724 KB Output is correct
127 Correct 236 ms 42572 KB Output is correct
128 Correct 191 ms 41040 KB Output is correct
129 Execution timed out 5086 ms 916908 KB Time limit exceeded
130 Halted 0 ms 0 KB -