# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
742407 | maomao90 | Worm Worries (BOI18_worm) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1000005;
int query(int x, int y, int z) {
cout << "? " << x << ' ' << y << ' ' << z << endl;
int ans; cin >> ans;
if (ans == -1) exit(0);
return ans;
}
void guess(int x, int y, int z) {
cout << "! " << x << ' ' << y << ' ' << z << endl;
exit(0);
}
int n, m, k, q;
namespace st2 {
const int MAXN = 1000005;
int qry[MAXN];
int query(int x, int y, int z) {
if (qry[x]) {
return qry[x];
cout << "? " << x << ' ' << y << ' ' << z << endl;
int ans; cin >> ans;
if (ans == -1) exit(0);
return qry[x] = ans;
}
int main() {
int lo = 1, hi = n;
while (lo < hi) {
int mid = lo + hi + 1 >> 1;
int l = query(mid - 1, 1, 1), m = query(mid, 1, 1);
if (l < m) {
lo = mid;
} else {
hi = mid - 1;
}
}
guess(lo, 1, 1);
}
}
int main() {
cin >> n >> m >> k >> q;
if (m == 1 && k == 1) {
st2::main();
}
}