QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#764175#9537. Chinese ChessjakerAC ✓193ms4132kbC++205.7kb2024-11-20 03:05:042024-11-20 03:05:06

Judging History

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

  • [2024-11-20 03:05:06]
  • 评测
  • 测评结果：AC
  • 用时：193ms
  • 内存：4132kb
查看
  • [2024-11-20 03:05:04]
  • 提交

answer

// #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define f(i,j,k) dir[i].pb(mp(j,k))
#define ll long long
#define pb push_back
#define mp make_pair
#define y1 Y1
int n,m,mx_dep,mx_dis;
struct node {
    int x,y,tp;
}a[10000];
int dis[6][10][10][10][10];
vector< pair<int,int> > dir[10];
void pre() {
    dir[0].pb(mp(1,0)); dir[0].pb(mp(-1,0)); dir[0].pb(mp(0,1)); dir[0].pb(mp(0,-1));
    dir[1].pb(mp(1,1)); dir[1].pb(mp(1,-1)); dir[1].pb(mp(-1,1)); dir[1].pb(mp(-1,-1));

    rep(i,1,9) dir[2].pb( mp( i , 0 ) ) , dir[2].pb( mp( -i , 0 ) );
    rep(i,1,8) dir[2].pb( mp( 0 , i ) ) , dir[2].pb( mp( 0 , -i ) );

    f(3,2,1); f(3,2,-1); f(3,-2,1); f(3,-2,-1);
    f(3,1,2); f(3,1,-2); f(3,-1,2); f(3,-1,-2);

    f(4,2,2); f(4,2,-2); f(4,-2,2); f(4,-2,-2);

    f(5,1,0); f(5,0,1); f(5,0,-1); f(6,1,0);

    rep(tp,0,5) rep(x,0,9) rep(y,0,8) {
        rep(x1,0,9) rep(y1,0,8) dis[tp][x][y][x1][y1] = 10000;
        dis[tp][x][y][x][y] = 0;
        queue<pair<int,int>>q; q.push(mp(x,y));
        while(!q.empty()) {
            auto [x1,y1] = q.front(); q.pop();
            int t = (tp==5&&x1<=4)?6:tp;
            for(auto [dx,dy]:dir[t]) {
                int nx = x1 + dx , ny = y1 + dy;
                if( nx < 0 || nx > 9 || ny < 0 || ny > 8 ) continue;
                if( dis[tp][x][y][nx][ny] != 10000 ) continue;
                dis[tp][x][y][nx][ny] = dis[tp][x][y][x1][y1] + 1 , q.push( mp( nx , ny ) );
            }
        }
    }
    rep(tp,0,5) rep(x,0,9) rep(y,0,8)
        rep(x1,0,9) rep(y1,0,8)
            if( dis[tp][x][y][x1][y1] != 10000 )
                mx_dis = max( mx_dis , dis[tp][x][y][x1][y1] );
    rep(tp,0,5) rep(x,0,9) rep(y,0,8)
        rep(x1,0,9) rep(y1,0,8)
            if( dis[tp][x][y][x1][y1] == 10000 )
                dis[tp][x][y][x1][y1] = mx_dis + 1;
    // rep(tp,0,5) rep(x,0,9) rep(y,0,8) if( x == 9 && y == 0 ) {
    //     printf("tp = %d\n",tp);
    //     rep(x1,0,9) { 
    //         rep(y1,0,8) 
    //             printf("%d ",dis[tp][x][y][x1][y1]);
    //         printf("\n");
    //     }
    // }
    mx_dis++;
}
void output(int x) {
    cout << x << endl;
    fflush(stdout);
}
vector<int>dis_id[10][25];
int dfs(const vector<int> &pos,int dep) {
    bool vis[7] = {}; int cnt = 0;
    for( auto x : pos ) if(!vis[a[x].tp]) vis[a[x].tp] = true , ++cnt;
    if( cnt == 1 ) return dep - 1;
    if( dep == mx_dep + 1 ) return dep;
    int mn = mx_dep + 1;
    pair<int,int>best;
    rep(x1,0,9) rep(y1,0,8) {
        rep(DIS,0,mx_dis) dis_id[dep][DIS].clear();
        for( auto id : pos ) {
            int tp = a[id].tp , x = a[id].x , y = a[id].y;
            dis_id[dep][ dis[tp][x][y][x1][y1] ].pb( id );
        }
        int mx = 0;
        rep(DIS,0,mx_dis) if( !dis_id[dep][DIS].empty() ) {
            if( (int)(dis_id[dep][DIS].size()) == (int)(pos.size()) )
                mx = mx_dep + 1;
            else 
                mx = max( mx , dfs( dis_id[dep][DIS] , dep + 1 ) );
            if( mx >= mn ) break; 
        }
        if( mx < mn ) mn = mx , best = mp( x1 , y1 );
    }
    return mn;
}
void solve(vector<int> pos,int dep) {
    // printf("#%d\n",dep);
    // for( auto x : pos ) {
    //     printf("%d %d %d\n",a[x].tp,a[x].x,a[x].y);
    // }
    bool vis[7] = {}; int cnt = 0;
    for( auto x : pos ) if(!vis[a[x].tp]) vis[a[x].tp] = true , ++cnt;
    if( cnt == 1 && dep == mx_dep + 1 ) {
        if( a[pos[0]].tp == 0 ) cout << "! J" << endl;
        else if( a[pos[0]].tp == 1 ) cout << "! S" << endl;
        else if( a[pos[0]].tp == 2 ) cout << "! C" << endl;
        else if( a[pos[0]].tp == 3 ) cout << "! M" << endl;
        else if( a[pos[0]].tp == 4 ) cout << "! X" << endl;
        else if( a[pos[0]].tp == 5 ) cout << "! B" << endl;
        return;
    }
    if( cnt == 1 || dep == mx_dep + 1 )
        assert(0);
    int mn = mx_dep + 1;
    pair<int,int>best;
    rep(x1,0,9) rep(y1,0,8) {
        rep(DIS,0,mx_dis) dis_id[dep][DIS].clear();
        for( auto id : pos ) {
            int tp = a[id].tp , x = a[id].x , y = a[id].y;
            dis_id[dep][ dis[tp][x][y][x1][y1] ].pb( id );
        }
        int mx = 0;
        rep(DIS,0,mx_dis) if( !dis_id[dep][DIS].empty() ) {
            if( (int)(dis_id[dep][DIS].size()) == (int)(pos.size()) )
                mx = mx_dep + 1;
            else 
                mx = max( mx , dfs( dis_id[dep][DIS] , dep + 1 ) );
            if( mx >= mn ) break; 
        }
        if( mx < mn ) mn = mx , best = mp( x1 , y1 );
        // if( dep == 1 && x1 == 0 && y1 == 2 ) {
        //     rep(DIS,0,mx_dis) if( !dis_id[dep][DIS].empty() ) {
        //         printf("dis = %d\n",DIS);
        //         for( auto id:dis_id[dep][DIS] ) {
        //             printf("id = %d,%d %d %d\n",id,a[id].tp,a[id].x,a[id].y);
        //         }
        //     }
        // }
    }
    cout << "? " << best.first << " " << best.second << endl;
    fflush(stdout);
    int DIS; cin >> DIS;
    if( DIS == -1 ) DIS = mx_dis;
    auto [x1,y1] = best;
    dis_id[dep][DIS].clear();
    for( auto id : pos ) {
        int tp = a[id].tp , x = a[id].x , y = a[id].y;
        if( dis[tp][x][y][x1][y1] == DIS )
            dis_id[dep][DIS].pb(id);
    }
    solve( dis_id[dep][DIS] , dep + 1 );
}
int main() {
    cin >> n;
    rep(i,1,n) {
        int x,y; cin >> x >> y;
        rep(j,0,5) a[++m] = (node){x,y,j};
    }
    pre();
    vector<int>st; rep(i,1,m) st.pb(i);
    for(mx_dep=1;mx_dep<=5;++mx_dep)
        if( dfs(st,1) == mx_dep ) break;
    output(mx_dep);
    solve(st,1);
	return 0;
}
源文件, 语言: C++20

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

详细

Test #1:

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

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

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

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

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

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

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

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

score: 0
Accepted
time: 1ms
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: 0ms
memory: 3808kb

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 繁體中文 简体中文

服务器时间: 2025-02-03 11:02:10 | 开源项目