oj.uz

답안 #256137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256137 2020-08-02T10:15:57 Z 문홍윤(#5033) Joker (BOI20_joker) C++17
100 / 100
 453 ms 13156 KB 
#include <bits/stdc++.h>
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int inf=987654321;

struct UNION_FIND{
    int par[400010], sz[400010];
    vector<int> vc;
    UNION_FIND(){for(int i=1; i<=400000; i++)par[i]=i, sz[i]=1;}
    int findpar(int num){return num==par[num]?num:findpar(par[num]);}
    void mergepar(int a, int b){
        a=findpar(a);
        b=findpar(b);
        if(a==b)return;
        if(sz[a]<sz[b])swap(a, b);
        vc.pb(b);
        par[b]=a;
        sz[a]+=sz[b];
    }
    void rollback(){
        int tmp=vc.back();
        vc.pop_back();
        sz[par[tmp]]-=sz[tmp];
        par[tmp]=tmp;
    }
}uf;

int n, m, q, ans[200010], l, r;
pii edg[200010];

int link(int a, int b){
    uf.mergepar(2*a-1, 2*b);
    uf.mergepar(2*a, 2*b-1);
    if(uf.findpar(2*a)==uf.findpar(2*a-1))return 1;
    return 0;
}

void dnc(int sa, int ea, int sb, int eb){
    if(sa>ea)return;
    int mid=(sa+ea)/2;
    int tmp1=uf.vc.size();
    for(int i=l+1; i<=mid; i++)link(edg[i].F, edg[i].S);
    l=mid;
    int tmp2=uf.vc.size();
    for(int i=r-1; i>l&&i>=sb; i--){
        int sz=uf.vc.size();
        int tmp=link(edg[i].F, edg[i].S);
        if(tmp){
            while(sz<uf.vc.size())uf.rollback();
            break;
        }
        r=i;
    }
    ans[mid]=r;
    while(tmp2<uf.vc.size())uf.rollback();
    r=eb;
    link(edg[mid+1].F, edg[mid+1].S);
    l=mid+1;
    dnc(mid+1, ea, ans[mid], eb);
    while(tmp1<uf.vc.size())uf.rollback();
    l=sa;
    for(int i=r-1; i>=ans[mid]; i--)link(edg[i].F, edg[i].S);
    r=ans[mid];
    dnc(sa, mid-1, sb, ans[mid]);
    while(tmp1<uf.vc.size())uf.rollback();
    r=eb;
}

int main(){
    scanf("%d %d %d", &n, &m, &q);
    int np=0;
    for(int i=1; i<=m; i++)scanf("%d %d", &edg[i].F, &edg[i].S);
    int ll=m, lr=1;
    for(int i=1; i<=m; i++){
        if(link(edg[i].F, edg[i].S)){
            ll=i-1;
            break;
        }
        if(i==m)np=1;
    }
    while(uf.vc.size())uf.rollback();
    for(int i=m; i>=1; i--){
        if(link(edg[i].F, edg[i].S)){
            lr=i+1;
            break;
        }
    }
    while(uf.vc.size())uf.rollback();
    r=m+1;
    if(!np)dnc(0, ll, lr, m+1);
    for(int i=ll+1; i<=m; i++)ans[i]=inf;
    //for(int i=0; i<=m; i++)printf("! %d : %d\n", i, ans[i]);
    for(int i=1; i<=q; i++){
        int a, b;
        scanf("%d %d", &a, &b);
        if(np)puts("NO");
        else if(ans[a-1]<=b+1)puts("NO");
        else puts("YES");
    }
}

Compilation message

Joker.cpp: In function 'void dnc(int, int, int, int)':
Joker.cpp:54:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(sz<uf.vc.size())uf.rollback();
                   ~~^~~~~~~~~~~~~
Joker.cpp:60:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(tmp2<uf.vc.size())uf.rollback();
           ~~~~^~~~~~~~~~~~~
Joker.cpp:65:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(tmp1<uf.vc.size())uf.rollback();
           ~~~~^~~~~~~~~~~~~
Joker.cpp:70:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(tmp1<uf.vc.size())uf.rollback();
           ~~~~^~~~~~~~~~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:77:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=m; i++)scanf("%d %d", &edg[i].F, &edg[i].S);
                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:100:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Correct 2 ms 3456 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 2 ms 3456 KB Output is correct
9 Correct 2 ms 3456 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3456 KB Output is correct
12 Correct 3 ms 3432 KB Output is correct
13 Correct 3 ms 3456 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 3 ms 3456 KB Output is correct
18 Correct 3 ms 3456 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 2 ms 3456 KB Output is correct
21 Correct 2 ms 3456 KB Output is correct
22 Correct 2 ms 3456 KB Output is correct
23 Correct 2 ms 3456 KB Output is correct
24 Correct 3 ms 3456 KB Output is correct
25 Correct 2 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 2 ms 3456 KB Output is correct
28 Correct 2 ms 3456 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Correct 2 ms 3456 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 2 ms 3456 KB Output is correct
9 Correct 2 ms 3456 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3456 KB Output is correct
12 Correct 3 ms 3432 KB Output is correct
13 Correct 3 ms 3456 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 3 ms 3456 KB Output is correct
18 Correct 3 ms 3456 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 2 ms 3456 KB Output is correct
21 Correct 2 ms 3456 KB Output is correct
22 Correct 2 ms 3456 KB Output is correct
23 Correct 2 ms 3456 KB Output is correct
24 Correct 3 ms 3456 KB Output is correct
25 Correct 2 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 2 ms 3456 KB Output is correct
28 Correct 2 ms 3456 KB Output is correct
29 Correct 3 ms 3456 KB Output is correct
30 Correct 4 ms 3456 KB Output is correct
31 Correct 4 ms 3456 KB Output is correct
32 Correct 5 ms 3456 KB Output is correct
33 Correct 3 ms 3456 KB Output is correct
34 Correct 4 ms 3456 KB Output is correct
35 Correct 4 ms 3456 KB Output is correct
36 Correct 4 ms 3456 KB Output is correct
37 Correct 5 ms 3456 KB Output is correct
38 Correct 3 ms 3456 KB Output is correct
39 Correct 4 ms 3456 KB Output is correct
40 Correct 4 ms 3456 KB Output is correct
41 Correct 4 ms 3456 KB Output is correct
42 Correct 4 ms 3456 KB Output is correct
43 Correct 4 ms 3456 KB Output is correct
44 Correct 5 ms 3456 KB Output is correct
45 Correct 4 ms 3456 KB Output is correct
46 Correct 5 ms 3456 KB Output is correct
47 Correct 4 ms 3456 KB Output is correct
48 Correct 4 ms 3456 KB Output is correct
49 Correct 4 ms 3456 KB Output is correct
50 Correct 6 ms 3456 KB Output is correct
51 Correct 4 ms 3456 KB Output is correct
52 Correct 4 ms 3456 KB Output is correct
53 Correct 4 ms 3456 KB Output is correct
54 Correct 4 ms 3456 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 240 ms 7400 KB Output is correct
4 Correct 136 ms 7396 KB Output is correct
5 Correct 221 ms 8040 KB Output is correct
6 Correct 199 ms 7400 KB Output is correct
7 Correct 206 ms 7400 KB Output is correct
8 Correct 219 ms 7148 KB Output is correct
9 Correct 255 ms 7404 KB Output is correct
10 Correct 357 ms 7528 KB Output is correct
11 Correct 254 ms 7272 KB Output is correct
12 Correct 300 ms 7400 KB Output is correct
13 Correct 211 ms 6772 KB Output is correct
14 Correct 221 ms 7024 KB Output is correct
15 Correct 308 ms 7404 KB Output is correct
16 Correct 360 ms 7360 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Correct 2 ms 3456 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 2 ms 3456 KB Output is correct
9 Correct 2 ms 3456 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3456 KB Output is correct
12 Correct 3 ms 3432 KB Output is correct
13 Correct 3 ms 3456 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 3 ms 3456 KB Output is correct
18 Correct 3 ms 3456 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 2 ms 3456 KB Output is correct
21 Correct 2 ms 3456 KB Output is correct
22 Correct 2 ms 3456 KB Output is correct
23 Correct 2 ms 3456 KB Output is correct
24 Correct 3 ms 3456 KB Output is correct
25 Correct 2 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 2 ms 3456 KB Output is correct
28 Correct 2 ms 3456 KB Output is correct
29 Correct 240 ms 7400 KB Output is correct
30 Correct 136 ms 7396 KB Output is correct
31 Correct 221 ms 8040 KB Output is correct
32 Correct 199 ms 7400 KB Output is correct
33 Correct 206 ms 7400 KB Output is correct
34 Correct 219 ms 7148 KB Output is correct
35 Correct 255 ms 7404 KB Output is correct
36 Correct 357 ms 7528 KB Output is correct
37 Correct 254 ms 7272 KB Output is correct
38 Correct 300 ms 7400 KB Output is correct
39 Correct 211 ms 6772 KB Output is correct
40 Correct 221 ms 7024 KB Output is correct
41 Correct 308 ms 7404 KB Output is correct
42 Correct 360 ms 7360 KB Output is correct
43 Correct 256 ms 7492 KB Output is correct
44 Correct 146 ms 7268 KB Output is correct
45 Correct 395 ms 8144 KB Output is correct
46 Correct 193 ms 7404 KB Output is correct
47 Correct 200 ms 7404 KB Output is correct
48 Correct 274 ms 7400 KB Output is correct
49 Correct 351 ms 7492 KB Output is correct
50 Correct 264 ms 7148 KB Output is correct
51 Correct 255 ms 7272 KB Output is correct
52 Correct 320 ms 7400 KB Output is correct
53 Correct 222 ms 6772 KB Output is correct
54 Correct 274 ms 7380 KB Output is correct
55 Correct 305 ms 7400 KB Output is correct
56 Correct 354 ms 7376 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Correct 2 ms 3456 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 2 ms 3456 KB Output is correct
9 Correct 2 ms 3456 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3456 KB Output is correct
12 Correct 3 ms 3432 KB Output is correct
13 Correct 3 ms 3456 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 3 ms 3456 KB Output is correct
18 Correct 3 ms 3456 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 2 ms 3456 KB Output is correct
21 Correct 2 ms 3456 KB Output is correct
22 Correct 2 ms 3456 KB Output is correct
23 Correct 2 ms 3456 KB Output is correct
24 Correct 3 ms 3456 KB Output is correct
25 Correct 2 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 2 ms 3456 KB Output is correct
28 Correct 2 ms 3456 KB Output is correct
29 Correct 3 ms 3456 KB Output is correct
30 Correct 4 ms 3456 KB Output is correct
31 Correct 4 ms 3456 KB Output is correct
32 Correct 5 ms 3456 KB Output is correct
33 Correct 3 ms 3456 KB Output is correct
34 Correct 4 ms 3456 KB Output is correct
35 Correct 4 ms 3456 KB Output is correct
36 Correct 4 ms 3456 KB Output is correct
37 Correct 5 ms 3456 KB Output is correct
38 Correct 3 ms 3456 KB Output is correct
39 Correct 4 ms 3456 KB Output is correct
40 Correct 4 ms 3456 KB Output is correct
41 Correct 4 ms 3456 KB Output is correct
42 Correct 4 ms 3456 KB Output is correct
43 Correct 4 ms 3456 KB Output is correct
44 Correct 5 ms 3456 KB Output is correct
45 Correct 4 ms 3456 KB Output is correct
46 Correct 5 ms 3456 KB Output is correct
47 Correct 4 ms 3456 KB Output is correct
48 Correct 4 ms 3456 KB Output is correct
49 Correct 4 ms 3456 KB Output is correct
50 Correct 6 ms 3456 KB Output is correct
51 Correct 4 ms 3456 KB Output is correct
52 Correct 4 ms 3456 KB Output is correct
53 Correct 4 ms 3456 KB Output is correct
54 Correct 4 ms 3456 KB Output is correct
55 Correct 193 ms 6768 KB Output is correct
56 Correct 98 ms 9712 KB Output is correct
57 Correct 192 ms 9828 KB Output is correct
58 Correct 155 ms 8940 KB Output is correct
59 Correct 229 ms 8808 KB Output is correct
60 Correct 293 ms 9108 KB Output is correct
61 Correct 231 ms 8852 KB Output is correct
62 Correct 283 ms 9192 KB Output is correct
63 Correct 172 ms 8432 KB Output is correct
64 Correct 245 ms 9064 KB Output is correct
65 Correct 300 ms 9320 KB Output is correct

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Correct 2 ms 3456 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3456 KB Output is correct
7 Correct 3 ms 3456 KB Output is correct
8 Correct 2 ms 3456 KB Output is correct
9 Correct 2 ms 3456 KB Output is correct
10 Correct 2 ms 3456 KB Output is correct
11 Correct 2 ms 3456 KB Output is correct
12 Correct 3 ms 3432 KB Output is correct
13 Correct 3 ms 3456 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 3 ms 3456 KB Output is correct
18 Correct 3 ms 3456 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 2 ms 3456 KB Output is correct
21 Correct 2 ms 3456 KB Output is correct
22 Correct 2 ms 3456 KB Output is correct
23 Correct 2 ms 3456 KB Output is correct
24 Correct 3 ms 3456 KB Output is correct
25 Correct 2 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 2 ms 3456 KB Output is correct
28 Correct 2 ms 3456 KB Output is correct
29 Correct 3 ms 3456 KB Output is correct
30 Correct 4 ms 3456 KB Output is correct
31 Correct 4 ms 3456 KB Output is correct
32 Correct 5 ms 3456 KB Output is correct
33 Correct 3 ms 3456 KB Output is correct
34 Correct 4 ms 3456 KB Output is correct
35 Correct 4 ms 3456 KB Output is correct
36 Correct 4 ms 3456 KB Output is correct
37 Correct 5 ms 3456 KB Output is correct
38 Correct 3 ms 3456 KB Output is correct
39 Correct 4 ms 3456 KB Output is correct
40 Correct 4 ms 3456 KB Output is correct
41 Correct 4 ms 3456 KB Output is correct
42 Correct 4 ms 3456 KB Output is correct
43 Correct 4 ms 3456 KB Output is correct
44 Correct 5 ms 3456 KB Output is correct
45 Correct 4 ms 3456 KB Output is correct
46 Correct 5 ms 3456 KB Output is correct
47 Correct 4 ms 3456 KB Output is correct
48 Correct 4 ms 3456 KB Output is correct
49 Correct 4 ms 3456 KB Output is correct
50 Correct 6 ms 3456 KB Output is correct
51 Correct 4 ms 3456 KB Output is correct
52 Correct 4 ms 3456 KB Output is correct
53 Correct 4 ms 3456 KB Output is correct
54 Correct 4 ms 3456 KB Output is correct
55 Correct 240 ms 7400 KB Output is correct
56 Correct 136 ms 7396 KB Output is correct
57 Correct 221 ms 8040 KB Output is correct
58 Correct 199 ms 7400 KB Output is correct
59 Correct 206 ms 7400 KB Output is correct
60 Correct 219 ms 7148 KB Output is correct
61 Correct 255 ms 7404 KB Output is correct
62 Correct 357 ms 7528 KB Output is correct
63 Correct 254 ms 7272 KB Output is correct
64 Correct 300 ms 7400 KB Output is correct
65 Correct 211 ms 6772 KB Output is correct
66 Correct 221 ms 7024 KB Output is correct
67 Correct 308 ms 7404 KB Output is correct
68 Correct 360 ms 7360 KB Output is correct
69 Correct 256 ms 7492 KB Output is correct
70 Correct 146 ms 7268 KB Output is correct
71 Correct 395 ms 8144 KB Output is correct
72 Correct 193 ms 7404 KB Output is correct
73 Correct 200 ms 7404 KB Output is correct
74 Correct 274 ms 7400 KB Output is correct
75 Correct 351 ms 7492 KB Output is correct
76 Correct 264 ms 7148 KB Output is correct
77 Correct 255 ms 7272 KB Output is correct
78 Correct 320 ms 7400 KB Output is correct
79 Correct 222 ms 6772 KB Output is correct
80 Correct 274 ms 7380 KB Output is correct
81 Correct 305 ms 7400 KB Output is correct
82 Correct 354 ms 7376 KB Output is correct
83 Correct 193 ms 6768 KB Output is correct
84 Correct 98 ms 9712 KB Output is correct
85 Correct 192 ms 9828 KB Output is correct
86 Correct 155 ms 8940 KB Output is correct
87 Correct 229 ms 8808 KB Output is correct
88 Correct 293 ms 9108 KB Output is correct
89 Correct 231 ms 8852 KB Output is correct
90 Correct 283 ms 9192 KB Output is correct
91 Correct 172 ms 8432 KB Output is correct
92 Correct 245 ms 9064 KB Output is correct
93 Correct 300 ms 9320 KB Output is correct
94 Correct 283 ms 12248 KB Output is correct
95 Correct 363 ms 13156 KB Output is correct
96 Correct 453 ms 8036 KB Output is correct
97 Correct 237 ms 7424 KB Output is correct
98 Correct 224 ms 7404 KB Output is correct
99 Correct 286 ms 7280 KB Output is correct
100 Correct 327 ms 7528 KB Output is correct
101 Correct 255 ms 7240 KB Output is correct
102 Correct 296 ms 7452 KB Output is correct
103 Correct 332 ms 7540 KB Output is correct
104 Correct 245 ms 7024 KB Output is correct
105 Correct 303 ms 7400 KB Output is correct
106 Correct 361 ms 7408 KB Output is correct
107 Correct 190 ms 8164 KB Output is correct
108 Correct 251 ms 7528 KB Output is correct
109 Correct 249 ms 7404 KB Output is correct
110 Correct 247 ms 7400 KB Output is correct
111 Correct 255 ms 7400 KB Output is correct
112 Correct 276 ms 7464 KB Output is correct
113 Correct 259 ms 7276 KB Output is correct
114 Correct 260 ms 7400 KB Output is correct
115 Correct 264 ms 7404 KB Output is correct
116 Correct 275 ms 7336 KB Output is correct