QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#324207#8239. Mysterious Treeucup-team484#WA 4ms3636kbC++17753b2024-02-10 16:57:462024-02-10 16:57:47

Judging History

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

  • [2024-02-10 16:57:47]
  • 评测
  • 测评结果：WA
  • 用时：4ms
  • 内存：3636kb
查看
  • [2024-02-10 16:57:46]
  • 提交

answer

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

int ok(int i, int j, int n) {
	while (j > n)
		j -= n;
	cout << "? " << i << " " << j << endl;
	int t; cin >> t;
	return t;
}

void solve() {
	int n; cin >> n;
	for (int i = 1; i <= n; i += 2) {
		if (!ok(i, i + 1, n))
			continue;
		int deg = ok(i, i + 2, n);
		if (deg == 1)
			deg += ok(i, i + 3, n);
		if (deg == 2 || deg == 0 && ok(i + 1, i + 2, n) && ok(i + 1, i + 3, n)) {
			cout << "! 2" << endl;
			return;
		}
		break;
	}
	cout << "! 1" << endl;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
		int t; cin >> t; while (t--) solve();
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
4
1
0
1
0
4
0
1
1
1

output:

? 1 2
? 1 3
? 2 3
? 2 4
! 1
? 1 2
? 3 4
? 3 1
? 3 2
! 2

result:

ok Correct (2 test cases)

Test #2:

score: 0
Accepted
time: 4ms
memory: 3588kb

input:

87
13
0
0
0
0
0
1
0
1
1
15
0
0
0
0
0
0
1
1
1
7
0
0
0
1
1
1
15
0
0
0
1
0
0
19
0
0
0
0
0
1
1
1
20
0
0
0
0
0
0
0
0
0
0
7
0
0
1
0
1
1
20
0
0
0
0
0
0
0
1
1
1
17
0
0
0
0
0
0
0
0
0
11
1
0
0
14
0
0
0
0
0
0
0
13
0
0
0
0
0
0
0
18
0
0
0
0
0
1
0
1
1
14
0
1
0
1
1
20
0
0
0
0
1
0
0
11
0
0
0
1
0
0
11
0
1
0
0
8
0
1
...

output:

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

result:

ok Correct (87 test cases)

Test #3:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

135
9
1
0
0
6
0
0
0
11
0
0
0
0
1
0
1
0
4
1
1
0
10
0
0
0
0
1
1
1
9
0
0
0
1
1
1
9
0
0
1
0
1
1
6
0
0
0
9
0
0
0
1
1
1
11
0
0
0
0
1
0
0
4
0
0
4
1
1
1
8
0
0
0
0
5
0
0
0
7
1
1
0
11
0
0
0
0
1
0
1
1
4
1
1
1
6
1
1
1
9
0
0
1
1
1
4
1
0
1
1
8
1
0
0
9
0
0
1
0
1
1
7
0
0
1
0
0
4
1
1
1
8
0
0
0
0
11
0
0
0
0
1
1
1
8
0...

output:

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

result:

ok Correct (135 test cases)

Test #4:

score: -100
Wrong Answer
time: 1ms
memory: 3636kb

input:

136
8
0
0
0
1
0
1
1
5
1
0
1
1
11
0
0
1
0
1
0
10
1
0
0
6
0
0
0
9
0
0
1
0
1
1
7
0
1
1
1
10
0
0
1
0
1
1
7
0
0
1
1
1
9
0
0
1
1
1
5
0
0
1
1
1
7
0
0
0
1
0

output:

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

result:

wrong answer Integer 8 violates the range [1, 7] (test case 12)
English 繁體中文 简体中文

Server Time: 2024-12-05 10:27:08 | OpenSource Project