QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#664546 | #7156. Find the Box | blackslex# | 0 | 1ms | 3844kb | C++14 | 1.3kb | 2024-10-21 21:07:00 | 2024-10-21 21:07:02 |
answer
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int n, m, px, py;
pii pos;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> m;
string s = "";
auto ask = [&] () {
int r, c;
cout << "? " << s << endl;
cin >> r >> c;
pos = pii(r, c);
return;
};
if (n < m) {
for (int j = 0; j < m - 1; j++) {
s = string(j, '>') + string(n - 1, 'v');
ask();
if (pos != pii(n - 1, j)) {
if (pos.second != j) {
cout << "! " << 0 << ' ' << pos.second + 1 << endl;
} else {
cout << "! " << pos.first + 1 << ' ' << pos.second << endl;
}
return 0;
}
}
} else {
for (int i = 0; i < n - 1; i++) {
s = string(i, 'v') + string(m - 1, '>');
ask();
if (pos != pii(i, m - 1)) {
if (pos.first != i) {
cout << "! " << pos.first + 1 << ' ' << 0 << endl;
} else {
cout << "! " << pos.first << ' ' << pos.second + 1 << endl;
}
return 0;
}
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Acceptable Answer
time: 1ms
memory: 3844kb
input:
4 5 3 0 3 1 3 2 1 3
output:
? vvv ? >vvv ? >>vvv ? >>>vvv ! 2 3
result:
points 0.710 0.71 used 4 queried; score: 71.00