QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#702579#9537. Chinese Chessucup-team087#AC ✓29ms4312kbC++145.3kb2024-11-02 16:14:122024-11-02 16:14:15

Judging History

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

  • [2024-11-02 16:14:15]
  • 评测
  • 测评结果:AC
  • 用时:29ms
  • 内存:4312kb
  • [2024-11-02 16:14:12]
  • 提交

answer

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int K = 6;
constexpr int M = 10;
constexpr int N = 9;
const string STR = "JSCMXB";

int id(int x, int y) {
  return x * N + y;
}

int dist[K][M][N][M][N];

using Cand = pair<int, pair<int, int>>;
int check(int q, const vector<Cand> &cands) {
  if (!cands.size()) return -2;
  {
    const int k0 = cands[0].first;
    bool same = true;
    for (const auto &c : cands) same = same && (k0 == c.first);
    if (same) return -2;
  }
  if (q == 0) return -1;
  for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
    vector<Cand> css[32];
    for (const auto &c : cands) {
      const int d = dist[c.first][c.second.first][c.second.second][x][y];
      css[1 + d].push_back(c);
    }
    bool ok = true;
    for (int d = -1; d <= 30; ++d) {
      if (!~check(q - 1, css[1 + d])) {
        ok = false;
        break;
      }
    }
    if (ok) {
      return id(x, y);
    }
  }
  return -1;
}

void solve(int q, const vector<Cand> &cands) {
// cerr<<"[solve] "<<q<<" "<<cands<<endl;
  const int res = check(q, cands);
  assert(~res);
  if (res == -2) {
    assert(cands.size());
    const int k0 = cands[0].first;
    printf("! %c\n", STR[k0]); fflush(stdout);
    return;
  }
  const int x = res / N, y = res % N;
  printf("? %d %d\n", x, y); fflush(stdout);
  int D;
  scanf("%d", &D);
  vector<Cand> cs;
  for (const auto &c : cands) {
    if (D == dist[c.first][c.second.first][c.second.second][x][y]) {
      cs.push_back(c);
    }
  }
  solve(q - 1, cs);
}

int main() {
  memset(dist, ~0, sizeof(dist));
  for (int k = 0; k < K; ++k) {
    for (int sx = 0; sx < M; ++sx) for (int sy = 0; sy < N; ++sy) {
      auto d = dist[k][sx][sy];
      queue<pair<int, int>> que;
      d[sx][sy] = 0;
      que.emplace(sx, sy);
      for (; que.size(); ) {
        const int x = que.front().first;
        const int y = que.front().second;
        que.pop();
        auto f = [&](int xx, int yy) -> void {
          if (0 <= xx && xx < M && 0 <= yy && yy < N) {
            if (!~d[xx][yy]) {
              d[xx][yy] = d[x][y] + 1;
              que.emplace(xx, yy);
            }
          }
        };
        const int r = x;
        const int c = y;
        switch (STR[k]) {
          case 'J': {
            f(r + 1, c); f(r - 1, c); f(r, c + 1); f(r, c - 1);
          } break;
          case 'S': {
            f(r + 1, c + 1); f(r + 1, c - 1); f(r - 1, c + 1); f(r - 1, c - 1);
          } break;
          case 'C': {
            for (int rr = 0; rr < M; ++rr) f(rr, c);
            for (int cc = 0; cc < N; ++cc) f(r, cc);
          } break;
          case 'M': {
            f(r + 2, c + 1); f(r + 2, c - 1); f(r - 2, c + 1); f(r - 2, c - 1);
            f(r + 1, c + 2); f(r + 1, c - 2); f(r - 1, c + 2); f(r - 1, c - 2);
          } break;
          case 'X': {
            f(r + 2, c + 2); f(r + 2, c - 2); f(r - 2, c + 2); f(r - 2, c - 2);
          } break;
          case 'B': {
            if (r <= 4) {
              f(r + 1, c);
            } else {
              f(r + 1, c); f(r, c + 1); f(r, c - 1);
            }
          } break;
          default: assert(false);
        }
      }
/*
if((sx==0||sx==M-1)&&(sy==0||sy==N-1)){
 cerr<<STR[k]<<" "<<sx<<" "<<sy<<endl;
 for(int x=0;x<M;++x)pv(d[x],d[x]+N);
 cerr<<endl;
}
*/
      for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
        assert(-1 <= d[x][y]); assert(d[x][y] <= 30);
      }
    }
  }
  
  vector<Cand> all;
  for (int k = 0; k < K; ++k) for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
    all.emplace_back(k, make_pair(x, y));
  }
  const int res = check(3, all);
  assert(~res);
cerr<<"OK! "<<res<<endl;
  
  int P;
  scanf("%d", &P);
  vector<int> X(P), Y(P);
  for (int p = 0; p < P; ++p) {
    scanf("%d%d", &X[p], &Y[p]);
  }
  vector<Cand> cands;
  for (int k = 0; k < K; ++k) for (int p = 0; p < P; ++p) {
    cands.emplace_back(k, make_pair(X[p], Y[p]));
  }
  for (int q = 0; ; ++q) {
    if (~check(q, cands)) {
      printf("%d\n", q); fflush(stdout);
      solve(q, cands);
      break;
    }
  }
  return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1
9 0
8

output:

1
? 1 8
! S

result:

ok number is guessed.

Test #2:

score: 0
Accepted
time: 4ms
memory: 4092kb

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

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

input:

1
5 0
6

output:

1
? 3 6
! S

result:

ok number is guessed.

Test #5:

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

input:

1
6 0
6

output:

1
? 0 2
! S

result:

ok number is guessed.

Test #6:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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