Submission #223860

#	Time	Username	Problem	Language	Result	Execution time	Memory
223860		Bruteforceman	Worm Worries (BOI18_worm)	C++11	10 / 100	5 ms	512 KiB

worm

#include <bits/stdc++.h>
using namespace std;
int n, m, k, q;
map <tuple <int, int, int>, int> mem;

int query(int x, int y, int z) {
  if(mem.find(make_tuple(x, y, z)) != mem.end()) return mem[make_tuple(x, y, z)];
  cout << "? " << x << " " << y << " " << z << endl;
  int ans;
  cin >> ans;
  if(ans == -1) exit(0);
  return mem[make_tuple(x, y, z)] = ans;
}
/* this function solves the m = k = 1 case */
int search(int b, int e) {
  if(b == e) {
    return b;
  }
  int m = (b + e) >> 1;
  if(query(m, 1, 1) < query(m + 1, 1, 1)) return search(m + 1, e);
  else return search(b, m);
}
int main() {
  cin >> n >> m >> k >> q;
  assert(k == 1 && m == 1);
  int ans = search(1, n);
  cout << "! " << ans << " 1 1" << endl;
  return 0;

}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 22
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 14
• Subtask 6: 0 / 23