oj.uz

답안 #546972

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

# 결과 실행 시간 메모리 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 26 ms 212 KB Output is correct
5 Correct 60 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 70 ms 724 KB Output is correct
10 Correct 76 ms 6804 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 74 ms 352 KB Output is correct
13 Correct 114 ms 9512 KB Output is correct
14 Correct 111 ms 9624 KB Output is correct
15 Correct 142 ms 9216 KB Output is correct
16 Correct 198 ms 12536 KB Output is correct
17 Correct 114 ms 9440 KB Output is correct
18 Correct 146 ms 12108 KB Output is correct
19 Correct 114 ms 9392 KB Output is correct
20 Correct 112 ms 10084 KB Output is correct
21 Correct 126 ms 9656 KB Output is correct
22 Correct 116 ms 9448 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 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 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 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 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 4 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 5 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 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 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 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 4 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 5 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 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 4 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 4 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 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 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 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 4 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 5 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 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 4 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 70 ms 796 KB Output is correct
39 Correct 76 ms 6876 KB Output is correct
40 Correct 126 ms 2896 KB Output is correct
41 Correct 113 ms 2836 KB Output is correct
42 Correct 94 ms 2968 KB Output is correct
43 Correct 103 ms 2884 KB Output is correct
44 Correct 40 ms 980 KB Output is correct
45 Correct 160 ms 36520 KB Output is correct
46 Correct 161 ms 36516 KB Output is correct
47 Correct 147 ms 38332 KB Output is correct
48 Correct 145 ms 38352 KB Output is correct
49 Correct 147 ms 36560 KB Output is correct
50 Correct 150 ms 36556 KB Output is correct
51 Correct 146 ms 37104 KB Output is correct
52 Correct 146 ms 37068 KB Output is correct
53 Correct 30 ms 3284 KB Output is correct
54 Correct 176 ms 36472 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 13 ms 308 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 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 58 ms 360 KB Output is correct
14 Correct 96 ms 352 KB Output is correct
15 Correct 85 ms 340 KB Output is correct
16 Correct 220 ms 38092 KB Output is correct
17 Correct 215 ms 40876 KB Output is correct
18 Correct 255 ms 46120 KB Output is correct
19 Correct 239 ms 38088 KB Output is correct
20 Correct 192 ms 37700 KB Output is correct
21 Correct 217 ms 38096 KB Output is correct
22 Correct 223 ms 42392 KB Output is correct
23 Correct 196 ms 39904 KB Output is correct
24 Correct 590 ms 83236 KB Output is correct
25 Correct 344 ms 59664 KB Output is correct
26 Correct 623 ms 84280 KB Output is correct
27 Correct 390 ms 51592 KB Output is correct
28 Correct 369 ms 58512 KB Output is correct
29 Correct 271 ms 45892 KB Output is correct
30 Correct 304 ms 46672 KB Output is correct
31 Correct 313 ms 47556 KB Output is correct
32 Correct 323 ms 45148 KB Output is correct
33 Correct 316 ms 47500 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 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 26 ms 212 KB Output is correct
5 Correct 60 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 70 ms 724 KB Output is correct
10 Correct 76 ms 6804 KB Output is correct
11 Correct 13 ms 304 KB Output is correct
12 Correct 74 ms 352 KB Output is correct
13 Correct 114 ms 9512 KB Output is correct
14 Correct 111 ms 9624 KB Output is correct
15 Correct 142 ms 9216 KB Output is correct
16 Correct 198 ms 12536 KB Output is correct
17 Correct 114 ms 9440 KB Output is correct
18 Correct 146 ms 12108 KB Output is correct
19 Correct 114 ms 9392 KB Output is correct
20 Correct 112 ms 10084 KB Output is correct
21 Correct 126 ms 9656 KB Output is correct
22 Correct 116 ms 9448 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 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 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 4 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 5 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 4 ms 340 KB Output is correct
53 Correct 4 ms 340 KB Output is correct
54 Correct 4 ms 340 KB Output is correct
55 Correct 4 ms 340 KB Output is correct
56 Correct 5 ms 340 KB Output is correct
57 Correct 10 ms 468 KB Output is correct
58 Correct 4 ms 340 KB Output is correct
59 Correct 5 ms 340 KB Output is correct
60 Correct 70 ms 796 KB Output is correct
61 Correct 76 ms 6876 KB Output is correct
62 Correct 126 ms 2896 KB Output is correct
63 Correct 113 ms 2836 KB Output is correct
64 Correct 94 ms 2968 KB Output is correct
65 Correct 103 ms 2884 KB Output is correct
66 Correct 40 ms 980 KB Output is correct
67 Correct 160 ms 36520 KB Output is correct
68 Correct 161 ms 36516 KB Output is correct
69 Correct 147 ms 38332 KB Output is correct
70 Correct 145 ms 38352 KB Output is correct
71 Correct 147 ms 36560 KB Output is correct
72 Correct 150 ms 36556 KB Output is correct
73 Correct 146 ms 37104 KB Output is correct
74 Correct 146 ms 37068 KB Output is correct
75 Correct 30 ms 3284 KB Output is correct
76 Correct 176 ms 36472 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 0 ms 212 KB Output is correct
81 Correct 13 ms 308 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 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 58 ms 360 KB Output is correct
90 Correct 96 ms 352 KB Output is correct
91 Correct 85 ms 340 KB Output is correct
92 Correct 220 ms 38092 KB Output is correct
93 Correct 215 ms 40876 KB Output is correct
94 Correct 255 ms 46120 KB Output is correct
95 Correct 239 ms 38088 KB Output is correct
96 Correct 192 ms 37700 KB Output is correct
97 Correct 217 ms 38096 KB Output is correct
98 Correct 223 ms 42392 KB Output is correct
99 Correct 196 ms 39904 KB Output is correct
100 Correct 590 ms 83236 KB Output is correct
101 Correct 344 ms 59664 KB Output is correct
102 Correct 623 ms 84280 KB Output is correct
103 Correct 390 ms 51592 KB Output is correct
104 Correct 369 ms 58512 KB Output is correct
105 Correct 271 ms 45892 KB Output is correct
106 Correct 304 ms 46672 KB Output is correct
107 Correct 313 ms 47556 KB Output is correct
108 Correct 323 ms 45148 KB Output is correct
109 Correct 316 ms 47500 KB Output is correct
110 Correct 98 ms 392 KB Output is correct
111 Correct 69 ms 340 KB Output is correct
112 Correct 180 ms 41900 KB Output is correct
113 Correct 241 ms 39928 KB Output is correct
114 Correct 160 ms 42696 KB Output is correct
115 Correct 124 ms 37448 KB Output is correct
116 Correct 305 ms 42928 KB Output is correct
117 Correct 255 ms 43048 KB Output is correct
118 Correct 198 ms 36492 KB Output is correct
119 Correct 176 ms 36428 KB Output is correct
120 Correct 31 ms 5332 KB Output is correct
121 Correct 721 ms 61008 KB Output is correct
122 Correct 739 ms 61204 KB Output is correct
123 Correct 243 ms 41196 KB Output is correct
124 Correct 160 ms 40188 KB Output is correct
125 Correct 249 ms 41464 KB Output is correct
126 Correct 263 ms 48064 KB Output is correct
127 Correct 186 ms 43936 KB Output is correct
128 Correct 188 ms 40956 KB Output is correct
129 Execution timed out 5097 ms 876732 KB Time limit exceeded
130 Halted 0 ms 0 KB -