QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#720056#9570. Binary Treeucup-team5217AC ✓272ms17372kbC++232.5kb2024-11-07 10:27:052024-11-07 10:27:06

Judging History

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

  • [2024-11-07 10:27:06]
  • 评测
  • 测评结果：AC
  • 用时：272ms
  • 内存：17372kb
查看
  • [2024-11-07 10:27:05]
  • 提交

answer

/**
 * @file 9570.cpp
 * @author Macesuted ([email protected])
 * @date 2024-11-06
 *
 * @copyright Copyright (c) 2024
 *
 */

#include <bits/stdc++.h>
using namespace std;

bool mem1;

typedef pair<int, int> pii;

vector<bool> ban;
vector<int> siz;
vector<vector<int>> graph;

int lim;
int query(int x, int y) {
    assert(lim--);
    cout << "? " << x << ' ' << y << endl;
    int ret;
    cin >> ret;
    return ret;
}

void getSiz(int p, int fa = -1) {
    siz[p] = 1;
    for (auto i : graph[p])
        if (i != fa && !ban[i]) getSiz(i, p), siz[p] += siz[i];
    return;
}
pii fndRoot(int p, int n, int fa = -1) {
    pii cur = {n - siz[p], p}, ans = {n, 0};
    for (auto i : graph[p])
        if (i != fa && !ban[i]) cur.first = max(cur.first, siz[i]), ans = min(ans, fndRoot(i, n, p));
    return min(ans, cur);
}

int solve(int p) {
    getSiz(p), p = fndRoot(p, siz[p]).second;

    vector<int> neigh;
    for (auto i : graph[p])
        if (!ban[i]) neigh.push_back(i);

    if (neigh.empty()) return p;
    if (neigh.size() == 1) return query(p, neigh[0]) == 0 ? p : neigh[0];
    if (neigh.size() == 2) {
        int ret = query(neigh[0], neigh[1]);
        if (ret == 0) return ban[p] = true, solve(neigh[0]);
        if (ret == 2) return ban[p] = true, solve(neigh[1]);
        return p;
    }
    getSiz(p);

    sort(neigh.begin(), neigh.end(), [&](int a, int b) { return siz[a] > siz[b]; });
    int ret = query(neigh[0], neigh[1]);
    if (ret == 0) return ban[p] = true, solve(neigh[0]);
    if (ret == 2) return ban[p] = true, solve(neigh[1]);
    return ban[neigh[0]] = ban[neigh[1]] = true, solve(p);
}

void solve(void) {
    int n;
    cin >> n;

    lim = 1;
    while (1 << (lim + 1) <= n) lim++;

    ban.clear(), ban.resize(n + 1);
    siz.clear(), siz.resize(n + 1);
    graph.clear(), graph.resize(n + 1);

    for (int i = 1, cl, cr; i <= n; i++) {
        cin >> cl >> cr;
        if (cl) graph[i].push_back(cl), graph[cl].push_back(i);
        if (cr) graph[i].push_back(cr), graph[cr].push_back(i);
    }
    int ans = solve(1);
    cout << "! " << ans << endl;
    return;
}

bool mem2;

int main() {
    ios::sync_with_stdio(false);
#ifdef LOCAL
    cerr << "Memory Cost: " << abs(&mem1 - &mem2) / 1024. / 1024. << "MB" << endl;
#endif

    int _ = 1;
    cin >> _;
    while (_--) solve();

#ifdef LOCAL
    cerr << "Time Cost: " << clock() * 1000. / CLOCKS_PER_SEC << "MS" << endl;
#endif
    return 0;
}
源文件, 语言: C++23

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3596kb

input:

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

output:

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

result:

ok OK (2 test cases)

Test #2:

score: 0
Accepted
time: 101ms
memory: 4200kb

input:

5555
8
2 0
8 6
0 0
3 0
0 0
7 0
0 0
5 4
0
2
0
8
0 0
1 4
2 0
0 0
7 8
0 0
3 0
6 0
2
2
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
0
8
0 0
0 0
5 6
0 0
1 4
2 0
3 8
0 0
0
2
5
3 0
5 1
0 0
0 0
4 0
0
0
5
5 0
0 0
0 0
3 0
2 4
1
2
3
3 0
1 0
0 0
2
2
2 0
0 0
2
3
2 3
0 0
0 0
2
10
2 8
9 7
0 0
...

output:

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

result:

ok OK (5555 test cases)

Test #3:

score: 0
Accepted
time: 64ms
memory: 3960kb

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
2
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
2
2
2
9
7 0
4 0
2 0
1 0
0 0
8 0
9 0
5 0
6 0
2
0
0
10
9 0
6 0
8 0
7 0
0 0
10 0
2 0
4 0
5 0
1 0
0
2
2
11
2 0
10 0
6 0
9 0
0 ...

output:

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

result:

ok OK (600 test cases)

Test #4:

score: 0
Accepted
time: 131ms
memory: 17372kb

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
? 36882 98065
? 17626 87676
? 23816 44703
? 44123 980
? 61196 90504
? 47486 72990
? 14909 5170
? 76280 83317
? 55260 85321
? 93423 52047
? 99419 73829
? 38731 45673
? 20146 99788
? 52589 75058
? 75058 99419
! 99419
? 46352 44110
? 47168 63067
? 94632 84556
? 28594 32192
? 65119 94765
?...

result:

ok OK (2 test cases)

Test #5:

score: 0
Accepted
time: 76ms
memory: 10524kb

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:

? 1 3
! 2
? 5 1
? 1 4
! 4
? 6 9
? 7 3
? 7 10
! 7
? 13 29
? 17 18
? 1 24
? 1 17
! 17
? 37 8
? 30 14
? 55 56
? 22 19
? 19 56
! 31
? 36 89
? 96 110
? 20 79
? 62 106
? 82 86
? 61 82
! 82
? 64 233
? 148 51
? 1 176
? 126 78
? 251 252
? 200 224
? 176 200
! 176
? 439 48
? 144 457
? 376 142
? 193 427
? 173 2...

result:

ok OK (15 test cases)

Test #6:

score: 0
Accepted
time: 75ms
memory: 10252kb

input:

16
2
2 0
0 0
2
4
4 0
3 0
1 0
0 0
2
2
8
5 0
0 0
4 0
8 0
2 0
3 0
6 0
1 0
2
0
0
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
2
0
2
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:

? 1 2
! 2
? 4 3
? 2 3
! 3
? 3 8
? 5 8
? 2 5
! 2
? 1 11
? 14 8
? 11 10
? 10 14
! 10
? 13 16
? 19 29
? 25 24
? 26 25
? 26 29
! 26
? 3 60
? 49 41
? 59 55
? 28 22
? 55 34
? 28 34
! 28
? 80 113
? 97 61
? 42 30
? 117 83
? 55 91
? 91 71
? 42 71
! 42
? 3 106
? 116 254
? 17 170
? 107 228
? 210 97
? 84 75
? 7...

result:

ok OK (16 test cases)

Test #7:

score: 0
Accepted
time: 72ms
memory: 10772kb

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
2
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
2
0
0
2
62
24 0
22 0
18 0
17 0
49 0
53 0
3...

output:

? 1 2
! 2
? 5 2
? 6 5
! 5
? 5 14
? 12 6
? 14 12
! 9
? 20 27
? 2 13
? 18 17
? 11 18
! 18
? 10 60
? 9 2
? 36 34
? 24 47
? 47 9
! 52
? 9 94
? 59 69
? 17 52
? 111 44
? 46 51
? 52 51
! 52
? 204 159
? 47 235
? 109 158
? 46 171
? 140 131
? 78 195
? 46 195
! 195
? 359 209
? 137 139
? 71 459
? 289 474
? 183 ...

result:

ok OK (15 test cases)

Test #8:

score: 0
Accepted
time: 41ms
memory: 3724kb

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
2
2
5
0 0
3 1
4 5
0 0
0 0
0
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
2
0
8
0 0
3 7
1 0
2 5
6 8
0 0
0 0
0 0
0
1
2
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
0
11
0 0
4 9
5 8
6 3
0 0...

output:

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

result:

ok OK (600 test cases)

Test #9:

score: 0
Accepted
time: 101ms
memory: 9572kb

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: 57ms
memory: 7180kb

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: 59ms
memory: 7048kb

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
1
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
1
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
? 8 1
? 6 4
? 7 8
! 8
? 16 15
? 16 8
? 3 9
? 12 16
! 12
? 32 3
? 22 21
? 23 14
? 6 9
! 6
? 37 58
? 19 40
? 63 55
? 4 18
? 41 51
! 51
? 92 13
? 92 57
? 80 102
? 22 52
? 74 99
? 31 2
! 2
? 245 3
? 245 223
? 150 131
? 242 88
? 151 179
? 73 83
? 14 85
! 73
? 81 324
? 36 227
? 5...

result:

ok OK (16 test cases)

Test #12:

score: 0
Accepted
time: 58ms
memory: 7040kb

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
? 2 6
? 2 3
! 3
? 14 6
? 3 4
? 5 11
! 3
? 28 2
? 23 26
? 18 6
? 8 10
! 10
? 61 36
? 18 30
? 31 50
? 10 51
? 42 44
! 44
? 125 53
? 17 123
? 15 5
? 10 84
? 109 99
? 1 11
! 11
? 253 196
? 42 224
? 178 31
? 218 103
? 80 86
? 8 239
? 234 2
! 2
? 284 376
? 30 32
? 22 406
? 231 379
? 464 168
? 35...

result:

ok OK (15 test cases)

Test #13:

score: 0
Accepted
time: 28ms
memory: 3964kb

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
2
2
5
2 5
0 0
0 0
0 0
4 3
0
0
6
6 4
0 0
0 0
3 0
2 1
0 0
0
2
7
0 0
0 0
2 4
5 6
0 0
0 0
1 3
0
0
8
2 7
0 0
6 0
0 0
8 3
0 0
4 5
0 0
0
2
2
9
5 2
0 0
7 4
6 8
0 0
0 0
0 0
9 1
0 0
0
2
2
10
3 5
10 7
0 0
0 0
6 2
0 0
4 0
9 1
0 0
0 0
2
2
2
11
9 6
4 1
0 0
0 0
11 ...

output:

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

result:

ok OK (600 test cases)

Test #14:

score: 0
Accepted
time: 117ms
memory: 13948kb

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
? 74496 96975
? 90932 266
? 99552 77780
? 12293 24315
? 92277 15485
? 58185 80836
? 16504 24284
? 97978 28909
? 24315 97978
? 23035 97978
! 23035
? 70265 86513
? 30583 6109
? 26639 74855
? 82870 83080
? 44869 39637
? 3...

result:

ok OK (2 test cases)

Test #15:

score: 0
Accepted
time: 73ms
memory: 8484kb

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: 67ms
memory: 8988kb

input:

16
2
0 0
1 0
2
4
0 0
1 0
4 2
0 0
2
2
8
0 0
0 0
0 0
3 5
8 6
2 0
1 4
0 0
0
2
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
2
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
? 1 3
? 3 4
! 4
? 5 7
? 8 6
? 2 6
! 6
? 8 4
? 16 8
? 3 16
? 6 16
! 6
? 11 17
? 12 4
? 31 12
? 29 31
? 24 31
! 24
? 56 43
? 19 25
? 55 36
? 51 19
? 21 55
? 50 55
! 50
? 38 43
? 66 19
? 105 12
? 83 63
? 114 83
? 98 114
? 44 114
! 114
? 133 170
? 75 121
? 72 114
? 247 250
? 30 169
? 176 247
?...

result:

ok OK (16 test cases)

Test #17:

score: 0
Accepted
time: 73ms
memory: 9352kb

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
? 2 6
? 4 6
! 4
? 14 11
? 11 13
? 4 11
! 4
? 8 20
? 9 1
? 1 8
? 1 29
! 29
? 42 59
? 12 31
? 19 40
? 12 40
? 40 47
! 47
? 40 17
? 11 102
? 27 88
? 3 93
? 93 27
? 89 93
! 93
? 90 189
? 158 221
? 198 132
? 32 240
? 4 49
? 49 240
? 1 49
! 1
? 60 192
? 29 303
? 190 312
? 241 495
? 35 402
? 71 2...

result:

ok OK (15 test cases)

Test #18:

score: 0
Accepted
time: 121ms
memory: 9360kb

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: 272ms
memory: 3624kb

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 繁體中文 简体中文

伺服器時間: 2025-01-20 18:23:11 | 開源專案