QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#704766#9537. Chinese Chessucup-team5062#AC ✓2ms4320kbC++205.1kb2024-11-02 20:57:552024-11-02 20:57:55

Judging History

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

  • [2024-11-02 20:57:55]
  • 评测
  • 测评结果：AC
  • 用时：2ms
  • 内存：4320kb
查看
  • [2024-11-02 20:57:55]
  • 提交

answer

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

struct Candidates {
	pair<long long, long long> x[6];
};

vector<pair<int, int>> Movements[7];
int Dist[90][90][6];
Candidates Vec[90][30];


// ================================================================================== Initialize
void Initialize() {
	Movements[0].push_back(make_pair(+1, 0));
	Movements[0].push_back(make_pair(-1, 0));
	Movements[0].push_back(make_pair(0, +1));
	Movements[0].push_back(make_pair(0, -1));
	Movements[1].push_back(make_pair(+1, +1));
	Movements[1].push_back(make_pair(-1, +1));
	Movements[1].push_back(make_pair(+1, -1));
	Movements[1].push_back(make_pair(-1, -1));
	for (int i = -9; i <= 9; i++) {
		if (i == 0) continue;
		Movements[2].push_back(make_pair(i, 0));
		Movements[2].push_back(make_pair(0, i));
	}
	Movements[3].push_back(make_pair(+2, -1));
	Movements[3].push_back(make_pair(+2, +1));
	Movements[3].push_back(make_pair(+1, -2));
	Movements[3].push_back(make_pair(+1, +2));
	Movements[3].push_back(make_pair(-2, -1));
	Movements[3].push_back(make_pair(-2, +1));
	Movements[3].push_back(make_pair(-1, -2));
	Movements[3].push_back(make_pair(-1, +2));
	Movements[4].push_back(make_pair(+2, +2));
	Movements[4].push_back(make_pair(+2, -2));
	Movements[4].push_back(make_pair(-2, +2));
	Movements[4].push_back(make_pair(-2, -2));

	Movements[5].push_back(make_pair(1, 0));
	Movements[6].push_back(make_pair(1, 0));
	Movements[6].push_back(make_pair(0, -1));
	Movements[6].push_back(make_pair(0, +1));
}

void get_shortest(int stt, int koma) {
	for (int i = 0; i < 90; i++) Dist[stt][i][koma] = (1 << 30);
	queue<int> Q; Q.push(stt);
	Dist[stt][stt][koma] = 1;
	while (!Q.empty()) {
		int pos = Q.front(); Q.pop();
		int sx = pos / 9;
		int sy = pos % 9;
		int mv = ((koma == 5 && sx >= 5) ? 6 : koma);

		// Move
		for (int i = 0; i < Movements[mv].size(); i++) {
			int cx = sx + Movements[mv][i].first;
			int cy = sy + Movements[mv][i].second;
			if (cx < 0 || cy < 0 || cx > 9 || cy > 8) continue;
			int val = cx * 9 + cy;
			if (Dist[stt][val][koma] == (1 << 30)) {
				Dist[stt][val][koma] = Dist[stt][pos][koma] + 1;
				Q.push(val);
			}
		}
	}
}

void Prepare() {
	for (int cell = 0; cell < 90; cell++) {
		for (int koma = 0; koma < 6; koma++) {
			for (int i = 0; i < 90; i++) {
				int dst = (Dist[i][cell][koma] == (1 << 30) ? 0 : Dist[i][cell][koma]);
				if (i < 45) Vec[cell][dst].x[koma].first += (1LL << i);
				else Vec[cell][dst].x[koma].second += (1LL << (i - 45));
			}
		}
	}
}


// ================================================================================== Apply
Candidates Apply(Candidates a, int cell, int dst) {
	for (int i = 0; i < 6; i++) {
		a.x[i].first &= Vec[cell][dst].x[i].first;
		a.x[i].second &= Vec[cell][dst].x[i].second;
	}
	return a;
}

pair<bool, int> Solve(int dep, int prv, Candidates a) {
	if (dep == 0) return make_pair(false, -1);

	// Recursion
	for (int cell = 0; cell < 90; cell++) {
		bool flag = true;
		for (int dst = 0; dst <= 18; dst++) {
			Candidates b = Apply(a, cell, dst);
			int cnt = 0;
			if (b.x[0] == make_pair(0LL, 0LL)) cnt++;
			if (b.x[1] == make_pair(0LL, 0LL)) cnt++;
			if (b.x[2] == make_pair(0LL, 0LL)) cnt++;
			if (b.x[3] == make_pair(0LL, 0LL)) cnt++;
			if (b.x[4] == make_pair(0LL, 0LL)) cnt++;
			if (b.x[5] == make_pair(0LL, 0LL)) cnt++;
			if (cnt <= 4 && Solve(dep - 1, cell + 1, b) == make_pair(false, -1)) { flag = false; break; }
		}
		if (flag == true) return make_pair(true, cell);
	}
	return make_pair(false, -1);
}


// ================================================================================== Main Function
int main() {
	// Step 1. Input
	int N; cin >> N;
	vector<int> X(N, 0);
	vector<int> Y(N, 0);
	for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
	Initialize();
	for (int i = 0; i < 90; i++) {
		for (int j = 0; j < 6; j++) get_shortest(i, j);
	}
	Prepare();

	// Step 2. Solve
	Candidates Z;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 6; j++) {
			int cur = X[i] * 9 + Y[i];
			if (cur < 45) Z.x[j].first += (1LL << cur);
			else Z.x[j].second += (1LL << (cur - 45));
		}
	}

	// Step 3. Find Min
	int Minv = 0;
	for (int i = 1; i <= 10; i++) {
		pair<bool, int> ret = Solve(i, 0, Z);
		if (ret.first == true) { Minv = i; break; }
	}
	cout << Minv << endl;

	// Step 3. Interaction
	for (int loops = Minv; loops >= 1; loops--) {
		pair<bool, int> ret = Solve(loops, 0, Z);
		cout << "? " << ret.second / 9 << " " << ret.second % 9 << endl;
		int x; cin >> x;
		x++;
		Z = Apply(Z, ret.second, x);
		vector<int> cand;
		if (Z.x[0] != make_pair(0LL, 0LL)) cand.push_back(0);
		if (Z.x[1] != make_pair(0LL, 0LL)) cand.push_back(1);
		if (Z.x[2] != make_pair(0LL, 0LL)) cand.push_back(2);
		if (Z.x[3] != make_pair(0LL, 0LL)) cand.push_back(3);
		if (Z.x[4] != make_pair(0LL, 0LL)) cand.push_back(4);
		if (Z.x[5] != make_pair(0LL, 0LL)) cand.push_back(5);
		if (cand.size() == 1) {
			char role[7] = "JSCMXB";
			cout << "! " << role[cand[0]] << endl;
			return 0;
		}
	}
	return 0;
}
源文件, 语言: C++20

这程序好像有点Bug，我给组数据试试？

详细

Test #1:

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

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

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

input:

4
2 1
2 3
2 5
2 7
5
1

output:

2
? 0 0
? 0 6
! M

result:

ok number is guessed.

Test #3:

score: 0
Accepted
time: 2ms
memory: 4076kb

input:

1
2 4
-1
1

output:

2
? 0 0
? 0 2
! X

result:

ok number is guessed.

Test #4:

score: 0
Accepted
time: 2ms
memory: 4316kb

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

score: 0
Accepted
time: 2ms
memory: 4116kb

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

score: 0
Accepted
time: 2ms
memory: 4080kb

input:

2
7 7
1 0
-1
6

output:

2
? 0 0
? 7 2
! S

result:

ok number is guessed.

Test #7:

score: 0
Accepted
time: 2ms
memory: 3980kb

input:

5
8 6
1 3
0 5
2 4
0 2
6
3

output:

2
? 0 0
? 0 3
! J

result:

ok number is guessed.

Test #8:

score: 0
Accepted
time: 1ms
memory: 4312kb

input:

6
0 7
1 6
2 8
0 5
7 6
8 2
-1
14

output:

2
? 0 0
? 8 1
! B

result:

ok number is guessed.

Test #9:

score: 0
Accepted
time: 2ms
memory: 4076kb

input:

7
6 5
3 0
3 2
4 1
4 0
2 4
5 2
5
7

output:

2
? 0 0
? 0 4
! J

result:

ok number is guessed.

Test #10:

score: 0
Accepted
time: 2ms
memory: 4052kb

input:

8
3 3
2 5
6 2
7 4
1 4
3 0
2 4
3 4
7
-1

output:

2
? 0 1
? 0 0
! S

result:

ok number is guessed.

Test #11:

score: 0
Accepted
time: 2ms
memory: 4084kb

input:

9
2 7
2 4
2 5
2 2
2 1
2 0
2 6
2 3
2 8
6
8

output:

2
? 2 0
? 0 0
! J

result:

ok number is guessed.

Test #12:

score: 0
Accepted
time: 2ms
memory: 4076kb

input:

10
4 0
0 0
5 0
7 0
8 0
1 0
6 0
9 0
2 0
3 0
9
-1

output:

2
? 9 0
? 0 1
! B

result:

ok number is guessed.

Test #13:

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

input:

9
1 8
1 2
1 5
1 6
1 3
1 4
1 0
1 1
1 7
6
7

output:

2
? 1 0
? 0 0
! J

result:

ok number is guessed.

Test #14:

score: 0
Accepted
time: 2ms
memory: 4320kb

input:

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

output:

2
? 9 1
? 0 0
! J

result:

ok number is guessed.

Test #15:

score: 0
Accepted
time: 2ms
memory: 4120kb

input:

9
4 6
4 5
4 7
4 4
4 1
4 3
4 0
4 8
4 2
6
12

output:

2
? 4 2
? 0 0
! J

result:

ok number is guessed.

Test #16:

score: 0
Accepted
time: 2ms
memory: 4068kb

input:

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

output:

2
? 9 0
? 0 0
! J

result:

ok number is guessed.

Test #17:

score: 0
Accepted
time: 2ms
memory: 4072kb

input:

9
3 1
3 7
3 5
3 3
3 6
3 4
3 0
3 2
3 8
6
11

output:

2
? 3 2
? 0 0
! J

result:

ok number is guessed.

Test #18:

score: 0
Accepted
time: 2ms
memory: 4080kb

input:

10
5 1
8 1
6 1
4 1
3 1
0 1
2 1
7 1
9 1
1 1
10
-1

output:

2
? 9 0
? 0 0
! B

result:

ok number is guessed.

Test #19:

score: 0
Accepted
time: 2ms
memory: 4076kb

input:

9
1 6
1 4
1 3
1 7
1 8
1 5
1 2
1 1
1 0
6
7

output:

2
? 1 0
? 0 0
! J

result:

ok number is guessed.

Test #20:

score: 0
Accepted
time: 2ms
memory: 4072kb

input:

10
5 0
9 0
1 0
2 0
3 0
6 0
7 0
4 0
0 0
8 0
9
-1

output:

2
? 9 0
? 0 1
! B

result:

ok number is guessed.

Test #21:

score: 0
Accepted
time: 2ms
memory: 4012kb

input:

9
0 3
0 5
0 7
0 0
0 4
0 8
0 1
0 6
0 2
6
5

output:

2
? 0 0
? 0 1
! J

result:

ok number is guessed.

Test #22:

score: 0
Accepted
time: 2ms
memory: 4112kb

input:

10
1 0
9 0
4 0
2 0
8 0
7 0
5 0
3 0
0 0
6 0
9
-1

output:

2
? 9 0
? 0 1
! B

result:

ok number is guessed.

Test #23:

score: 0
Accepted
time: 2ms
memory: 4120kb

input:

9
1 8
1 2
1 7
1 0
1 4
1 6
1 1
1 5
1 3
6
7

output:

2
? 1 0
? 0 0
! J

result:

ok number is guessed.

Test #24:

score: 0
Accepted
time: 2ms
memory: 4112kb

input:

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

output:

2
? 9 1
? 0 0
! J

result:

ok number is guessed.

Test #25:

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

input:

9
0 2
0 7
0 5
0 4
0 0
0 3
0 1
0 6
0 8
6
5

output:

2
? 0 0
? 0 1
! J

result:

ok number is guessed.

Test #26:

score: 0
Accepted
time: 2ms
memory: 4280kb

input:

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

output:

2
? 9 0
? 0 0
! J

result:

ok number is guessed.

Test #27:

score: 0
Accepted
time: 2ms
memory: 4012kb

input:

50
7 5
9 2
0 4
9 3
8 4
8 2
7 2
6 4
4 4
0 0
1 7
1 1
1 5
2 0
9 8
9 0
3 1
7 8
8 6
5 0
7 3
8 5
2 6
4 8
3 5
6 8
0 8
5 7
4 6
1 6
3 8
5 6
3 0
5 3
0 7
5 1
3 4
0 1
7 6
2 3
4 3
5 5
8 1
0 3
6 5
9 5
5 8
7 4
6 3
2 7
-1
3
2

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #28:

score: 0
Accepted
time: 2ms
memory: 4080kb

input:

49
4 2
8 0
2 4
9 5
8 1
7 8
0 2
4 7
3 0
1 3
6 6
0 8
8 3
5 8
2 2
1 0
6 0
2 6
0 5
9 2
7 0
4 4
8 8
9 6
5 0
6 8
9 4
7 6
9 0
2 7
4 6
7 7
0 1
4 0
6 7
2 8
8 2
3 2
3 1
3 4
5 4
7 3
5 6
5 2
1 8
3 3
1 7
0 3
4 3
-1
3
4

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #29:

score: 0
Accepted
time: 2ms
memory: 3968kb

input:

48
6 7
3 5
0 3
5 7
1 6
9 6
6 2
0 7
5 5
0 4
0 5
0 8
6 4
4 2
8 5
1 2
1 3
8 1
2 7
0 2
2 6
7 1
6 5
0 1
3 7
6 8
7 4
3 3
5 4
5 1
4 4
8 8
7 5
0 0
1 0
7 6
7 7
3 0
7 8
4 0
9 2
9 7
6 6
2 1
6 1
5 2
5 6
4 1
-1
2
1

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #30:

score: 0
Accepted
time: 2ms
memory: 4132kb

input:

51
0 8
1 6
5 3
2 6
9 0
4 0
8 1
0 7
1 0
2 4
8 4
3 6
7 1
8 6
9 7
0 6
5 4
3 2
6 6
7 7
6 1
5 0
4 5
4 8
6 8
3 5
5 8
5 5
8 7
9 6
6 0
3 3
2 3
3 1
2 8
4 4
6 4
1 7
7 2
8 0
3 0
8 8
3 7
1 3
5 6
7 4
6 5
2 7
1 1
7 6
3 8
-1
4
-1

output:

3
? 0 0
? 1 0
? 0 1
! X

result:

ok number is guessed.

Test #31:

score: 0
Accepted
time: 2ms
memory: 4080kb

input:

52
1 6
3 8
0 6
9 2
6 4
5 4
2 1
1 0
4 2
2 2
3 2
9 6
7 1
0 2
8 7
1 4
3 1
8 0
3 0
5 8
1 5
7 4
5 7
5 1
6 8
1 2
9 0
6 5
0 4
4 0
5 5
5 0
2 6
6 2
8 5
7 0
0 7
5 3
9 3
0 1
3 5
8 1
4 5
4 6
7 5
8 3
7 8
7 2
3 3
2 5
8 8
2 8
-1
4
5

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #32:

score: 0
Accepted
time: 2ms
memory: 4072kb

input:

89
3 1
7 3
3 0
3 5
0 0
1 3
1 1
3 3
8 8
7 7
2 4
7 0
9 3
2 0
3 7
6 6
7 2
7 1
4 4
2 8
1 2
9 4
9 2
3 8
9 5
6 5
3 4
8 0
2 1
0 4
4 2
1 5
4 7
4 3
7 8
5 6
0 8
0 2
8 7
9 0
5 8
9 8
5 4
0 6
0 5
5 5
7 6
5 0
6 0
6 1
1 0
5 2
8 6
7 5
4 5
9 1
1 4
8 4
4 8
4 6
9 7
1 6
5 3
8 5
9 6
3 6
0 1
6 8
1 8
1 7
4 0
0 3
6 7
0 7
2...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #33:

score: 0
Accepted
time: 2ms
memory: 4084kb

input:

89
7 4
2 6
9 2
0 1
0 4
8 0
6 5
4 1
7 5
0 2
5 3
1 0
9 5
2 7
7 7
7 1
2 1
8 8
0 0
1 1
9 3
3 0
4 7
5 5
6 8
8 3
0 3
7 2
8 5
0 8
4 6
0 6
6 0
8 6
8 4
2 8
3 8
9 7
1 7
5 6
8 2
7 6
5 1
1 5
2 2
6 3
2 4
9 6
4 3
4 4
4 5
5 7
3 3
4 0
9 1
6 7
9 4
1 3
3 1
6 4
1 4
0 7
9 0
1 2
0 5
6 1
7 3
8 1
9 8
2 3
3 5
2 5
5 0
8 7
7...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #34:

score: 0
Accepted
time: 2ms
memory: 4016kb

input:

89
2 2
5 3
0 1
6 1
3 7
8 5
0 3
0 8
7 1
9 4
9 7
6 3
2 1
5 6
1 6
9 0
5 5
6 7
2 4
7 4
9 5
6 5
8 3
0 0
2 3
7 3
6 8
8 8
3 3
2 5
6 4
5 2
5 0
5 1
3 1
1 4
5 8
9 8
1 8
2 6
4 0
2 0
3 4
1 3
2 8
3 2
4 4
3 0
6 0
0 5
9 1
4 7
4 2
3 6
4 8
6 2
1 5
1 7
7 8
4 6
7 0
0 4
6 6
2 7
9 3
8 0
5 7
8 6
7 7
9 2
9 6
8 7
8 4
3 5
4...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #35:

score: 0
Accepted
time: 2ms
memory: 4024kb

input:

89
3 3
4 4
8 2
7 8
4 7
7 6
1 5
5 4
9 5
3 8
6 2
0 1
3 0
1 6
0 7
3 4
4 8
8 1
4 6
5 5
4 0
4 5
2 3
7 3
7 2
1 1
9 8
4 3
3 7
5 8
1 8
1 0
4 1
5 2
2 4
0 6
8 8
6 1
9 0
2 6
3 6
1 7
6 3
8 0
1 3
2 0
6 0
8 6
8 5
7 5
9 2
9 1
3 1
9 6
3 2
5 7
0 3
6 6
0 4
6 4
5 3
5 0
2 8
7 4
0 2
2 2
2 1
6 8
2 5
7 1
8 3
0 8
0 0
9 3
7...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #36:

score: 0
Accepted
time: 1ms
memory: 3976kb

input:

89
5 0
7 0
0 2
0 7
1 5
3 6
2 6
7 8
6 5
5 5
8 2
6 0
1 4
4 7
4 4
6 3
9 4
8 3
0 4
2 3
4 6
3 3
6 7
6 6
3 0
1 6
6 8
8 6
7 5
1 2
2 8
6 4
6 1
1 8
0 1
2 1
3 4
0 6
0 0
4 3
1 3
3 1
8 4
5 4
3 5
7 3
6 2
9 3
2 2
8 7
5 8
9 0
9 1
9 5
4 1
2 7
9 7
4 8
7 2
7 7
5 3
4 5
5 1
5 7
7 6
3 8
7 4
2 5
9 2
4 2
1 1
1 7
4 0
9 8
7...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #37:

score: 0
Accepted
time: 2ms
memory: 4052kb

input:

90
9 6
6 2
8 8
6 4
9 2
4 1
3 6
2 7
8 6
6 0
9 8
3 2
7 5
5 7
1 6
5 3
5 0
8 4
2 4
2 0
0 4
4 5
1 3
4 4
4 3
7 8
6 8
3 5
0 5
5 2
8 0
7 0
5 6
9 7
3 0
1 2
1 4
3 8
6 3
3 3
4 2
9 5
7 4
7 3
3 1
0 6
2 2
5 1
3 7
4 8
0 3
9 4
1 7
2 8
1 0
9 3
0 7
0 2
4 7
0 0
7 6
3 4
6 1
7 7
2 6
8 3
8 1
4 0
5 5
1 8
5 4
4 6
1 5
9 0
2...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #38:

score: 0
Accepted
time: 2ms
memory: 4028kb

input:

90
9 6
7 3
8 7
1 2
9 4
6 5
9 7
0 5
0 3
5 8
0 0
1 6
1 3
8 8
9 3
4 3
7 8
3 7
3 5
8 5
5 7
1 0
5 4
5 2
0 1
9 0
6 8
6 4
3 4
1 1
4 4
9 2
6 2
0 4
8 0
2 2
1 4
0 6
4 7
3 0
7 5
2 7
8 6
5 0
4 6
2 3
7 7
9 1
2 5
9 5
7 0
5 3
4 5
3 3
4 0
8 4
7 2
3 1
0 8
5 5
2 8
7 4
8 3
0 2
0 7
1 5
7 1
2 1
3 6
9 8
5 1
7 6
2 6
1 7
4...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #39:

score: 0
Accepted
time: 1ms
memory: 4316kb

input:

90
5 7
7 2
6 6
2 4
1 5
0 3
9 8
5 0
4 1
3 1
5 6
8 5
4 0
4 6
3 3
1 2
7 0
4 2
0 4
4 5
0 1
8 8
8 6
9 3
7 5
5 2
6 8
8 2
6 2
4 7
3 5
2 0
0 5
8 4
8 3
2 2
6 3
9 5
4 8
1 4
4 4
6 7
2 8
1 7
0 0
6 5
9 1
1 3
9 4
9 0
7 3
7 7
9 2
1 0
6 4
2 7
2 5
6 1
3 4
0 7
5 8
2 6
0 8
3 8
7 1
4 3
3 0
3 2
8 1
8 7
9 6
2 1
9 7
1 1
0...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #40:

score: 0
Accepted
time: 2ms
memory: 4312kb

input:

90
7 6
4 2
9 4
7 1
0 7
7 3
0 2
6 2
6 3
3 4
2 7
4 4
8 5
4 3
3 2
6 7
1 8
1 0
3 8
0 4
4 5
8 0
5 8
0 6
1 6
8 4
6 8
8 6
6 6
4 0
8 1
6 1
2 4
7 5
8 2
9 6
0 0
7 8
4 7
5 1
7 4
2 1
8 3
6 5
2 5
5 4
1 1
3 0
3 5
5 7
9 1
1 5
9 7
9 8
0 3
7 0
0 1
2 8
5 3
6 0
9 0
4 6
4 1
4 8
2 2
5 2
3 7
1 2
3 3
1 3
9 2
7 7
5 6
2 3
0...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #41:

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

input:

90
2 0
5 6
9 0
7 3
4 7
9 3
2 8
3 5
7 6
6 1
0 7
0 8
4 6
2 2
8 3
2 6
7 4
9 6
2 1
6 2
4 1
7 0
0 0
1 7
6 5
1 1
6 8
2 3
6 0
9 7
1 2
2 7
3 3
5 4
3 6
1 6
0 3
0 5
4 3
6 3
2 4
1 3
7 7
8 1
6 7
3 1
9 4
8 7
9 1
3 2
4 8
9 2
1 4
4 0
8 5
6 4
8 0
0 2
3 0
1 0
6 6
8 6
9 5
5 2
4 2
2 5
7 1
5 8
5 3
8 8
3 8
5 0
7 5
5 1
1...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #42:

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

input:

90
6 6
3 6
3 1
3 8
9 5
7 0
7 6
2 6
8 4
4 6
8 0
6 2
7 3
9 2
8 3
7 1
1 8
1 1
3 4
2 4
6 4
0 1
0 8
5 2
0 6
1 7
4 0
2 7
2 0
3 7
8 6
1 0
7 2
5 0
0 0
1 3
1 6
3 3
5 1
8 5
0 5
4 3
5 5
4 1
2 1
1 4
3 2
2 3
4 7
0 2
2 8
5 3
9 1
5 4
6 3
6 8
5 7
9 8
4 5
0 3
5 6
7 7
9 7
7 5
3 5
6 7
5 8
1 2
4 2
7 8
8 1
8 8
6 5
9 0
4...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #43:

score: 0
Accepted
time: 2ms
memory: 4076kb

input:

90
5 4
6 7
7 6
8 5
1 0
5 8
0 7
4 2
9 3
8 1
3 0
7 3
0 4
1 4
7 8
8 8
9 0
1 3
3 7
6 3
3 2
2 7
2 3
5 7
6 2
5 2
3 5
2 1
1 1
0 8
8 2
0 2
6 6
9 4
7 0
3 3
2 8
2 4
3 1
9 7
1 5
5 3
2 5
5 0
9 6
8 0
9 8
7 5
6 1
1 2
9 1
6 5
1 8
4 3
3 8
6 8
0 3
4 5
1 7
6 0
4 1
0 1
5 1
8 4
8 6
7 7
3 4
4 4
6 4
4 8
3 6
4 6
4 0
2 6
2...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #44:

score: 0
Accepted
time: 2ms
memory: 4080kb

input:

90
4 7
2 0
6 2
9 8
2 1
1 2
0 6
3 6
1 1
9 6
7 4
9 2
7 2
0 8
2 8
2 4
4 6
6 0
7 8
9 7
4 5
1 7
6 4
0 4
3 3
3 5
5 8
9 0
5 3
4 2
4 0
5 1
8 5
3 0
0 0
5 2
9 5
8 2
8 8
0 1
5 7
3 1
1 5
6 1
5 6
8 1
0 2
3 8
4 4
6 5
0 7
2 6
7 7
3 2
6 8
9 1
5 0
6 6
0 3
3 4
6 3
7 6
4 3
5 5
0 5
4 1
1 8
9 3
2 3
5 4
8 6
2 7
3 7
4 8
9...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #45:

score: 0
Accepted
time: 2ms
memory: 4316kb

input:

90
2 1
6 0
4 3
6 7
3 5
1 4
4 1
2 3
3 6
2 5
7 5
3 2
2 7
5 5
5 3
1 7
0 3
7 1
8 2
5 8
2 4
6 1
8 7
7 2
9 5
0 5
3 1
0 6
3 3
6 6
9 8
9 4
8 0
8 4
5 1
7 8
2 0
5 2
4 4
7 0
1 5
2 2
8 3
1 6
3 7
1 0
1 2
0 1
5 6
3 4
8 6
9 0
6 4
9 1
1 1
7 4
7 7
8 1
5 7
0 4
3 8
1 3
8 8
4 0
4 8
6 3
4 2
6 2
4 7
7 6
0 2
2 8
2 6
0 7
5...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Test #46:

score: 0
Accepted
time: 2ms
memory: 4020kb

input:

90
0 3
1 3
4 0
9 0
4 6
8 6
6 6
0 8
0 2
7 2
7 1
3 8
1 7
7 6
5 4
9 6
2 1
2 3
6 4
3 7
8 7
0 6
8 2
3 1
4 2
5 1
7 8
6 7
2 8
2 4
6 0
5 5
3 6
9 5
9 3
2 2
8 0
1 2
2 5
8 3
0 5
0 4
4 4
3 4
0 0
6 5
4 7
8 1
1 0
9 1
0 1
5 0
8 5
0 7
6 1
6 8
7 3
8 8
9 7
9 2
1 6
2 7
1 1
6 2
4 8
1 8
5 6
7 5
2 6
7 4
9 4
5 7
1 4
6 3
3...

output:

3
? 0 0
? 1 0
? 0 1
! S

result:

ok number is guessed.

Extra Test:

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

服务器时间: 2024-12-12 04:04:55 | 开源项目