QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#706313#9537. Chinese Chessucup-team1134#AC ✓35ms3996kbC++2312.2kb2024-11-03 10:19:292024-11-03 10:19:31

Judging History

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

  • [2024-11-03 10:19:31]
  • 评测
  • 测评结果:AC
  • 用时:35ms
  • 内存:3996kb
  • [2024-11-03 10:19:29]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

vi dh[6],dw[6];
string U="JSCMXB";

int dis[6][10][9][10][9];
int H=10,W=9;

void init(){
    {
        int q=0;
        dh[q]={0,1,0,-1};
        dw[q]={1,0,-1,0};
    }
    
    {
        int q=1;
        dh[q]={-1,1,1,-1};
        dw[q]={1,1,-1,-1};
    }
    
    {
        int q=2;
        for(int h=-9;h<=9;h++){
            if(h==0) continue;
            dh[q].pb(h);
            dw[q].pb(0);
        }
        for(int w=-8;w<=8;w++){
            if(w==0) continue;
            dh[q].pb(0);
            dw[q].pb(w);
        }
    }
    
    {
        int q=3;
        dh[q]={-2,-1,1,2,2,1,-1,-2};
        dw[q]={1,2,2,1,-1,-2,-2,-1};
    }
    
    {
        int q=4;
        dh[q]={-2,2,2,-2};
        dw[q]={2,2,-2,-2};
    }
    
    {
        int q=5;
        dh[q]={1,0,0};
        dw[q]={0,-1,1};
    }
    
    for(int q=0;q<6;q++){
        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                for(int s=0;s<H;s++){
                    for(int t=0;t<W;t++){
                        dis[q][i][j][s][t]=INF;
                    }
                }
                dis[q][i][j][i][j]=0;
                queue<pair<int,int>> Q;
                Q.push(mp(i,j));
                
                while(!Q.empty()){
                    auto [h,w]=Q.front();Q.pop();
                    for(int k=0;k<si(dh[q]);k++){
                        if(q==5&&h<=4&&k) continue;
                        int toh=h+dh[q][k],tow=w+dw[q][k];
                        if(toh<0||toh>=H||tow<0||tow>=W) continue;
                        if(chmin(dis[q][i][j][toh][tow],dis[q][i][j][h][w]+1)) Q.push({toh,tow});
                    }
                }
                
                for(int s=0;s<H;s++){
                    for(int t=0;t<W;t++){
                        if(dis[q][i][j][s][t]==INF) dis[q][i][j][s][t]=-1;
                        //dis[q][i][j][s][t]=INF;
                    }
                }
            }
        }
    }
}

int main(){
    
    init();
    
    int N;cin>>N;
    
    vii cand;
    for(int i=0;i<N;i++){
        int a,b;cin>>a>>b;
        //a=i/W;b=i%W;
        cand.pb(mp(a,b));
    }
    
    for(int s1=0;s1<H;s1++){
        for(int t1=0;t1<W;t1++){
            map<vi,int> MA;
            bool ok=true;
            for(int q=0;q<6;q++){
                for(auto [i,j]:cand){
                    if(MA.count(vi{dis[q][i][j][s1][t1]})){
                        if(MA[vi{dis[q][i][j][s1][t1]}]!=q){
                            ok=false;
                        }
                    }
                    if(!ok) break;
                    MA[vi{dis[q][i][j][s1][t1]}]=q;
                }
                if(!ok) break;
            }
            if(ok){
                cout<<1<<endl;
                vi X;
                cout<<"? "<<s1<<" "<<t1<<endl;
                int z;cin>>z;
                X.pb(z);
                cout<<"! "<<U[MA[X]]<<endl;
                return 0;
            }
        }
    }
    
    for(int s1=0;s1<H;s1++){
        for(int t1=0;t1<W;t1++){
            map<int,vector<array<int,3>>> MA;
            bool ff=true;
            for(int q=0;q<6;q++){
                for(auto [i,j]:cand){
                    MA[dis[q][i][j][s1][t1]].pb({q,i,j});
                }
            }
            for(auto ddd:MA){
                bool ok=false;
                for(int s2=0;s2<H;s2++){
                    for(int t2=0;t2<W;t2++){
                        bool sei=true;
                        map<int,int> MA;
                        for(auto [q,i,j]:ddd.se){
                            if(MA.count(dis[q][i][j][s2][t2])){
                                if(MA[dis[q][i][j][s2][t2]]!=q) sei=false;
                            }
                            if(!sei) break;
                            MA[dis[q][i][j][s2][t2]]=q;
                        }
                        if(sei){
                            ok=true;
                        }
                        if(ok) break;
                    }
                    
                    if(ok) break;
                }
                ff&=ok;
            }
            
            if(ff){
                cout<<2<<endl;
                cout<<"? "<<s1<<" "<<t1<<endl;
                int z;cin>>z;
                
                {
                    bool ok=false;
                    for(int s2=0;s2<H;s2++){
                        for(int t2=0;t2<W;t2++){
                            bool sei=true;
                            map<int,int> MAA;
                            for(auto [q,i,j]:MA[z]){
                                if(MAA.count(dis[q][i][j][s2][t2])){
                                    if(MAA[dis[q][i][j][s2][t2]]!=q) sei=false;
                                }
                                if(!sei) break;
                                MAA[dis[q][i][j][s2][t2]]=q;
                            }
                            
                            if(sei){
                                cout<<"? "<<s2<<" "<<t2<<endl;
                                int z;cin>>z;
                                cout<<"! "<<U[MAA[z]]<<endl;
                                return 0;
                            }
                        }
                        
                        if(ok) break;
                    }
                }
            }
        }
    }
    
    for(int s1=0;s1<H;s1++){
        for(int t1=0;t1<W;t1++){
            map<int,vector<array<int,3>>> MA;
            bool ff=true;
            for(int q=0;q<6;q++){
                for(auto [i,j]:cand){
                    MA[dis[q][i][j][s1][t1]].pb({q,i,j});
                }
            }
            for(auto ddd:MA){
                bool ok=false;
                for(int s2=0;s2<H;s2++){
                    for(int t2=0;t2<W;t2++){
                        for(int s3=0;s3<H;s3++){
                            for(int t3=0;t3<W;t3++){
                                bool sei=true;
                                map<int,int> MA;
                                for(auto [q,i,j]:ddd.se){
                                    if(MA.count(dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3])){
                                        if(MA[dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3]]!=q) sei=false;
                                    }
                                    if(!sei) break;
                                    MA[dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3]]=q;
                                }
                                if(sei){
                                    ok=true;
                                }
                                if(ok) break;
                            }
                        }
                        
                    }
                    
                    if(ok) break;
                }
                ff&=ok;
            }
            
            if(ff){
                cout<<3<<endl;
                cout<<"? "<<s1<<" "<<t1<<endl;
                int z;cin>>z;
                
                {
                    for(int s2=0;s2<H;s2++){
                        for(int t2=0;t2<W;t2++){
                            for(int s3=0;s3<H;s3++){
                                for(int t3=0;t3<W;t3++){
                                    bool sei=true;
                                    map<int,int> MAA;
                                    for(auto [q,i,j]:MA[z]){
                                        if(MAA.count(dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3])){
                                            if(MAA[dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3]]!=q) sei=false;
                                        }
                                        if(!sei) break;
                                        MAA[dis[q][i][j][s2][t2]*10000+dis[q][i][j][s3][t3]]=q;
                                    }
                                    
                                    if(sei){
                                        cout<<"? "<<s2<<" "<<t2<<endl;
                                        int z;cin>>z;
                                        cout<<"? "<<s3<<" "<<t3<<endl;
                                        int zz;cin>>zz;
                                        cout<<"! "<<U[MAA[z*10000+zz]]<<endl;
                                        return 0;
                                    }
                                }
                            }
                            
                        }
                    }
                }
            }
        }
    }
    
    return 0;
    for(int s1=0;s1<H;s1++){
        for(int t1=0;t1<W;t1++){
            for(int s2=0;s2<H;s2++){
                for(int t2=0;t2<W;t2++){
                    for(int s3=0;s3<H;s3++){
                        for(int t3=0;t3<W;t3++){
                            if(mp(s1,t1)>=mp(s2,t2)) continue;
                            if(mp(s2,t2)>=mp(s3,t3)) continue;
                            map<vi,int> MA;
                            bool ok=true;
                            for(int q=0;q<6;q++){
                                for(auto [i,j]:cand){
                                    if(MA.count(vi{dis[q][i][j][s1][t1],dis[q][i][j][s2][t2],dis[q][i][j][s3][t3]})){
                                        if(MA[vi{dis[q][i][j][s1][t1],dis[q][i][j][s2][t2],dis[q][i][j][s3][t3]}]!=q){
                                            ok=false;
                                        }
                                    }
                                    if(!ok) break;
                                    MA[vi{dis[q][i][j][s1][t1],dis[q][i][j][s2][t2],dis[q][i][j][s3][t3]}]=q;
                                }
                                if(!ok) break;
                                
                            }
                            if(ok){
                                cout<<3<<endl;
                                vi X;
                                cout<<"? "<<s1<<" "<<t1<<endl;
                                int z;cin>>z;
                                X.pb(z);
                                cout<<"? "<<s2<<" "<<t2<<endl;
                                cin>>z;
                                X.pb(z);
                                cout<<"? "<<s3<<" "<<t3<<endl;
                                cin>>z;
                                X.pb(z);
                                cout<<"! "<<MA[X]<<endl;
                                return 0;
                            }
                        }
                    }
                    
                }
            }
        }
    }
    
    {
        vii ans={mp(0,0),mp(0,1),mp(9,0),mp(9,3)};
        
        map<vi,int> MA;
        for(int q=0;q<6;q++){
            for(auto [i,j]:cand){
                vi z;
                for(int k=0;k<4;k++){
                    z.pb(dis[q][i][j][ans[k].fi][ans[k].se]);
                }
                MA[z]=q;
            }
        }
        if(1){
            cout<<4<<endl;
            vi X;
            for(int k=0;k<4;k++){
                cout<<"? "<<ans[k].fi<<" "<<ans[k].se<<endl;
                int z;cin>>z;
                X.pb(z);
            }
            cout<<"! "<<MA[X]<<endl;
            return 0;
        }
    }
    
    
}



这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 3ms
memory: 3808kb

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

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

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

input:

1
2 4
-1
1

output:

2
? 0 0
? 0 2
! X

result:

ok number is guessed.

Test #4:

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

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

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

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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
9

output:

3
? 0 0
? 1 0
? 9 4
! S

result:

ok number is guessed.

Test #28:

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

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

output:

3
? 0 0
? 1 2
? 9 6
! S

result:

ok number is guessed.

Test #29:

score: 0
Accepted
time: 19ms
memory: 3840kb

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
6

output:

3
? 0 0
? 1 0
? 9 4
! S

result:

ok number is guessed.

Test #30:

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

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
2

output:

3
? 0 0
? 1 0
? 9 4
! X

result:

ok number is guessed.

Test #31:

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

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
8

output:

3
? 0 0
? 1 0
? 9 4
! S

result:

ok number is guessed.

Test #32:

score: 0
Accepted
time: 35ms
memory: 3760kb

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

result:

ok number is guessed.

Test #33:

score: 0
Accepted
time: 34ms
memory: 3952kb

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

result:

ok number is guessed.

Test #34:

score: 0
Accepted
time: 33ms
memory: 3712kb

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

result:

ok number is guessed.

Test #35:

score: 0
Accepted
time: 33ms
memory: 3844kb

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

result:

ok number is guessed.

Test #36:

score: 0
Accepted
time: 34ms
memory: 3848kb

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

result:

ok number is guessed.

Test #37:

score: 0
Accepted
time: 34ms
memory: 3760kb

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

result:

ok number is guessed.

Test #38:

score: 0
Accepted
time: 33ms
memory: 3848kb

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

result:

ok number is guessed.

Test #39:

score: 0
Accepted
time: 33ms
memory: 3684kb

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

result:

ok number is guessed.

Test #40:

score: 0
Accepted
time: 33ms
memory: 3836kb

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

result:

ok number is guessed.

Test #41:

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

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

result:

ok number is guessed.

Test #42:

score: 0
Accepted
time: 34ms
memory: 3688kb

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

result:

ok number is guessed.

Test #43:

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

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

result:

ok number is guessed.

Test #44:

score: 0
Accepted
time: 35ms
memory: 3996kb

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

result:

ok number is guessed.

Test #45:

score: 0
Accepted
time: 35ms
memory: 3848kb

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

result:

ok number is guessed.

Test #46:

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

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

result:

ok number is guessed.

Extra Test:

score: 0
Extra Test Passed