Submission #1194400

#TimeUsernameProblemLanguageResultExecution timeMemory
1194400Valters07Worm Worries (BOI18_worm)C++20
0 / 100
3058 ms440 KiB
#include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt,tune=native") #define fio ios_base::sync_with_stdio(0);cin.tie(0); #define ll long long #define ld long double #define en exit(0); #define pb push_back #define fi first #define se second using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); map<array<int, 3>, int> mp; int ask(int x, int y = 1, int z = 1) { array<int, 3> tmp = {x, y, z}; if(mp.count(tmp)) return mp[tmp]; cout << "? " << x << " " << y << " " << z << endl; int h; cin >> h; return mp[tmp] = h; } void guess(int x, int y = 1, int z = 1) { cout << "! " << x << " " << y << " " << z << endl; } int main() { fio // ifstream cin("in.in"); int n, m, k, q; cin >> n >> m >> k >> q; int l = 1, r = n; while(l < r) { int mid = (l + r) / 2; int vm = ask(mid), vm1 = ask(mid + 1); if(vm < vm1) l = vm1; else r = vm; } guess(l); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...