QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#730526#9537. Chinese ChessTheZoneAC ✓199ms9676kbC++1415.7kb2024-11-09 20:34:562024-11-09 20:34:56

Judging History

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

  • [2024-11-09 20:34:56]
  • 评测
  • 测评结果：AC
  • 用时：199ms
  • 内存：9676kb
查看
  • [2024-11-09 20:34:56]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 100;
int id(int x,int y){return x*9+y;}
string chess = "JSCMXB";
vector<pii> way[6];
int dis[6][N][N];
void bfs(int o,int sx,int sy){
    int w = id(sx,sy);
    dis[o][w][w] = 0;
    queue<pii> q; q.emplace(sx,sy);
    while(!q.empty()){
        auto [x,y] = q.front(); q.pop();
        int u = id(x,y);
        for(auto &[dx,dy] : way[o]){
            if(o == 5 && x <= 4 && dy) continue;
            int nx = x+dx,ny = y+dy;
            if(nx < 0 || ny < 0 || nx > 9 || ny > 8) continue;
            int v = id(nx,ny);
            if(dis[o][w][v] == -1){
                dis[o][w][v] = dis[o][w][u]+1;
                q.emplace(nx,ny);
            }
        }
    }
}
void init(){
    way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
    memset(dis,-1,sizeof(dis));
    for(int i=0;i<6;i++) for(int x=0;x<=9;x++)
    for(int y=0;y<=8;y++) bfs(i,x,y);
}
int n;
using info = vector<tuple<int,int,int>>;
map<info,bool> f[5];
map<info,pii> g[5];
bool chk(info A){
    for(auto [x,y,z] : A)
        if(z != get<2>(A[0])) return false;
    return true;
}
bool dfs(info A,int d){
    if(f[d].count(A)) return f[d][A];
    if(chk(A)) return f[d][A] = 1;
    if(!d) return false;
    for(int i=0;i<=9;i++) for(int j=0;j<=8;j++){
        int u = id(i,j);
        map<int,info> mp;
        for(auto [x,y,o] : A)
            mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
        bool flag = true;
        for(auto [a,b] : mp) flag &= dfs(b,d-1);
        if(flag){
            g[d][A] = mk(i,j);
            return f[d][A] = true;
        }
    }
    return f[d][A] = false;
}
int ask(int x,int y){
    cout << "? " <<  x << " " << y << endl;
    return read();
}
void answer(char c,int d=0){
    while(d--) cout << "? 0 0" << endl;
    cout << "! " << c << endl;
}
void query(info A,int d){
    if(chk(A)) return answer(chess[get<2>(A[0])],d);
    auto [i,j] = g[d][A];
    int u = id(i,j);
    map<int,info> mp;
    for(auto [x,y,o] : A)
        mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
    int res = ask(i,j);
    query(mp[res],d-1);
}
int main(){
    init();
    n = read();
    info A;
    for(int i=1;i<=n;i++){
        int x = read(),y = read();
        for(int o=0;o<6;o++) A.emplace_back(x,y,o);
    }
    int d = 0;
    while(true){
        d++;
        if(dfs(A,d)){
            cout << d << endl;
            query(A,d);
            return 0;
        }
    }
	return 0;
}
/*#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 100;
int id(int x,int y){return x*9+y;}
string chess = "JSCMXB";
vector<pii> way[6];
int dis[6][N][N];
void bfs(int o,int sx,int sy){
    int w = id(sx,sy);
    dis[o][w][w] = 0;
    queue<pii> q; q.emplace(sx,sy);
    while(!q.empty()){
        auto [x,y] = q.front(); q.pop();
        int u = id(x,y);
        for(auto &[dx,dy] : way[o]){
            if(o == 5 && x <= 4 && dy) continue;
            int nx = x+dx,ny = y+dy;
            if(nx < 0 || ny < 0 || nx > 9 || ny > 8) continue;
            int v = id(nx,ny);
            if(dis[o][w][v] == -1){
                dis[o][w][v] = dis[o][w][u]+1;
                q.emplace(nx,ny);
            }
        }
    }
}
void init(){
    way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
    memset(dis,-1,sizeof(dis));
    for(int i=0;i<6;i++) for(int x=0;x<=9;x++)
    for(int y=0;y<=8;y++) bfs(i,x,y);
}
int n;
using info = vector<tuple<int,int,int>>;
map<info,bool> f[5];
map<info,pii> g[5];
bool chk(info A){
    for(auto [x,y,z] : A)
        if(z != get<2>(A[0])) return false;
    return true;
}
bool dfs(info A,int d){
    if(f[d].count(A)) return f[d][A];
    if(chk(A)) return f[d][A] = 1;
    if(!d) return false;
    for(int i=0;i<=9;i++) for(int j=0;j<=8;j++){
        int u = id(i,j);
        map<int,info> mp;
        for(auto [x,y,o] : A)
            mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
        bool flag = true;
        for(auto [a,b] : mp) flag &= dfs(b,d-1);
        if(flag){
            g[d][A] = mk(i,j);
            return f[d][A] = true;
        }
    }
    return f[d][A] = false;
}
int ask(int x,int y){
    cout << "? " <<  x << " " << y << endl;
    return read();
}
void answer(char c,int d=0){
    while(d--) cout << "? 0 0" << endl;
    cout << "! " << c << endl;
}
void query(info A,int d){
    if(chk(A)) return answer(chess[get<2>(A[0])],d);
    auto [i,j] = g[d][A];
    int u = id(i,j);
    map<int,info> mp;
    for(auto [x,y,o] : A)
        mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
    int res = ask(i,j);
    query(mp[res],d-1);
}
int main(){
    init();
    n = read();
    info A;
    for(int i=1;i<=n;i++){
        int x = read(),y = read();
        for(int o=0;o<6;o++) A.emplace_back(x,y,o);
    }
    int d = 0;
    while(true){
        d++;
        if(dfs(A,d)){
            cout << d << endl;
            query(A,d);
            return 0;
        }
    }
	return 0;
} #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 100;
int id(int x,int y){return x*9+y;}
string chess = "JSCMXB";
vector<pii> way[6];
int dis[6][N][N];
void bfs(int o,int sx,int sy){
    int w = id(sx,sy);
    dis[o][w][w] = 0;
    queue<pii> q; q.emplace(sx,sy);
    while(!q.empty()){
        auto [x,y] = q.front(); q.pop();
        int u = id(x,y);
        for(auto &[dx,dy] : way[o]){
            if(o == 5 && x <= 4 && dy) continue;
            int nx = x+dx,ny = y+dy;
            if(nx < 0 || ny < 0 || nx > 9 || ny > 8) continue;
            int v = id(nx,ny);
            if(dis[o][w][v] == -1){
                dis[o][w][v] = dis[o][w][u]+1;
                q.emplace(nx,ny);
            }
        }
    }
}
void init(){
    way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
    memset(dis,-1,sizeof(dis));
    for(int i=0;i<6;i++) for(int x=0;x<=9;x++)
    for(int y=0;y<=8;y++) bfs(i,x,y);
}
int n;
using info = vector<tuple<int,int,int>>;
map<info,bool> f[5];
map<info,pii> g[5];
bool chk(info A){
    for(auto [x,y,z] : A)
        if(z != get<2>(A[0])) return false;
    return true;
}
bool dfs(info A,int d){
    if(f[d].count(A)) return f[d][A];
    if(chk(A)) return f[d][A] = 1;
    if(!d) return false;
    for(int i=0;i<=9;i++) for(int j=0;j<=8;j++){
        int u = id(i,j);
        map<int,info> mp;
        for(auto [x,y,o] : A)
            mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
        bool flag = true;
        for(auto [a,b] : mp) flag &= dfs(b,d-1);
        if(flag){
            g[d][A] = mk(i,j);
            return f[d][A] = true;
        }
    }
    return f[d][A] = false;
}
int ask(int x,int y){
    cout << "? " <<  x << " " << y << endl;
    return read();
}
void answer(char c,int d=0){
    while(d--) cout << "? 0 0" << endl;
    cout << "! " << c << endl;
}
void query(info A,int d){
    if(chk(A)) return answer(chess[get<2>(A[0])],d);
    auto [i,j] = g[d][A];
    int u = id(i,j);
    map<int,info> mp;
    for(auto [x,y,o] : A)
        mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
    int res = ask(i,j);
    query(mp[res],d-1);
}
int main(){
    init();
    n = read();
    info A;
    for(int i=1;i<=n;i++){
        int x = read(),y = read();
        for(int o=0;o<6;o++) A.emplace_back(x,y,o);
    }
    int d = 0;
    while(true){
        d++;
        if(dfs(A,d)){
            cout << d << endl;
            query(A,d);
            return 0;
        }
    }
	return 0;
} #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 100;
int id(int x,int y){return x*9+y;}
string chess = "JSCMXB";
vector<pii> way[6];
int dis[6][N][N];
void bfs(int o,int sx,int sy){
    int w = id(sx,sy);
    dis[o][w][w] = 0;
    queue<pii> q; q.emplace(sx,sy);
    while(!q.empty()){
        auto [x,y] = q.front(); q.pop();
        int u = id(x,y);
        for(auto &[dx,dy] : way[o]){
            if(o == 5 && x <= 4 && dy) continue;
            int nx = x+dx,ny = y+dy;
            if(nx < 0 || ny < 0 || nx > 9 || ny > 8) continue;
            int v = id(nx,ny);
            if(dis[o][w][v] == -1){
                dis[o][w][v] = dis[o][w][u]+1;
                q.emplace(nx,ny);
            }
        }
    }
}
void init(){
    way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
    memset(dis,-1,sizeof(dis));
    for(int i=0;i<6;i++) for(int x=0;x<=9;x++)
    for(int y=0;y<=8;y++) bfs(i,x,y);
}
int n;
using info = vector<tuple<int,int,int>>;
map<info,bool> f[5];
map<info,pii> g[5];
bool chk(info A){
    for(auto [x,y,z] : A)
        if(z != get<2>(A[0])) return false;
    return true;
}
bool dfs(info A,int d){
    if(f[d].count(A)) return f[d][A];
    if(chk(A)) return f[d][A] = 1;
    if(!d) return false;
    for(int i=0;i<=9;i++) for(int j=0;j<=8;j++){
        int u = id(i,j);
        map<int,info> mp;
        for(auto [x,y,o] : A)
            mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
        bool flag = true;
        for(auto [a,b] : mp) flag &= dfs(b,d-1);
        if(flag){
            g[d][A] = mk(i,j);
            return f[d][A] = true;
        }
    }
    return f[d][A] = false;
}
int ask(int x,int y){
    cout << "? " <<  x << " " << y << endl;
    return read();
}
void answer(char c,int d=0){
    while(d--) cout << "? 0 0" << endl;
    cout << "! " << c << endl;
}
void query(info A,int d){
    if(chk(A)) return answer(chess[get<2>(A[0])],d);
    auto [i,j] = g[d][A];
    int u = id(i,j);
    map<int,info> mp;
    for(auto [x,y,o] : A)
        mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
    int res = ask(i,j);
    query(mp[res],d-1);
}
int main(){
    init();
    n = read();
    info A;
    for(int i=1;i<=n;i++){
        int x = read(),y = read();
        for(int o=0;o<6;o++) A.emplace_back(x,y,o);
    }
    int d = 0;
    while(true){
        d++;
        if(dfs(A,d)){
            cout << d << endl;
            query(A,d);
            return 0;
        }
    }
	return 0;
} #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 100;
int id(int x,int y){return x*9+y;}
string chess = "JSCMXB";
vector<pii> way[6];
int dis[6][N][N];
void bfs(int o,int sx,int sy){
    int w = id(sx,sy);
    dis[o][w][w] = 0;
    queue<pii> q; q.emplace(sx,sy);
    while(!q.empty()){
        auto [x,y] = q.front(); q.pop();
        int u = id(x,y);
        for(auto &[dx,dy] : way[o]){
            if(o == 5 && x <= 4 && dy) continue;
            int nx = x+dx,ny = y+dy;
            if(nx < 0 || ny < 0 || nx > 9 || ny > 8) continue;
            int v = id(nx,ny);
            if(dis[o][w][v] == -1){
                dis[o][w][v] = dis[o][w][u]+1;
                q.emplace(nx,ny);
            }
        }
    }
}
void init(){
    way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
    memset(dis,-1,sizeof(dis));
    for(int i=0;i<6;i++) for(int x=0;x<=9;x++)
    for(int y=0;y<=8;y++) bfs(i,x,y);
}
int n;
using info = vector<tuple<int,int,int>>;
map<info,bool> f[5];
map<info,pii> g[5];
bool chk(info A){
    for(auto [x,y,z] : A)
        if(z != get<2>(A[0])) return false;
    return true;
}
bool dfs(info A,int d){
    if(f[d].count(A)) return f[d][A];
    if(chk(A)) return f[d][A] = 1;
    if(!d) return false;
    for(int i=0;i<=9;i++) for(int j=0;j<=8;j++){
        int u = id(i,j);
        map<int,info> mp;
        for(auto [x,y,o] : A)
            mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
        bool flag = true;
        for(auto [a,b] : mp) flag &= dfs(b,d-1);
        if(flag){
            g[d][A] = mk(i,j);
            return f[d][A] = true;
        }
    }
    return f[d][A] = false;
}
int ask(int x,int y){
    cout << "? " <<  x << " " << y << endl;
    return read();
}
void answer(char c,int d=0){
    while(d--) cout << "? 0 0" << endl;
    cout << "! " << c << endl;
}
void query(info A,int d){
    if(chk(A)) return answer(chess[get<2>(A[0])],d);
    auto [i,j] = g[d][A];
    int u = id(i,j);
    map<int,info> mp;
    for(auto [x,y,o] : A)
        mp[dis[o][id(x,y)][u]].emplace_back(x,y,o);
    int res = ask(i,j);
    query(mp[res],d-1);
}
int main(){
    init();
    n = read();
    info A;
    for(int i=1;i<=n;i++){
        int x = read(),y = read();
        for(int o=0;o<6;o++) A.emplace_back(x,y,o);
    }
    int d = 0;
    while(true){
        d++;
        if(dfs(A,d)){
            cout << d << endl;
            query(A,d);
            return 0;
        }
    }
	return 0;
} */
Source code, Language: C++14

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

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

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

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

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

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

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Server Time: 2024-12-04 03:55:47 | OpenSource Project