QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#703379 | #9537. Chinese Chess | ucup-team112# | WA | 2ms | 3884kb | C++20 | 23.2kb | 2024-11-02 17:41:42 | 2024-11-02 17:41:44 |
Judging History
answer
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define INTERACTIVE
#include <bits/stdc++.h>
using namespace std;
namespace templates {
// type
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on
// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)
// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on
// const value
const ll MOD1 = 1000000007;
const ll MOD9 = 998244353;
const double PI = acos(-1);
// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)
// function
vector<char> stoc(string &S) {
int n = S.size();
vector<char> ret(n);
for (int i = 0; i < n; i++) ret[i] = S[i];
return ret;
}
string ctos(vector<char> &S) {
int n = S.size();
string ret = "";
for (int i = 0; i < n; i++) ret += S[i];
return ret;
}
template <class T>
auto min(const T &a) {
return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
auto b = clamp(a, l, r);
return (a != b ? a = b, 1 : 0);
}
template <typename T>
T sum(vector<T> &A) {
T tot = 0;
for (auto a : A) tot += a;
return tot;
}
template <typename T>
vector<T> compression(vector<T> X) {
sort(all(X));
X.erase(unique(all(X)), X.end());
return X;
}
// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << ' ';
}
return os;
}
// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
for (auto &a : A) is >> a;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
is >> A.first >> A.second;
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
os << A.first << ' ' << A.second;
return os;
}
// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
is >> A[i];
}
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
for (size_t i = 0; i < A.size(); i++) {
os << A[i];
if (i != A.size() - 1) os << endl;
}
return os;
}
// tuple
template <typename T, size_t N>
struct TuplePrint {
static ostream &print(ostream &os, const T &t) {
TuplePrint<T, N - 1>::print(os, t);
os << ' ' << get<N - 1>(t);
return os;
}
};
template <typename T>
struct TuplePrint<T, 1> {
static ostream &print(ostream &os, const T &t) {
os << get<0>(t);
return os;
}
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
return os;
}
// io functions
void FLUSH() {
cout << flush;
}
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(Tail)) cout << spa;
print(std::forward<Tail>(tail)...);
}
template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
int n = A.size();
for (int i = 0; i < n; i++) {
cout << A[i];
if (i != n - 1) cout << sep;
}
cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
cout << A << end;
}
template <typename T>
void prispa(T A) {
priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
if (f)
print(A);
else
print(B);
return f;
}
template <class... T>
void inp(T &...a) {
(cin >> ... >> a);
}
} // namespace io
using namespace io;
// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<int>> edges(n, vector<int>());
for (int i = 0; i < m; i++) {
INT(u, v);
u -= indexed;
v -= indexed;
edges[u].push_back(v);
if (!direct) edges[v].push_back(u);
}
return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
return read_edges(n, n - 1, false, indexed);
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
for (int i = 0; i < m; i++) {
INT(u, v);
T w;
inp(w);
u -= indexed;
v -= indexed;
edges[u].push_back({v, w});
if (!direct) edges[v].push_back({u, w});
}
return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
return read_wedges<T>(n, n - 1, false, indexed);
}
// yes / no
namespace yesno {
// yes
inline bool yes(bool f = true) {
cout << (f ? "yes" : "no") << endl;
return f;
}
inline bool Yes(bool f = true) {
cout << (f ? "Yes" : "No") << endl;
return f;
}
inline bool YES(bool f = true) {
cout << (f ? "YES" : "NO") << endl;
return f;
}
// no
inline bool no(bool f = true) {
cout << (!f ? "yes" : "no") << endl;
return f;
}
inline bool No(bool f = true) {
cout << (!f ? "Yes" : "No") << endl;
return f;
}
inline bool NO(bool f = true) {
cout << (!f ? "YES" : "NO") << endl;
return f;
}
// possible
inline bool possible(bool f = true) {
cout << (f ? "possible" : "impossible") << endl;
return f;
}
inline bool Possible(bool f = true) {
cout << (f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool POSSIBLE(bool f = true) {
cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// impossible
inline bool impossible(bool f = true) {
cout << (!f ? "possible" : "impossible") << endl;
return f;
}
inline bool Impossible(bool f = true) {
cout << (!f ? "Possible" : "Impossible") << endl;
return f;
}
inline bool IMPOSSIBLE(bool f = true) {
cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
return f;
}
// Alice Bob
inline bool Alice(bool f = true) {
cout << (f ? "Alice" : "Bob") << endl;
return f;
}
inline bool Bob(bool f = true) {
cout << (f ? "Bob" : "Alice") << endl;
return f;
}
// Takahashi Aoki
inline bool Takahashi(bool f = true) {
cout << (f ? "Takahashi" : "Aoki") << endl;
return f;
}
inline bool Aoki(bool f = true) {
cout << (f ? "Aoki" : "Takahashi") << endl;
return f;
}
} // namespace yesno
using namespace yesno;
} // namespace templates
using namespace templates;
void solve() {
INT(n);
VEC(Pll, RC, n);
const int h = 10;
const int w = 9;
auto dist = [&](int r, int c, char s) -> vector<vector<int>> {
vvec(int, D, h, w, -1);
if (s == 'C') {
fori(i, h) fori(j, w) {
D[i][j] = 2;
if (i == r) D[i][j]--;
if (j == c) D[i][j]--;
}
} else if (s == 'B') {
fori(i, h) fori(j, w) {
if (i < r)
D[i][j] = -1;
else if (i <= 4) {
if (j == c)
D[i][j] = i - r;
else
D[i][j] = -1;
} else {
D[i][j] = abs(i - r) + abs(j - c);
}
}
} else {
vec(Pll, didj, 0);
if (s == 'J') {
didj = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
} else if (s == 'S') {
didj = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
} else if (s == 'X') {
didj = {{2, 2}, {2, -2}, {-2, 2}, {-2, -2}};
} else {
didj = {{1, 2}, {2, 1}, {1, -2}, {2, -1}, {-1, 2}, {-2, 1}, {-1, -2}, {-2, -1}};
}
D[r][c] = 0;
queue<Pll> q;
q.push({r, c});
while (!q.empty()) {
auto [i, j] = q.front();
q.pop();
for (auto [di, dj] : didj) {
int ni = i + di;
int nj = j + dj;
if (0 <= ni and ni < h and 0 <= nj and nj < w and D[ni][nj] == -1) {
D[ni][nj] = D[i][j] + 1;
q.push({ni, nj});
}
}
}
}
return D;
};
string S = "JSCMXB";
vvvec(int, dists, 6 * n, h, w);
fori(i, n) {
fori(j, 6) {
dists[i * 6 + j] = dist(RC[i].first, RC[i].second, S[j]);
}
}
// 1
fori(i, h) fori(j, w) {
map<int, char> memo;
bool ok = true;
fori(t, 6 * n) {
char s = S[t % 6];
int d = dists[t][i][j];
if (!memo.count(d)) {
memo[d] = s;
} else if (memo[d] != s) {
ok = false;
break;
}
}
if (!ok) continue;
print(1);
print("?", i, j);
INT(d);
print("!", memo[d]);
return;
}
// 2
fori(i, h) fori(j, w) {
map<int, vector<int>> memo;
fori(t, 6 * n) {
int d = dists[t][i][j];
memo[d].push_back(t);
}
bool ok = true;
map<int, Pii> npos;
map<int, map<int, char>> nex_memo;
for (auto &tmp : memo) {
auto &v = tmp.second;
bool ok2 = false;
fori(i2, h) {
fori(j2, w) {
map<int, char> memo2;
bool ok3 = true;
for (auto t : v) {
char s = S[t % 6];
int d = dists[t][i2][j2];
if (!memo2.count(d)) {
memo2[d] = s;
} else if (memo2[d] != s) {
ok3 = false;
break;
}
}
if (!ok3) continue;
ok2 = true;
npos[tmp.first] = {i2, j2};
nex_memo[tmp.first] = memo2;
break;
}
if (ok2) break;
}
if (!ok2) {
ok = false;
break;
}
}
if (!ok) continue;
print(2);
print("?", i, j);
INT(d);
print("?", npos[d].first, npos[d].second);
INT(d2);
print("!", nex_memo[d][d2]);
return;
}
// 3
print(3);
print("?", 9, 0);
INT(d);
if (d == -1) {
print("?", 9, 1);
INT(a);
print("?", 8, 0);
INT(b);
if (a != -1 and b != -1) {
print("!", "S");
} else {
print("!", "X");
}
return;
}
print("?", 9, 8);
INT(d2);
if (d2 == -1) {
print("?", 8, 1);
INT(d3);
if (d3 == -1) {
print("!", "X");
} else {
print("!", "S");
}
return;
}
if (d <= 2 and d2 <= 2) {
if (d <= 1 or d2 <= 1) {
print("!", "C");
return;
}
print("?", 0, 0);
INT(d3);
if (d3 >= 3) {
print("!", "M");
} else {
print("!", "C");
}
return;
}
if ((d + d2) % 2 != 0) {
print("!", "M");
return;
}
int r_ = 9 - ((d + d2 - 8) / 2);
int c_ = d - (9 - r_);
int idx = -1;
fori(i, n) {
if (RC[i].first == r_ and RC[i].second == c_) {
idx = i;
break;
}
}
if (idx == -1) {
print("!", "M");
return;
}
fori(i, h) fori(j, w) {
int db = dists[idx * 6 + 5][i][j];
int dj = dists[idx * 6 + 0][i][j];
int dm = dists[idx * 6 + 3][i][j];
if (db != dj and db != dm and dj != dm) {
print("?", i, j);
INT(d3);
if (d3 == db) {
print("!", "B");
} else if (d3 == dj) {
print("!", "J");
} else {
print("!", "M");
}
return;
}
}
assert(false);
// if (r_ > 0) {
// print("?", r_ - 1, c_);
// } else if (c_ > 0) {
// print("?", r_, c_ - 1);
// } else {
// print("?", r_, c_ + 1);
// }
// INT(d3);
// if (d3 == -1) {
// print("!", "B");
// } else if (d3 == 1) {
// print("!", "J");
// } else {
// print("!", "M");
// }
}
int main() {
#ifndef INTERACTIVE
std::cin.tie(0)->sync_with_stdio(0);
#endif
// std::cout << std::fixed << std::setprecision(12);
int t;
t = 1;
// std::cin >> t;
while (t--) solve();
return 0;
}
// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// void solve() {
// INT(n);
// VEC(Pll, RC, n);
// const int h = 10;
// const int w = 9;
//
// auto dist = [&](int r, int c, char s) -> vector<vector<int>> {
// vvec(int, D, h, w, -1);
// if (s == 'C') {
// fori(i, h) fori(j, w) {
// D[i][j] = 2;
// if (i == r) D[i][j]--;
// if (j == c) D[i][j]--;
// }
// } else if (s == 'B') {
// fori(i, h) fori(j, w) {
// if (i < r)
// D[i][j] = -1;
// else if (i <= 4) {
// if (j == c)
// D[i][j] = i - r;
// else
// D[i][j] = -1;
// } else {
// D[i][j] = abs(i - r) + abs(j - c);
// }
// }
// } else {
// vec(Pll, didj, 0);
// if (s == 'J') {
// didj = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
// } else if (s == 'S') {
// didj = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
// } else if (s == 'X') {
// didj = {{2, 2}, {2, -2}, {-2, 2}, {-2, -2}};
// } else {
// didj = {{1, 2}, {2, 1}, {1, -2}, {2, -1}, {-1, 2}, {-2, 1}, {-1, -2}, {-2, -1}};
// }
//
// D[r][c] = 0;
// queue<Pll> q;
// q.push({r, c});
// while (!q.empty()) {
// auto [i, j] = q.front();
// q.pop();
// for (auto [di, dj] : didj) {
// int ni = i + di;
// int nj = j + dj;
// if (0 <= ni and ni < h and 0 <= nj and nj < w and D[ni][nj] == -1) {
// D[ni][nj] = D[i][j] + 1;
// q.push({ni, nj});
// }
// }
// }
// }
// return D;
// };
//
// string S = "JSCMXB";
// vvvec(int, dists, 6 * n, h, w);
// fori(i, n) {
// fori(j, 6) {
// dists[i * 6 + j] = dist(RC[i].first, RC[i].second, S[j]);
// }
// }
//
// // 1
// fori(i, h) fori(j, w) {
// map<int, char> memo;
// bool ok = true;
// fori(t, 6 * n) {
// char s = S[t % 6];
// int d = dists[t][i][j];
// if (!memo.count(d)) {
// memo[d] = s;
// } else if (memo[d] != s) {
// ok = false;
// break;
// }
// }
// if (!ok) continue;
//
// print(1);
// print("?", i, j);
// INT(d);
// print("!", memo[d]);
// return;
// }
//
// // 2
// fori(i, h) fori(j, w) {
// map<int, vector<int>> memo;
// fori(t, 6 * n) {
// int d = dists[t][i][j];
// memo[d].push_back(t);
// }
//
// bool ok = true;
// map<int, Pii> npos;
// map<int, map<int, char>> nex_memo;
// for (auto &tmp : memo) {
// auto &v = tmp.second;
//
// bool ok2 = false;
//
// fori(i2, h) {
// fori(j2, w) {
// map<int, char> memo2;
// bool ok3 = true;
// for (auto t : v) {
// char s = S[t % 6];
// int d = dists[t][i2][j2];
// if (!memo2.count(d)) {
// memo2[d] = s;
// } else if (memo2[d] != s) {
// ok3 = false;
// break;
// }
// }
// if (!ok3) continue;
// ok2 = true;
// npos[tmp.first] = {i2, j2};
// nex_memo[tmp.first] = memo2;
// break;
// }
// if (ok2) break;
// }
// if (!ok2) {
// ok = false;
// break;
// }
// }
//
// if (!ok) continue;
//
// print(2);
// print("?", i, j);
// INT(d);
// print("?", npos[d].first, npos[d].second);
// INT(d2);
// print("!", nex_memo[d][d2]);
// return;
// }
//
// // 3
//
// print(3);
// print("?", 9, 0);
// INT(d);
// if (d == -1) {
// print("?", 9, 1);
// INT(a);
// print("?", 8, 0);
// INT(b);
// if (a != -1 and b != -1) {
// print("!", "S");
// } else {
// print("!", "X");
// }
// return;
// }
// print("?", 9, 8);
// INT(d2);
// if (d2 == -1) {
// print("?", 8, 1);
// INT(d3);
// if (d3 == -1) {
// print("!", "X");
// } else {
// print("!", "S");
// }
// return;
// }
// if (d <= 2 and d2 <= 2) {
// if (d <= 1 or d2 <= 1) {
// print("!", "C");
// return;
// }
// print("?", 0, 0);
// INT(d3);
// if (d3 >= 3) {
// print("!", "M");
// } else {
// print("!", "C");
// }
// return;
// }
//
// if ((d + d2) % 2 != 0) {
// print("!", "M");
// return;
// }
//
// int r_ = 9 - ((d + d2 - 8) / 2);
// int c_ = d - (9 - r_);
//
// int idx = -1;
// fori(i, n) {
// if (RC[i].first == r_ and RC[i].second == c_) {
// idx = i;
// break;
// }
// }
//
// if (idx == -1) {
// print("!", "M");
// return;
// }
//
// fori(i, h) fori(j, w) {
// int db = dists[idx * 6 + 5][i][j];
// int dj = dists[idx * 6 + 0][i][j];
// int dm = dists[idx * 6 + 3][i][j];
// if (db != dj and db != dm and dj != dm) {
// print("?", i, j);
// INT(d3);
// if (d3 == db) {
// print("!", "B");
// } else if (d3 == dj) {
// print("!", "J");
// } else {
// print("!", "M");
// }
// return;
// }
// }
//
// assert(false);
//
// // if (r_ > 0) {
// // print("?", r_ - 1, c_);
// // } else if (c_ > 0) {
// // print("?", r_, c_ - 1);
// // } else {
// // print("?", r_, c_ + 1);
// // }
// // INT(d3);
// // if (d3 == -1) {
// // print("!", "B");
// // } else if (d3 == 1) {
// // print("!", "J");
// // } else {
// // print("!", "M");
// // }
// }
//
// int main() {
// #ifndef INTERACTIVE
// std::cin.tie(0)->sync_with_stdio(0);
// #endif
// // std::cout << std::fixed << std::setprecision(12);
// int t;
// t = 1;
// // std::cin >> t;
// while (t--) solve();
// return 0;
// }
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3556kb
input:
1 9 0 8
output:
1 ? 1 8 ! S
result:
ok number is guessed.
Test #2:
score: 0
Accepted
time: 1ms
memory: 3620kb
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: 3560kb
input:
1 2 4 -1 1
output:
2 ? 0 0 ? 0 2 ! X
result:
ok number is guessed.
Test #4:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 5 0 6
output:
1 ? 3 6 ! S
result:
ok number is guessed.
Test #5:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
1 6 0 6
output:
1 ? 0 2 ! S
result:
ok number is guessed.
Test #6:
score: 0
Accepted
time: 1ms
memory: 3500kb
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: 3784kb
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: 1ms
memory: 3652kb
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: 0ms
memory: 3632kb
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: 3688kb
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: 1ms
memory: 3696kb
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: 2ms
memory: 3644kb
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: 1ms
memory: 3624kb
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: 2ms
memory: 3808kb
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: 3796kb
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: 1ms
memory: 3648kb
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: 1ms
memory: 3644kb
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: 1ms
memory: 3536kb
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: 3648kb
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: 1ms
memory: 3884kb
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: 3648kb
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: 0ms
memory: 3648kb
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: 1ms
memory: 3600kb
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: 2ms
memory: 3636kb
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: 3804kb
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: 2ms
memory: 3840kb
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: -100
Wrong Answer
time: 0ms
memory: 3832kb
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 3 5 -1
output:
3 ? 9 0 ? 9 8 ? 0 0 ! B
result:
wrong answer correct but in a random way.(6 3 2)