QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#712892#9537. Chinese Chessucup-team3519#AC ✓11ms4188kbC++176.4kb2024-11-05 17:24:462024-11-05 17:24:46

Judging History

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

  • [2024-11-05 17:24:46]
  • 评测
  • 测评结果：AC
  • 用时：11ms
  • 内存：4188kb
查看
  • [2024-11-05 17:24:46]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef long long LL;
#define fi first
#define se second
#define pb push_back
#define V vector
const int INF = 2e9 + 100;

char name[]{'J', 'S', 'C', 'M', 'X', 'B'};
V<pi> dir[]{
    {{1, 0}, {-1, 0}, {0, 1}, {0, -1}},
    {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}},
    {},//need
    {{2, 1}, {2, -1}, {-2, 1}, {-2, -1}, {1, 2}, {1, -2}, {-1, 2}, {-1, -2}},
    {{2, 2}, {2, -2}, {-2, 2}, {-2, -2}},
    {}
};

int query(int x, int y) {
    cout << "? " << x << " " << y << endl;
    int t; cin >> t;
    return t;
}

int dis[10][10][10][10][10];

bool ins(int x, int y) {
    return x >= 0 && x <= 9 && y >= 0 && y <= 8;
}

void ini_dis() {
    for(auto type : {0, 1, 3, 4}) {
        for(int i = 0; i <= 9; i++) {
            for(int j = 0; j <= 8; j++) {
                for(int x = 0; x <= 9; x++) {
                    for(int y = 0; y <= 8; y++) {
                        dis[type][i][j][x][y] = -1;
                    }
                }
                queue<pi> que;
                que.push({i, j});
                dis[type][i][j][i][j] = 0;
                while(que.size()) {
                    auto [p, q] = que.front();
                    que.pop();
                    for(auto [dx, dy] : dir[type]) {
                        int nx = p + dx, ny = q + dy;
                        if(ins(nx, ny) && dis[type][i][j][nx][ny] == -1) {
                            dis[type][i][j][nx][ny] = dis[type][i][j][p][q] + 1;
                            que.push({nx, ny});
                        }
                    }
                }
            }
        }
    }
    //deal2(car)
    for(int i = 0; i <= 9; i++) {
        for(int j = 0; j <= 8; j++) {
            for(int x = 0; x <= 9; x++) {
                for(int y = 0; y <= 8; y++) {
                    if(i == x && y == j) {
                        dis[2][i][j][x][y] = 0;
                    } else if(i == x || y == j) {
                        dis[2][i][j][x][y] = 1;
                    } else {
                        dis[2][i][j][x][y] = 2;
                    }
                }
            }
        }
    }
    //deal5(bing)
    for(int i = 0; i <= 9; i++) {
        for(int j = 0; j <= 8; j++) {
            for(int x = 0; x <= 9; x++) {
                for(int y = 0; y <= 8; y++) {
                    if(i > x || x <= 4 && j != y) {
                        dis[5][i][j][x][y] = -1;
                    } else {
                        dis[5][i][j][x][y] = abs(i - x) + abs(j - y);
                    }
                }
            }
        }
    }
}

bool ok(V<array<int, 3>> v) {
    bool ans = 1;
    for(int i = 1; i < v.size(); i++) {
        if(v[i][0] != v[i - 1][0]) {
            ans = 0;
            break;
        }
    }
    return ans;
}

V<array<int, 3>> upd(V<array<int, 3>> v, array<int, 3> info) {
    V<array<int, 3>> n_v;
    for(auto [type, x, y] : v) {
        if(dis[type][x][y][info[0]][info[1]] == info[2]) n_v.pb({type, x, y});
    }   
    return n_v;
}

pi tmp_ans;
bool dfs(int res, V<array<int, 3>> v, pi pre) {
    if(res == 0) {
        return ok(v);
    }
    if(res % 2 == 0) {
        for(int i = 0; i <= 9; i++) {
            for(int j = 0; j <= 8; j++) {
                if(dfs(res - 1, v, {i, j})) {
                    tmp_ans = pi{i, j};
                    return 1;
                }
            }
        }
        return 0;
    } else {
        bool ans = 1;
        for(int i = -1; i <= 17; i++) {
            V<array<int, 3>> n_v = upd(v, {pre.fi, pre.se, i});
            ans &= dfs(res - 1, n_v, {0, 0});
            if(!ans) return 0;
        }
        return 1;
    }
}

void solve1(V<array<int, 3>> v) {
    cout << 1 << endl;
    int t = query(tmp_ans.fi, tmp_ans.se);
    v = upd(v, {tmp_ans.fi, tmp_ans.se, t});
    assert(ok(v));
    cout << "! " << name[v[0][0]] << endl;
}

void solve2(V<array<int, 3>> v) {
    cout << 2 << endl;
    int t = query(tmp_ans.fi, tmp_ans.se);
    v = upd(v, {tmp_ans.fi, tmp_ans.se, t});

    assert(dfs(2, v, {0, 0}));
    t = query(tmp_ans.fi, tmp_ans.se);
    v = upd(v, {tmp_ans.fi, tmp_ans.se, t});
    assert(ok(v));
    cout << "! " << name[v[0][0]] << endl;
}

void solve3(V<array<int, 3>> v) {
    cout << 3 << endl;
    int t1 = query(0, 0);
    int t2 = query(9, 8);
    v = upd(v, {0, 0, t1});
    v = upd(v, {9, 8, t2});
    if(t1 == -1 && t2 == -1) {
        cout << "! " << 'X' << endl;
        assert(ok(v));
        return;
    }
    if(t1 == 0 && t2 == 17) {
        int t3 = query(0, 1);
        upd(v, {0, 1, t3});
        assert(ok(v));
        if(t3 == -1) {
            cout << "! " << 'B' << endl;
            return;
        } 
        if(t3 == 1) {
            cout << "! " << 'J' << endl;
            return;
        }
        assert(0);
    }
    if(t1 != -1 && t2 != -1) {
        assert(ok(v));
        int sum = t1 + t2;
        if(sum <= 4) {
            cout << "! " << 'C' << endl;
            return;
        }
        if(sum == 17) {
            cout << "! " << 'J' << endl;
            return;
        }
        cout << "! " << 'M' << endl;
        return;
    }
    if(t1 == -1) {
        int t3 = query(3, 2);
        v = upd(v, {3, 2, t3});
        assert(ok(v));

        int a = t2, b = t3;
        if(t2 == t3 + 12) {
            cout << "! B" << endl;
            return;
        } 
        if(a % 2 == b % 2) {
            cout << "! S" << endl;
            return;
        } else {
            cout << "! X" << endl;
            return;
        }
    }
    if(t2 == -1) {
        int t3 = query(1, 1);
        v = upd(v, {1, 1, t3});
        assert(ok(v));
        if(t3 == -1) cout << "! X" << endl;
        else cout << "! S" << endl;
        return;
    }
    assert(0);
}

void solve() {
    ini_dis();
    int n; cin >> n;
    V<pi> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
    V<array<int, 3>> v;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < 6; j++) {
            v.pb({j, a[i].fi, a[i].se});
        }
    }

    if(dfs(2, v, {0, 0})) {
        solve1(v);
    } else if(dfs(4, v, {0, 0})) {
        solve2(v);
    } else {
        solve3(v);
    }
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    // int t; cin >> t;
    // while(t--) 
        solve();
}
源文件, 语言: C++17

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

详细

Test #1:

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

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

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

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: 1ms
memory: 3848kb

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: 4112kb

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

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

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

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

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: 1ms
memory: 4116kb

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: 0ms
memory: 3816kb

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: 1ms
memory: 3920kb

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: 1ms
memory: 3928kb

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: 0ms
memory: 3920kb

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: 3ms
memory: 3868kb

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: 2ms
memory: 3892kb

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: 3ms
memory: 3820kb

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: 3888kb

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: 3820kb

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: 4048kb

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: 3ms
memory: 3828kb

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: 1ms
memory: 3880kb

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: 3ms
memory: 3892kb

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: 1ms
memory: 4116kb

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: 1ms
memory: 3772kb

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: 4080kb

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: 3ms
memory: 3824kb

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: 1ms
memory: 3912kb

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: 4ms
memory: 3888kb

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

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
8
4

output:

3
? 0 0
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #28:

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

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
8
4

output:

3
? 0 0
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #29:

score: 0
Accepted
time: 3ms
memory: 3924kb

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
9
5

output:

3
? 0 0
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #30:

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

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
8
4

output:

3
? 0 0
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #31:

score: 0
Accepted
time: 8ms
memory: 3908kb

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
8
4

output:

3
? 0 0
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #32:

score: 0
Accepted
time: 8ms
memory: 3876kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #33:

score: 0
Accepted
time: 11ms
memory: 3876kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #34:

score: 0
Accepted
time: 11ms
memory: 3828kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #35:

score: 0
Accepted
time: 11ms
memory: 3924kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #36:

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

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #37:

score: 0
Accepted
time: 8ms
memory: 3944kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #38:

score: 0
Accepted
time: 8ms
memory: 4056kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #39:

score: 0
Accepted
time: 11ms
memory: 3824kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #40:

score: 0
Accepted
time: 9ms
memory: 4172kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #41:

score: 0
Accepted
time: 11ms
memory: 3880kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #42:

score: 0
Accepted
time: 11ms
memory: 3832kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #43:

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

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #44:

score: 0
Accepted
time: 11ms
memory: 3884kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #45:

score: 0
Accepted
time: 11ms
memory: 3948kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Test #46:

score: 0
Accepted
time: 11ms
memory: 4104kb

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
? 9 8
? 3 2
! S

result:

ok number is guessed.

Extra Test:

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

服务器时间: 2024-12-12 03:15:48 | 开源项目