QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#728948#9570. Binary Treeucup-team112#AC ✓373ms29336kbC++205.9kb2024-11-09 16:15:372024-11-09 16:15:39

Judging History

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

  • [2024-11-09 16:15:39]
  • 评测
  • 测评结果:AC
  • 用时:373ms
  • 内存:29336kb
  • [2024-11-09 16:15:37]
  • 提交

answer

#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <random>
#include <set>
#include <type_traits>
#include <unordered_map>

using namespace std;
using ll = long long;

#define rep(i, n, m) for (ll(i) = (n); (i) < (m); (i)++)
#define rrep(i, n, m) for (ll(i) = (n); (i) > (m); (i)--)
const ll mod = 998244353;
const ll inf = 1e18;
const ll INF = 4e18 + 10;

using pll = pair<ll, ll>;

void pline(vector<int> lis) {
    rep(i, 0, lis.size()) {
        printf("%d", lis[i]);
        if (i != lis.size() - 1)
            printf(" ");
        else
            printf("\n");
    }
}

void pline(vector<ll> lis) {
    rep(i, 0, lis.size()) {
        printf("%lld", lis[i]);
        if (i != lis.size() - 1)
            printf(" ");
        else
            printf("\n");
    }
}

void pline2(vector<ll> lis) {
    rep(i, 0, lis.size()) {
        printf("%lld", lis[i]);
        if (i != lis.size() - 1)
            printf("");
        else
            printf("\n");
    }
}

void pline(vector<pair<ll, ll>> lis) {
    rep(i, 0, lis.size()) {
        printf("/%lld,%lld/", lis[i].first, lis[i].second);
        if (i != lis.size() - 1)
            printf(" ");
        else
            printf("\n");
    }
}

// 全方位1回目
void dfsA(ll v, ll p, vector<vector<ll>> &lis, vector<bool> &able, vector<ll> &csize) {
    csize[v] = 1;
    for (ll nex : lis[v]) {
        if (able[nex] && (nex != p)) {
            dfsA(nex, v, lis, able, csize);
            csize[v] += csize[nex];
        }
    }
}

// 全方位2回目
void dfsB(ll v, ll p, vector<vector<ll>> &lis, vector<bool> &able, vector<ll> &csize,
          vector<ll> &ablevs, vector<ll> &centorid) {

    ll cssum = 0;
    vector<ll> cslis;

    for (ll nex : lis[v]) {
        if (able[nex] && (nex != p)) {
            dfsB(nex, v, lis, able, csize, ablevs, centorid);
            cslis.push_back(csize[nex]);
            cssum += csize[nex];
        }
    }

    cslis.push_back(ablevs.size() - 1 - cssum);

    ll csmax = 0;
    for (ll tmp : cslis) {
        csmax = max(csmax, tmp);
    }

    if (csmax <= ablevs.size() / 2) {
        centorid.push_back(v);
    }
}

// 消去
void dfsC(ll v, ll p, vector<vector<ll>> &lis, vector<bool> &able) {
    for (ll nex : lis[v]) {
        if (able[nex] && (nex != p)) {
            dfsC(nex, v, lis, able);
        }
        able[v] = false;
    }
}

void dfsD(ll v, ll p, vector<vector<ll>> &lis, vector<bool> &able) {
    for (ll nex : lis[v]) {
        if (able[nex] && (nex != p)) {
            dfsC(nex, v, lis, able);
        }
        able[v] = false;
    }
}

int main() {

    ll TT;
    cin >> TT;

    rep(loop, 0, TT) {

        ll n;
        cin >> n;
        vector<vector<ll>> lis(n);

        rep(i, 0, n) {
            ll x, y;
            cin >> x >> y;
            x--;
            y--;

            if (x != -1) {
                lis[i].push_back(x);
                lis[x].push_back(i);
            }
            if (y != -1) {
                lis[i].push_back(y);
                lis[y].push_back(i);
            }
        }

        // 可能性がある頂点
        vector<bool> able(n, true);

        while (1) {

            // ありうる頂点
            vector<ll> ablevs(0);
            rep(v, 0, n) {
                if (able[v]) {
                    ablevs.push_back(v);
                }
            }

            if (ablevs.size() == 1) {
                cout << "! " << ablevs[0] + 1 << flush << endl;
                break;
            }

            // 重心を求める
            vector<ll> csize(n, 0);
            vector<ll> centorid(0);

            dfsA(ablevs[0], -1, lis, able, csize);
            dfsB(ablevs[0], -1, lis, able, csize, ablevs, centorid);

            if (centorid.size() == 2) {
                cout << "? " << centorid[0] + 1 << " " << centorid[1] + 1 << flush << endl;
                ll cat;
                cin >> cat;

                if (cat == 0) {
                    dfsC(centorid[1], centorid[0], lis, able);
                } else {
                    dfsC(centorid[0], centorid[1], lis, able);
                }
            } else if (centorid.size() == 1) {

                vector<pll> cvs;
                for (ll nex : lis[centorid[0]]) {
                    if (able[nex]) {
                        // ll sss = min(csize[nex], (ll)ablevs.size() - csize[centorid[0]]);
                        ll sss;
                        if (csize[nex] < csize[centorid[0]]) {
                            sss = csize[nex];
                        } else {
                            sss = (ll)ablevs.size() - csize[centorid[0]];
                        }
                        cvs.push_back(make_pair(sss, nex));
                    }
                }

                sort(cvs.begin(), cvs.end());
                reverse(cvs.begin(), cvs.end());

                cout << "? " << cvs[0].second + 1 << " " << cvs[1].second + 1 << flush << endl;
                ll cat;
                cin >> cat;

                if (cat == 0) {
                    dfsC(cvs[1].second, centorid[0], lis, able);
                    if (cvs.size() >= 3) {
                        dfsC(cvs[2].second, centorid[0], lis, able);
                    }
                    able[centorid[0]] = false;
                } else if (cat == 2) {
                    dfsC(cvs[0].second, centorid[0], lis, able);
                    if (cvs.size() >= 3) {
                        dfsC(cvs[2].second, centorid[0], lis, able);
                    }
                    able[centorid[0]] = false;
                } else {
                    dfsC(cvs[1].second, centorid[0], lis, able);
                    dfsC(cvs[0].second, centorid[0], lis, able);
                }
            }
        }
    }
}

详细

Test #1:

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

input:

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

output:

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

result:

ok OK (2 test cases)

Test #2:

score: 0
Accepted
time: 148ms
memory: 4468kb

input:

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

output:

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

result:

ok OK (5555 test cases)

Test #3:

score: 0
Accepted
time: 90ms
memory: 4000kb

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

output:

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

result:

ok OK (600 test cases)

Test #4:

score: 0
Accepted
time: 252ms
memory: 29336kb

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
? 89400 44312
? 52881 29266
? 79632 4792
? 42596 66257
? 48047 56033
? 89053 35653
? 44667 77258
? 79652 40680
? 85547 41659
? 79358 37942
? 96342 97568
? 79344 42621
? 38675 56674
? 79358 38675
! 38675
? 5676 44110
? 63067 58000
? 22352 60270
? 18353 43258
? 78056 42695
...

result:

ok OK (2 test cases)

Test #5:

score: 0
Accepted
time: 142ms
memory: 15352kb

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
? 4 1
! 1
? 9 6
? 8 5
? 13 8
! 13
? 29 13
? 16 2
? 28 9
? 28 16
! 16
? 37 8
? 30 14
? 56 55
? 60 29
? 29 14
! 47
? 89 36
? 71 6
? 54 9
? 107 91
? 45 11
? 107 45
! 45
? 233 64
? 246 68
? 239 76
? 110 34
? 194 48
? 54 13
? 68 54
! 68
? 439 48
? 457 144
? 228 4
? 386 328
? 138 5
? 431 2...

result:

ok OK (15 test cases)

Test #6:

score: 0
Accepted
time: 147ms
memory: 15532kb

input:

16
2
2 0
0 0
2
4
4 0
3 0
1 0
0 0
0
2
8
5 0
0 0
4 0
8 0
2 0
3 0
6 0
1 0
0
2
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
0
0
0
2
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
? 3 1
? 3 2
! 2
? 4 8
? 6 3
? 4 3
! 4
? 11 3
? 6 14
? 7 8
? 12 7
! 7
? 16 12
? 29 21
? 7 25
? 26 5
? 25 5
! 25
? 8 60
? 41 15
? 52 5
? 64 18
? 12 1
? 12 5
! 12
? 80 57
? 16 61
? 42 18
? 83 19
? 60 91
? 71 21
? 91 21
! 21
? 106 90
? 248 91
? 233 57
? 68 232
? 255 62
? 135 104
? 177 251
? 25...

result:

ok OK (16 test cases)

Test #7:

score: 0
Accepted
time: 138ms
memory: 16224kb

input:

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

output:

? 2 1
! 1
? 5 1
? 6 5
! 3
? 4 14
? 12 6
? 14 12
! 14
? 27 21
? 13 2
? 18 17
? 18 11
! 11
? 33 60
? 9 2
? 36 34
? 18 7
? 60 7
! 7
? 94 70
? 69 59
? 52 17
? 111 44
? 51 46
? 52 51
! 51
? 12 159
? 235 47
? 158 109
? 30 23
? 198 144
? 226 119
? 226 144
! 226
? 68 359
? 319 190
? 450 334
? 406 100
? 483 ...

result:

ok OK (15 test cases)

Test #8:

score: 0
Accepted
time: 120ms
memory: 3636kb

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

output:

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

result:

ok OK (600 test cases)

Test #9:

score: 0
Accepted
time: 200ms
memory: 11816kb

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
? 84186 39876
? 63858 37786
? 64658 8683
? 75694 66372
? 97941 76679
? 25994 9878
? 64299 62208
? 73761 58401
? 76924 21819
! 21819
? 72481 78976
? 96633 84675
? 81852 2124
? 84822 64228
? 55776 50823
? 89542 22888
?...

result:

ok OK (2 test cases)

Test #10:

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

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
? 6 3
! 3
? 15 5
? 9 1
? 4 2
! 4
? 29 17
? 30 13
? 8 1
? 18 14
! 14
? 2 1
? 57 40
? 33 11
? 60 39
? 54 51
! 39
? 115 20
? 48 45
? 127 101
? 78 29
? 100 97
? 83 80
! 80
? 140 70
? 206 196
? 152 135
? 180 95
? 187 62
? 229 8
? 153 5
! 153
? 121 60
? 305 71
? 308 106
? 473 373
? 281 129...

result:

ok OK (15 test cases)

Test #11:

score: 0
Accepted
time: 123ms
memory: 8940kb

input:

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

? 2 1
! 1
? 4 1
? 4 3
! 3
? 8 5
? 8 6
? 7 4
! 4
? 16 1
? 6 16
? 8 6
? 13 8
! 13
? 19 32
? 22 21
? 28 20
? 17 7
! 7
? 9 37
? 9 58
? 58 29
? 17 29
? 29 26
? 8 3
! 3
? 28 92
? 75 21
? 10 7
? 38 30
? 111 64
? 113 11
! 11
? 221 245
? 218 245
? 150 131
? 242 88
? 184 76
? 173 33
? 127 107
! 127
? 81 39
? ...

result:

ok OK (16 test cases)

Test #12:

score: 0
Accepted
time: 120ms
memory: 8852kb

input:

15
2
0 0
1 0
2
6
6 4
1 5
0 0
0 0
3 0
0 0
0
1
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
2
0
0
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
2
0
62
0 0
0 0
28 47
7 38
0 0
0 0
17 26...

output:

? 2 1
! 1
? 2 1
? 3 2
! 5
? 14 12
? 2 8
? 7 1
! 7
? 28 17
? 26 23
? 25 12
? 21 11
! 21
? 61 16
? 43 36
? 12 4
? 22 15
? 53 11
! 11
? 18 125
? 17 123
? 15 5
? 84 10
? 109 99
? 78 60
! 109
? 253 241
? 224 42
? 178 31
? 58 6
? 199 120
? 141 24
? 92 15
! 24
? 69 284
? 210 172
? 233 19
? 349 188
? 198 94...

result:

ok OK (15 test cases)

Test #13:

score: 0
Accepted
time: 98ms
memory: 4004kb

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

output:

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

result:

ok OK (600 test cases)

Test #14:

score: 0
Accepted
time: 219ms
memory: 22704kb

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
? 17131 51870
? 96975 74496
? 90932 10836
? 53310 42017
? 34919 33651
? 99036 185
? 20019 89442
? 33650 61576
? 81271 57161
? 81271 33650
? 51042 26473
! 51042
? 70265 50499
? 17715 42167
? 7700 96466
? 26465 54010
? 78335 12268
? 3...

result:

ok OK (2 test cases)

Test #15:

score: 0
Accepted
time: 130ms
memory: 12456kb

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:

? 3 1
! 2
? 2 5
? 7 1
! 2
? 15 4
? 1 15
? 11 2
! 1
? 14 1
? 10 18
? 29 10
? 30 13
! 30
? 38 44
? 42 1
? 2 9
? 34 2
? 23 5
! 5
? 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: 128ms
memory: 13152kb

input:

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

? 2 1
! 1
? 3 2
? 4 3
! 3
? 5 4
? 5 6
? 6 2
! 6
? 8 2
? 10 16
? 10 8
? 12 10
! 10
? 11 1
? 7 12
? 9 4
? 7 4
? 18 4
! 18
? 31 56
? 19 11
? 2 52
? 58 17
? 17 1
? 44 17
! 44
? 24 38
? 112 55
? 61 93
? 115 34
? 85 11
? 115 11
? 87 11
! 11
? 60 133
? 44 75
? 72 14
? 100 1
? 39 227
? 184 198
? 184 75
? 18...

result:

ok OK (16 test cases)

Test #17:

score: 0
Accepted
time: 124ms
memory: 14016kb

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:

? 2 1
! 1
? 6 2
? 5 2
! 5
? 14 11
? 13 11
? 13 3
! 13
? 20 8
? 26 15
? 15 12
? 25 15
! 15
? 59 42
? 15 2
? 52 16
? 16 15
? 62 15
! 15
? 40 17
? 102 11
? 119 110
? 67 15
? 119 15
? 119 35
! 35
? 189 90
? 224 65
? 185 73
? 82 42
? 18 9
? 73 9
? 124 73
! 124
? 192 60
? 285 44
? 151 36
? 443 70
? 295 22...

result:

ok OK (15 test cases)

Test #18:

score: 0
Accepted
time: 210ms
memory: 11552kb

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 96805
? 59747 42793
? 67072 472
? 64770 59747
! 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: 373ms
memory: 3644kb

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:

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

result:

ok OK (100000 test cases)

Extra Test:

score: 0
Extra Test Passed