QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#727953#9570. Binary Treeucup-team5062#AC ✓366ms21172kbC++203.0kb2024-11-09 14:14:282024-11-09 14:14:32

Judging History

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

  • [2024-11-09 14:14:32]
  • 评测
  • 测评结果：AC
  • 用时：366ms
  • 内存：21172kb
查看
  • [2024-11-09 14:14:28]
  • 提交

answer

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

int Ask(int u, int v) {
	cout << "? " << u << " " << v << endl;
	int x; cin >> x;
	return x;
}

void dfs(int pos, int pre, vector<int> &dp, vector<vector<int>> &G) {
	dp[pos] = 1;
	for (int to : G[pos]) {
		if (to == pre) continue;
		dfs(to, pos, dp, G);
		dp[pos] += dp[to];
	}
}

void GetDist(int pos, int pre, int dep, vector<int> &dst, vector<vector<int>> &G) {
	dst[pos] = dep;
	for (int to : G[pos]) {
		if (to == pre) continue;
		GetDist(to, pos, dep + 1, dst, G);
	}
}

void Solve(int N, vector<int> A, vector<int> B) {
	vector<bool> Cand(N + 1, false);
	for (int i = 1; i <= N; i++) Cand[i] = true;

	// Simulation
	while (true) {
		// Step 1. Make Graph
		vector<vector<int>> G(N + 1, vector<int>(0, 0));
		for (int i = 1; i <= N; i++) {
			if (A[i] != 0 && (Cand[A[i]] == true && Cand[i] == true)) {
				G[i].push_back(A[i]);
				G[A[i]].push_back(i);
			}
			if (B[i] != 0 && (Cand[B[i]] == true && Cand[i] == true)) {
				G[i].push_back(B[i]);
				G[B[i]].push_back(i);
			}
		}

		// Step 2. Get Cand
		int cnt = 0, root = 0; vector<int> vec;
		for (int i = 1; i <= N; i++) {
			if (Cand[i] == true) {
				cnt++;
				root = i;
				vec.push_back(i);
			}
		}
		if (cnt == 1) {
			cout << "! " << root << endl;
			return;
		}
		if (cnt == 2) {
			int x = Ask(vec[0], vec[1]);
			if (x == 0) { cout << "! " << vec[0] << endl; return; }
			if (x == 2) { cout << "! " << vec[1] << endl; return; }
		}

		// Step 3. Dynamic Programming
		vector<int> dp(N + 1, 0);
		dfs(root, -1, dp, G);

		// Step 4. Get Gravity
		int Gravity = 0;
		for (int i = 1; i <= N; i++) {
			if (Cand[i] == false) continue;
			int rem = cnt - 1; bool flag = true;
			for (int idx : G[i]) {
				if (dp[idx] > dp[i]) continue;
				rem -= dp[idx];
				if (dp[idx] * 2 > cnt) flag = false;
			}
			if (flag == true && rem * 2 <= cnt) Gravity = i;
		}

		// Step 5. Sorting
		vector<pair<int, int>> Vec; int remain = cnt - 1, upper = -1;
		for (int idx : G[Gravity]) {
			if (dp[idx] > dp[Gravity]) { upper = idx; }
			else { remain -= dp[idx]; Vec.push_back(make_pair(dp[idx], idx)); }
		}
		if (upper != -1) {
			Vec.push_back(make_pair(remain, upper));
		}
		sort(Vec.begin(), Vec.end());
		reverse(Vec.begin(), Vec.end());

		// Step 6. Interaction
		int u = Vec[0].second;
		int v = Vec[1].second;
		int x = Ask(u, v);
		vector<int> LU(N + 1, 0), LV(N + 1, 0);
		GetDist(u, -1, 0, LU, G);
		GetDist(v, -1, 0, LV, G);
		for (int i = 1; i <= N; i++) {
			if (Cand[i] == false) continue;
			if (x == 0) {
				if (!(LU[i] < LV[i])) Cand[i] = false;
			}
			if (x == 1) {
				if (!(LU[i] == LV[i])) Cand[i] = false;
			}
			if (x == 2) {
				if (!(LU[i] > LV[i])) Cand[i] = false;
			}
		}
	}
}

int main() {
	int T; cin >> T;
	for (int t = 1; t <= T; t++) {
		int N; cin >> N;
		vector<int> A(N + 1, 0);
		vector<int> B(N + 1, 0);
		for (int i = 1; i <= N; i++) cin >> A[i] >> B[i];
		Solve(N, A, B);
	}
	return 0;
}
源文件, 语言: C++20

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3640kb

input:

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

output:

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

result:

ok OK (2 test cases)

Test #2:

score: 0
Accepted
time: 151ms
memory: 4272kb

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
0
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:

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

result:

ok OK (5555 test cases)

Test #3:

score: 0
Accepted
time: 91ms
memory: 4188kb

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:

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

result:

ok OK (600 test cases)

Test #4:

score: 0
Accepted
time: 271ms
memory: 21172kb

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 60575
? 48047 49462
? 89053 35653
? 44667 62439
? 79652 40680
? 21864 3596
? 45219 35938
? 4400 60363
? 10531 77983
? 14291 23537
? 42596 14291
! 14291
? 5676 85780
? 22364 23809
? 8271 9912
? 12102 24772
? 11997 18122
? 88...

result:

ok OK (2 test cases)

Test #5:

score: 0
Accepted
time: 146ms
memory: 14244kb

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: 155ms
memory: 14548kb

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:

? 1 2
! 2
? 1 2
? 1 4
! 1
? 4 1
? 3 7
? 3 4
! 4
? 3 4
? 5 15
? 1 5
? 1 3
! 1
? 12 30
? 11 6
? 1 18
? 15 2
? 1 15
! 15
? 8 24
? 6 20
? 13 10
? 4 30
? 21 4
? 13 21
! 13
? 57 124
? 48 58
? 69 39
? 24 74
? 73 28
? 37 73
? 24 37
! 24
? 90 113
? 91 222
? 57 148
? 68 231
? 62 177
? 85 215
? 67 85
? 57 67
!...

result:

ok OK (16 test cases)

Test #7:

score: 0
Accepted
time: 155ms
memory: 14440kb

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:

? 1 2
! 2
? 1 3
? 4 1
! 1
? 4 9
? 10 7
? 10 2
! 13
? 21 16
? 8 5
? 6 3
? 8 6
! 6
? 33 30
? 32 4
? 61 45
? 46 43
? 43 32
! 35
? 70 84
? 90 37
? 99 75
? 65 30
? 122 1
? 37 1
! 37
? 12 100
? 118 71
? 192 44
? 92 67
? 221 54
? 250 236
? 236 221
! 221
? 68 449
? 319 190
? 450 334
? 422 170
? 437 35
? 285...

result:

ok OK (15 test cases)

Test #8:

score: 0
Accepted
time: 115ms
memory: 3872kb

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:

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

result:

ok OK (600 test cases)

Test #9:

score: 0
Accepted
time: 212ms
memory: 11972kb

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: 135ms
memory: 9056kb

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: 136ms
memory: 9052kb

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
1
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 0
...

output:

? 1 2
! 2
? 1 3
? 1 2
! 1
? 5 7
? 1 2
? 1 3
! 3
? 1 6
? 14 5
? 4 2
! 14
? 19 2
? 3 15
? 3 13
? 16 8
? 3 18
! 3
? 9 14
? 9 29
? 46 10
? 34 7
? 48 31
! 34
? 28 83
? 75 21
? 10 7
? 126 84
? 101 45
? 63 39
! 39
? 221 218
? 243 199
? 202 92
? 233 2
? 238 180
? 256 176
? 225 125
! 256
? 39 511
? 39 289
? ...

result:

ok OK (16 test cases)

Test #12:

score: 0
Accepted
time: 139ms
memory: 9084kb

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
2
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
0
62
0 0
0 0
28 47
7 38
0 0
0 0
17 26...

output:

? 1 2
! 2
? 1 5
? 6 4
! 4
? 12 4
? 2 8
? 7 1
! 1
? 17 26
? 5 13
? 30 14
? 27 22
! 27
? 16 57
? 43 36
? 20 13
? 40 29
? 49 14
! 14
? 18 44
? 93 53
? 75 45
? 106 58
? 116 102
? 49 47
! 47
? 241 224
? 112 193
? 124 88
? 30 17
? 242 116
? 52 44
? 169 13
! 169
? 69 32
? 210 172
? 233 19
? 228 186
? 352 2...

result:

ok OK (15 test cases)

Test #13:

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

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
? 3 1
! 1
? 1 3
? 1 2
! 1
? 1 4
? 3 5
! 3
? 5 4
? 2 5
! 2
? 4 7
? 6 5
! 4
? 5 1
? 3 8
? 3 6
! 3
? 4 1
? 3 6
? 3 7
! 7
? 2 1
? 1 9
? 1 3
! 1
? 10 1
? 10 11
? 5 8
! 8
? 4 7
? 8 4
? 4 5
! 4
? 2 4
? 12 2
? 7 12
! 12
? 12 8
? 14 12
? 2 12
! 12
? 14 9
? 1 14
? 15 11
! 11
? 1 6
? 3 1
? 3 8
? 3 11...

result:

ok OK (600 test cases)

Test #14:

score: 0
Accepted
time: 249ms
memory: 16712kb

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 97012
? 63260 47373
? 47695 30697
? 50126 13022
? 80614 22451
? 33878 88122
? 85933 99886
? 5331 61236
? 58555 80943
? 58555 5331
? 5331 63572
! 5331
? 50499 6749
? 17715 75012
? 31421 58179
? 64768 20076
? 98628 64370
? 631...

result:

ok OK (2 test cases)

Test #15:

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

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: 146ms
memory: 11280kb

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
? 4 6
? 4 1
? 3 4
! 4
? 2 10
? 4 11
? 2 1
? 2 7
! 2
? 1 31
? 3 30
? 17 3
? 1 10
? 1 26
! 26
? 31 10
? 3 57
? 9 49
? 43 9
? 31 24
? 31 39
! 31
? 24 37
? 55 56
? 61 25
? 34 11
? 10 61
? 10 118
? 10 13
! 10
? 60 89
? 118 78
? 32 205
? 38 80
? 139 51
? 28 38
? 28 213
? 28 244
!...

result:

ok OK (16 test cases)

Test #17:

score: 0
Accepted
time: 144ms
memory: 11032kb

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
? 2 5
! 2
? 14 11
? 13 11
? 3 13
! 3
? 20 8
? 26 15
? 15 12
? 15 25
! 25
? 59 42
? 15 2
? 52 16
? 16 15
? 15 62
! 62
? 40 17
? 102 11
? 119 110
? 67 15
? 119 15
? 35 119
! 119
? 189 90
? 224 65
? 185 73
? 82 42
? 18 9
? 73 9
? 73 124
! 73
? 192 60
? 285 44
? 151 36
? 443 70
? 295 229...

result:

ok OK (15 test cases)

Test #18:

score: 0
Accepted
time: 233ms
memory: 12324kb

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: 366ms
memory: 3552kb

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-21 00:02:55 | 開源專案