QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#769453#9570. Binary TreezsddsAC ✓224ms17052kbC++142.4kb2024-11-21 17:43:332024-11-21 17:43:38

Judging History

你现在查看的是最新测评结果

  • [2024-11-21 17:43:38]
  • 评测
  • 测评结果：AC
  • 用时：224ms
  • 内存：17052kb
查看
  • [2024-11-21 17:43:33]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define db double
#define fi first
#define se second
#define pb push_back
using namespace std;

ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
    return x * f;
}

ll gcd(ll x, ll y) {return y ? gcd(y, x % y) : x;}

ll rt, ct, fg[200010], zx,  fa[200010];
ll n, sn[2][200010], siz[200010], num;

void dfs(int u) {
    siz[u] = 1; int flag = 0;
    for(int i = 0; i < 2; i++) {
        if(!sn[i][u] || fg[sn[i][u]]) continue;
        dfs(sn[i][u]); siz[u] += siz[sn[i][u]];
        if(siz[sn[i][u]] > ct / 2) flag = 1;
    }
    if(ct - siz[u] > ct / 2) flag = 1;
    //printf("%d %d %lld\n", u, flag, siz[u]);
    if(!flag) zx = u;
}

int T;
struct node {int u, siz;}q[5];
ll tip;

void solve() {
    n = read(); ct = n; rt = 1; num = 0;
    for(int i = 1; i <= n; i++) fa[i] = siz[i] = fg[i] = 0;
    for(int i = 1; i <= n; i++) {
        sn[0][i] = read(), sn[1][i] = read();
        fa[sn[0][i]] = fa[sn[1][i]] = i;
    }
    for(int i = 1; i <= n; i++) if(!fa[i]) rt = i;
    while(ct > 1) {
        dfs(rt); int ck; tip = 0;
        if(fa[zx] && !fg[fa[zx]]) q[++tip].u = fa[zx], q[tip].siz = siz[rt] - siz[zx]; 
        if(sn[0][zx] && !fg[sn[0][zx]]) q[++tip].u = sn[0][zx], q[tip].siz = siz[sn[0][zx]];
        if(sn[1][zx] && !fg[sn[1][zx]]) q[++tip].u = sn[1][zx], q[tip].siz = siz[sn[1][zx]];
        if(tip == 1) q[++tip].u = zx, q[tip].siz = 1;
        sort(q + 1, q + 1 + tip, [](node a, node b) {return a.siz > b.siz;});
        printf("? %d %d\n", q[1].u, q[2].u); fflush(stdout); ck = read();
        if(ck == 1) {
            if(q[1].u == fa[zx] || q[2].u == fa[zx]) {
                rt = zx; fg[q[1].u] = fg[q[2].u] = 1;
                ct -= q[1].siz + q[2].siz; continue;
            }
            fg[q[1].u] = fg[q[2].u] = 1; ct -= siz[q[1].u] + siz[q[2].u]; continue;
        }
        if(ck == 2) swap(q[1], q[2]);
        if(ct == 2) {printf("! %d\n", q[1].u); break;}
        if(q[1].u == fa[zx]) {fg[zx] = 1; ct -= siz[zx]; continue;}
        rt = q[1].u; ct = q[1].siz; fg[fa[rt]] = 1;
    }
    if(ct == 1) printf("! %lld\n", rt);
    fflush(stdout);
}

int main() {
    T = read();
    for(int i = 1; i <= T; i++) solve();
    return 0;
}
/*
2
7
2 0
3 4
5 6
0 0
7 0
0 0
0 0
*/
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 10032kb

input:

2
5
0 0
1 5
2 4
0 0
0 0
1
0
2
0 2
0 0
2

output:

? 3 1
? 5 2
! 5
? 2 1
! 1

result:

ok OK (2 test cases)

Test #2:

score: 0
Accepted
time: 25ms
memory: 10076kb

input:

5555
8
2 0
8 6
0 0
3 0
0 0
7 0
0 0
5 4
0
0
2
8
0 0
1 4
2 0
0 0
7 8
0 0
3 0
6 0
0
1
0
8
5 8
0 0
1 7
0 0
0 0
4 2
0 0
6 0
0
1
2
5
4 5
3 1
0 0
0 0
0 0
0
2
8
0 0
0 0
5 6
0 0
1 4
2 0
3 8
0 0
0
0
5
3 0
5 1
0 0
0 0
4 0
0
2
5
5 0
0 0
0 0
3 0
2 4
0
0
3
3 0
1 0
0 0
2
2
2 0
0 0
0
3
2 3
0 0
0 0
2
10
2 8
9 7
0 0
...

output:

? 8 6
? 4 5
? 3 4
! 4
? 3 5
? 3 1
? 4 2
! 4
? 8 3
? 8 4
? 2 6
! 6
? 2 4
? 3 2
! 2
? 5 7
? 1 4
! 1
? 5 1
? 4 5
! 5
? 4 1
? 3 4
! 3
? 2 3
! 3
? 2 1
! 2
? 2 3
! 3
? 7 1
? 7 4
? 3 6
! 6
? 2 1
! 2
? 5 9
? 5 4
? 8 3
! 8
? 10 3
? 8 6
? 2 4
! 2
? 9 3
? 9 1
? 7 2
! 7
? 1 2
! 2
? 4 3
? 7 1
! 1
? 4 9
? 8 4
? 3...

result:

ok OK (5555 test cases)

Test #3:

score: 0
Accepted
time: 21ms
memory: 10028kb

input:

600
2
2 0
0 0
2
3
2 0
3 0
0 0
2
4
4 0
1 0
0 0
3 0
0
0
5
4 0
0 0
1 0
2 0
3 0
2
0
6
4 0
6 0
2 0
5 0
0 0
1 0
0
0
7
7 0
3 0
6 0
5 0
2 0
1 0
0 0
0
1
8
7 0
0 0
2 0
8 0
1 0
5 0
3 0
6 0
0
0
0
9
7 0
4 0
2 0
1 0
0 0
8 0
9 0
5 0
6 0
2
0
2
10
9 0
6 0
8 0
7 0
0 0
10 0
2 0
4 0
5 0
1 0
0
0
2
11
2 0
10 0
6 0
9 0
0 ...

output:

? 2 1
! 1
? 1 3
! 3
? 4 2
? 3 4
! 3
? 3 4
? 2 4
! 2
? 1 2
? 1 5
! 1
? 2 6
? 4 2
! 5
? 1 6
? 3 1
? 2 3
! 2
? 1 9
? 8 9
? 5 8
! 8
? 6 7
? 10 9
? 10 6
! 6
? 9 2
? 10 6
? 5 6
! 6
? 9 2
? 10 1
? 10 5
! 10
? 2 3
? 13 6
? 13 2
! 9
? 4 13
? 1 6
? 4 1
! 1
? 14 2
? 4 7
? 7 6
! 6
? 1 15
? 2 6
? 7 2
? 9 7
! 9
?...

result:

ok OK (600 test cases)

Test #4:

score: 0
Accepted
time: 45ms
memory: 17052kb

input:

2
99999
21832 0
77205 0
62668 0
58313 0
14640 0
76941 0
62678 0
8464 0
43145 0
26195 0
46140 0
83205 0
40047 0
81645 0
27077 0
92036 0
14236 0
3576 0
15430 0
75654 0
29049 0
62218 0
83318 0
1116 0
77861 0
9755 0
49236 0
70959 0
62295 0
33580 0
88208 0
55840 0
71061 0
24695 0
88831 0
1891 0
57285 0
9...

output:

? 70790 43991
? 98065 36882
? 44312 89400
? 59529 53895
? 65419 5852
? 82041 14311
? 90087 47722
? 45190 18514
? 7166 97549
? 74597 3775
? 21857 21630
? 92329 75156
? 10672 25297
? 20974 29165
? 26030 75800
? 26030 21857
! 21857
? 5676 85780
? 39704 57748
? 58489 42043
? 30188 50842
? 36012 24131
? ...

result:

ok OK (2 test cases)

Test #5:

score: 0
Accepted
time: 16ms
memory: 14560kb

input:

15
3
0 0
1 0
2 0
1
7
6 0
3 0
5 0
0 0
7 0
4 0
1 0
2
2
15
6 0
5 0
1 0
7 0
14 0
11 0
15 0
12 0
2 0
4 0
9 0
13 0
0 0
8 0
3 0
0
0
0
31
3 0
31 0
17 0
23 0
4 0
13 0
1 0
12 0
6 0
0 0
20 0
26 0
14 0
29 0
8 0
25 0
21 0
19 0
5 0
15 0
18 0
10 0
22 0
7 0
28 0
2 0
24 0
30 0
27 0
9 0
16 0
2
0
0
2
63
15 0
62 0
5 0
...

output:

? 3 1
! 2
? 5 1
? 1 4
! 4
? 6 9
? 7 3
? 10 7
! 10
? 13 29
? 17 18
? 24 1
? 29 24
! 24
? 37 8
? 14 30
? 38 32
? 51 13
? 13 37
! 16
? 89 36
? 6 71
? 101 116
? 64 57
? 14 59
? 116 14
! 14
? 233 64
? 68 246
? 145 28
? 40 61
? 190 230
? 69 248
? 61 69
! 61
? 48 439
? 468 437
? 322 37
? 316 202
? 57 164
?...

result:

ok OK (15 test cases)

Test #6:

score: 0
Accepted
time: 14ms
memory: 14700kb

input:

16
2
2 0
0 0
2
4
4 0
3 0
1 0
0 0
0
0
8
5 0
0 0
4 0
8 0
2 0
3 0
6 0
1 0
0
0
2
16
2 0
5 0
1 0
11 0
13 0
14 0
8 0
6 0
0 0
4 0
3 0
7 0
15 0
10 0
16 0
9 0
0
0
0
0
32
15 0
0 0
14 0
18 0
26 0
17 0
25 0
27 0
6 0
9 0
4 0
13 0
23 0
30 0
32 0
12 0
11 0
31 0
28 0
3 0
19 0
10 0
22 0
7 0
5 0
29 0
24 0
20 0
21 0
1...

output:

? 2 1
! 1
? 1 2
? 4 1
! 4
? 8 3
? 5 8
? 2 5
! 5
? 3 4
? 13 2
? 16 13
? 9 16
! 9
? 12 30
? 11 6
? 1 18
? 32 1
? 2 32
! 32
? 60 3
? 15 63
? 52 12
? 43 58
? 47 43
? 2 47
! 2
? 80 113
? 16 115
? 63 112
? 25 50
? 81 89
? 11 81
? 114 11
! 114
? 90 113
? 248 20
? 8 130
? 58 142
? 239 182
? 192 161
? 244 19...

result:

ok OK (16 test cases)

Test #7:

score: 0
Accepted
time: 15ms
memory: 13268kb

input:

15
2
2 0
0 0
2
6
5 0
1 0
6 0
2 0
3 0
0 0
0
2
14
12 0
0 0
11 0
5 0
7 0
1 0
8 0
10 0
14 0
13 0
6 0
9 0
2 0
4 0
0
0
1
30
10 0
29 0
23 0
28 0
9 0
14 0
2 0
30 0
19 0
0 0
15 0
1 0
22 0
8 0
18 0
27 0
7 0
24 0
26 0
3 0
20 0
25 0
6 0
17 0
4 0
12 0
21 0
16 0
13 0
5 0
0
0
0
2
62
24 0
22 0
18 0
17 0
49 0
53 0
3...

output:

? 2 1
! 1
? 5 2
? 5 6
! 6
? 4 9
? 7 10
? 4 7
! 5
? 21 16
? 8 5
? 3 6
? 21 3
! 3
? 60 10
? 9 2
? 34 36
? 7 18
? 18 34
! 44
? 70 84
? 37 90
? 56 58
? 116 29
? 80 31
? 31 115
! 31
? 12 100
? 71 118
? 146 62
? 28 148
? 70 231
? 163 152
? 152 70
! 70
? 359 209
? 137 139
? 71 459
? 474 289
? 156 36
? 361 ...

result:

ok OK (15 test cases)

Test #8:

score: 0
Accepted
time: 9ms
memory: 9916kb

input:

600
2
2 0
0 0
2
3
3 2
0 0
0 0
2
4
3 0
0 0
0 0
1 2
0
0
5
0 0
3 1
4 5
0 0
0 0
1
0
6
3 5
1 4
0 0
6 0
0 0
0 0
0
0
7
3 7
0 0
0 0
2 5
0 0
1 4
0 0
0
1
8
0 0
3 7
1 0
2 5
6 8
0 0
0 0
0 0
0
0
0
9
9 8
0 0
7 2
0 0
0 0
0 0
0 0
4 5
3 6
0
1
2
10
3 6
8 0
4 2
5 7
0 0
10 9
0 0
0 0
0 0
0 0
0
1
2
11
0 0
4 9
5 8
6 3
0 0...

output:

? 2 1
! 1
? 3 2
! 2
? 1 2
? 3 1
! 3
? 2 4
? 5 3
! 5
? 1 4
? 3 5
! 3
? 1 4
? 3 7
! 1
? 2 5
? 3 7
? 1 3
! 1
? 1 3
? 1 4
? 5 8
! 8
? 1 4
? 1 10
? 9 6
! 6
? 2 6
? 2 10
? 11 9
! 9
? 1 11
? 4 1
? 8 7
! 7
? 13 7
? 9 13
? 6 5
! 9
? 12 11
? 5 10
? 4 13
! 13
? 8 14
? 2 5
? 11 6
! 6
? 15 7
? 9 11
? 14 6
? 13 1...

result:

ok OK (600 test cases)

Test #9:

score: 0
Accepted
time: 26ms
memory: 10884kb

input:

2
99999
0 0
7999 97267
75750 37659
0 0
0 0
33761 92098
90707 18838
13602 27569
0 0
0 0
0 0
0 0
0 0
0 0
0 0
14586 86647
1519 23132
0 0
3430 14643
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
47066 36968
95308 38482
34100 25297
0 0
0 0
0 0
0 0
88902 58991
0 0
0 0
66315 68538
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0...

output:

? 50379 69076
? 79924 11838
? 18079 15463
? 72017 29994
? 80147 27856
? 80763 26264
? 39876 84186
? 73287 34615
? 43462 43070
? 38721 85806
? 84940 93114
? 3443 79116
? 49016 68555
? 56289 87545
? 32426 3887
! 3887
? 72481 78976
? 96633 84675
? 2124 81852
? 13836 79494
? 80643 24965
? 38932 5573
? 5...

result:

ok OK (2 test cases)

Test #10:

score: 0
Accepted
time: 16ms
memory: 10448kb

input:

15
3
3 2
0 0
0 0
1
7
0 0
3 6
0 0
7 2
0 0
0 0
5 1
2
2
15
14 12
0 0
0 0
0 0
8 6
10 11
0 0
3 7
2 4
0 0
0 0
0 0
15 5
0 0
9 1
0
0
0
31
4 9
0 0
29 17
0 0
0 0
15 31
5 21
18 14
0 0
0 0
0 0
16 2
12 7
0 0
23 10
0 0
30 13
0 0
24 27
11 26
0 0
0 0
0 0
0 0
19 20
0 0
0 0
0 0
6 25
8 1
28 22
2
0
0
2
63
53 48
40 57
0...

output:

? 3 2
! 1
? 7 2
? 3 6
! 6
? 15 5
? 9 1
? 2 4
! 2
? 29 17
? 30 13
? 8 1
? 18 14
! 14
? 1 2
? 53 48
? 63 19
? 30 56
? 55 59
! 56
? 20 115
? 71 68
? 67 3
? 18 16
? 123 55
? 117 104
! 104
? 70 140
? 78 250
? 223 4
? 220 204
? 67 144
? 75 15
? 242 199
! 242
? 60 121
? 414 74
? 99 184
? 301 403
? 425 477
...

result:

ok OK (15 test cases)

Test #11:

score: 0
Accepted
time: 12ms
memory: 10500kb

input:

16
2
0 0
1 0
2
4
4 2
0 0
0 0
3 0
0
0
8
3 0
0 0
0 0
0 0
1 2
0 0
6 4
5 7
0
0
2
16
16 15
0 0
0 0
0 0
7 11
8 10
0 0
13 0
0 0
0 0
0 0
3 9
0 0
4 2
5 14
6 12
0
0
0
0
32
0 0
22 21
25 18
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
5 10
30 0
1 24
12 31
0 0
0 0
16 8
3 15
11 26
23 14
28 20
6 9
0 0
13 27
0 0
0 0
7 17
0 0
0 ...

output:

? 1 2
! 2
? 4 2
? 3 4
! 3
? 5 7
? 1 2
? 3 1
! 1
? 16 15
? 6 12
? 8 10
? 13 8
! 13
? 19 2
? 3 15
? 25 18
? 13 27
? 30 13
! 13
? 9 14
? 58 24
? 29 32
? 17 3
? 15 39
? 57 15
! 57
? 92 13
? 83 73
? 57 115
? 62 54
? 56 55
? 79 88
? 69 79
! 69
? 245 3
? 218 134
? 223 108
? 47 234
? 119 200
? 90 69
? 135 2...

result:

ok OK (16 test cases)

Test #12:

score: 0
Accepted
time: 7ms
memory: 10548kb

input:

15
2
0 0
1 0
2
6
6 4
1 5
0 0
0 0
3 0
0 0
0
2
14
0 0
1 7
5 11
13 9
0 0
2 8
0 0
10 0
0 0
0 0
0 0
14 6
0 0
3 4
0
0
1
30
7 0
5 13
0 0
0 0
14 30
15 20
0 0
0 0
3 19
0 0
0 0
11 21
9 1
16 24
0 0
0 0
28 2
8 10
0 0
0 0
0 0
0 0
18 6
0 0
4 29
12 25
0 0
23 26
0 0
27 22
0
0
0
2
62
0 0
0 0
28 47
7 38
0 0
0 0
17 26...

output:

? 1 2
! 2
? 1 5
? 6 4
! 4
? 14 6
? 3 4
? 5 11
! 3
? 28 2
? 23 26
? 18 6
? 8 10
! 10
? 16 57
? 36 43
? 12 4
? 22 15
? 11 53
! 15
? 18 44
? 53 93
? 51 69
? 28 20
? 7 27
? 39 94
! 39
? 253 196
? 42 224
? 178 31
? 58 6
? 14 64
? 57 160
? 148 207
! 207
? 284 376
? 30 32
? 22 406
? 231 379
? 464 168
? 403...

result:

ok OK (15 test cases)

Test #13:

score: 0
Accepted
time: 15ms
memory: 7892kb

input:

600
2
0 0
1 0
2
3
0 0
1 3
0 0
2
4
2 4
0 0
0 0
3 0
0
0
5
2 5
0 0
0 0
0 0
4 3
1
0
6
6 4
0 0
0 0
3 0
2 1
0 0
0
0
7
0 0
0 0
2 4
5 6
0 0
0 0
1 3
0
1
8
2 7
0 0
6 0
0 0
8 3
0 0
4 5
0 0
0
0
0
9
5 2
0 0
7 4
6 8
0 0
0 0
0 0
9 1
0 0
0
0
2
10
3 5
10 7
0 0
0 0
6 2
0 0
4 0
9 1
0 0
0 0
2
0
0
11
9 6
4 1
0 0
0 0
11 ...

output:

? 1 2
! 2
? 1 3
! 3
? 4 2
? 3 4
! 3
? 1 4
? 3 5
! 3
? 5 4
? 2 5
! 2
? 4 7
? 5 6
! 4
? 5 1
? 3 8
? 6 3
! 6
? 4 1
? 4 7
? 6 4
! 4
? 1 2
? 7 10
? 4 7
! 4
? 10 1
? 10 11
? 8 5
! 5
? 4 7
? 4 8
? 3 8
! 3
? 2 4
? 12 2
? 7 12
! 12
? 12 8
? 14 12
? 2 12
! 12
? 14 9
? 1 14
? 11 15
! 15
? 1 6
? 3 1
? 16 11
? 8...

result:

ok OK (600 test cases)

Test #14:

score: 0
Accepted
time: 27ms
memory: 13860kb

input:

2
99999
96748 53986
34197 77552
29863 63559
79099 26449
45078 1051
0 0
27416 4135
0 0
38606 81189
93892 68603
48776 185
79602 18311
51243 83678
89044 40032
28883 35663
0 0
0 0
21603 15821
0 0
51448 75971
70275 8326
0 0
0 0
57049 72937
3297 94939
0 0
59258 39159
3205 34675
54876 24769
0 0
0 0
0 0
851...

output:

? 71188 96970
? 87538 6820
? 59029 32876
? 46360 20365
? 49372 9490
? 51870 93805
? 96975 74496
? 50053 87346
? 22841 44535
? 62765 6517
? 35799 93268
? 66059 91247
? 3600 4653
? 33733 73850
? 33733 22841
? 60354 22841
! 60354
? 50499 6749
? 42167 37781
? 96466 36486
? 37783 33496
? 28303 48920
? 60...

result:

ok OK (2 test cases)

Test #15:

score: 0
Accepted
time: 16ms
memory: 12540kb

input:

15
3
0 0
1 3
0 0
1
7
0 0
1 7
0 0
6 2
3 4
0 0
0 0
0
1
15
2 11
0 0
13 1
12 14
0 0
0 0
5 8
10 4
0 0
0 0
0 0
0 0
0 0
6 15
9 3
0
0
1
31
24 22
0 0
31 6
0 0
4 3
11 19
0 0
0 0
28 21
25 20
0 0
0 0
0 0
2 16
0 0
27 18
8 10
15 17
26 1
23 29
7 5
12 14
0 0
0 0
0 0
0 0
0 0
0 0
30 13
0 0
0 0
0
0
0
0
63
51 35
33 57
...

output:

? 1 3
! 2
? 2 5
? 1 7
! 2
? 15 4
? 1 15
? 2 11
! 1
? 14 1
? 10 18
? 29 10
? 30 13
! 30
? 38 44
? 42 1
? 2 9
? 34 2
? 5 23
! 23
? 51 31
? 96 62
? 100 8
? 52 89
? 82 52
? 70 57
! 70
? 124 122
? 162 102
? 84 231
? 110 135
? 147 223
? 236 147
? 201 80
! 80
? 322 266
? 146 414
? 72 335
? 66 306
? 89 76
?...

result:

ok OK (15 test cases)

Test #16:

score: 0
Accepted
time: 18ms
memory: 12516kb

input:

16
2
0 0
1 0
2
4
0 0
1 0
4 2
0 0
0
0
8
0 0
0 0
0 0
3 5
8 6
2 0
1 4
0 0
0
0
2
16
0 0
7 8
0 0
1 2
0 0
0 0
0 0
5 10
3 0
12 16
14 13
0 0
15 4
0 0
0 0
6 9
0
0
0
0
32
26 17
5 31
28 25
18 7
0 0
0 0
14 12
15 0
22 4
0 0
29 1
19 2
0 0
0 0
0 0
6 8
10 21
0 0
0 0
0 0
13 3
0 0
0 0
0 0
32 30
0 0
20 9
0 0
0 0
23 16...

output:

? 1 2
! 2
? 2 4
? 1 2
! 1
? 5 7
? 6 8
? 2 6
! 6
? 8 4
? 16 8
? 9 6
? 3 9
! 3
? 1 31
? 25 21
? 16 25
? 8 6
? 15 8
! 8
? 56 43
? 11 18
? 52 47
? 17 52
? 1 44
? 38 1
! 38
? 24 37
? 55 56
? 61 25
? 115 10
? 85 115
? 120 27
? 21 120
! 21
? 133 170
? 44 184
? 43 58
? 206 235
? 27 19
? 221 27
? 168 181
? 1...

result:

ok OK (16 test cases)

Test #17:

score: 0
Accepted
time: 18ms
memory: 11244kb

input:

15
2
0 0
1 0
2
6
0 0
5 0
1 2
0 0
0 0
4 3
2
0
14
8 14
0 0
0 0
0 0
0 0
12 11
10 0
0 0
2 7
0 0
4 1
0 0
3 6
5 9
2
0
0
30
29 21
6 9
0 0
0 0
0 0
0 0
0 0
19 17
24 30
0 0
14 26
23 0
0 0
0 0
25 18
0 0
7 20
16 12
0 0
13 11
28 8
10 15
0 0
0 0
0 0
3 22
5 2
0 0
0 0
4 1
0
2
0
2
62
0 0
34 33
0 0
0 0
0 0
37 45
0 0
...

output:

? 1 2
! 2
? 6 2
? 5 2
! 5
? 11 14
? 14 7
? 5 14
! 5
? 8 20
? 9 1
? 1 8
? 29 1
! 1
? 59 42
? 2 15
? 44 51
? 51 2
? 34 2
! 2
? 40 17
? 11 102
? 88 27
? 72 111
? 111 88
? 10 111
! 111
? 189 90
? 65 224
? 229 10
? 57 98
? 16 15
? 15 67
? 13 15
! 13
? 60 192
? 29 303
? 312 190
? 118 457
? 382 143
? 275 3...

result:

ok OK (15 test cases)

Test #18:

score: 0
Accepted
time: 36ms
memory: 9760kb

input:

2
99999
0 0
88119 0
72740 0
6901 19702
0 0
10620 84889
0 0
9552 63972
45156 60768
9152 72379
0 0
59875 97207
48193 0
17282 54916
65927 27713
80083 15817
36966 75381
0 0
77279 56298
0 0
11554 61779
0 0
89976 0
65282 42151
95206 62876
97329 86772
0 0
0 0
0 0
11820 0
0 0
20432 0
50520 39907
0 0
46948 1...

output:

? 52174 35226
? 26122 16093
? 11494 10853
? 11494 91694
? 90037 73088
? 90037 21572
? 51091 91442
? 7067 93596
? 75096 14316
? 75096 55875
? 42793 41734
? 59747 42793
? 472 67072
? 59747 64770
! 92650
? 80592 36933
? 50906 68004
? 73367 65219
? 20489 33796
? 74041 19704
? 35779 74041
? 35779 85560
?...

result:

ok OK (2 test cases)

Test #19:

score: 0
Accepted
time: 224ms
memory: 9924kb

input:

100000
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
2
2
0 0
0 1
2
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
0
2
0 0
0 1
2
2
0 0
0 1
0
2
0 0...

output:

? 1 2
! 2
? 1 2
! 1
? 1 2
! 2
? 1 2
! 1
? 1 2
! 2
? 1 2
! 1
? 1 2
! 1
? 1 2
! 1
? 1 2
! 1
? 1 2
! 2
? 1 2
! 1
? 1 2
! 1
? 1 2
! 2
? 1 2
! 2
? 1 2
! 1
? 1 2
! 2
? 1 2
! 2
? 1 2
! 2
? 1 2
! 2
? 1 2
! 1
? 1 2
! 1
? 1 2
! 1
? 1 2
! 2
? 1 2
! 1
? 1 2
! 1
? 1 2
! 2
? 1 2
! 2
? 1 2
! 2
? 1 2
! 2
? 1 2
! 2
...

result:

ok OK (100000 test cases)

Extra Test:

score: 0
Extra Test Passed
English 繁體中文 简体中文

Server Time: 2025-01-20 14:53:08 | OpenSource Project