Submission #959504

#TimeUsernameProblemLanguageResultExecution timeMemory
959504idasWorm Worries (BOI18_worm)C++11
10 / 100
1 ms356 KiB
#include <iostream>
#include <cstdlib>
using namespace std;

int main(){
	int n, m, k, maxq;
	cin >> n >> m >> k >> maxq;
	// m, k should be 1

	int lo = 1, hi = n+1;
	// we want local maximum somewhere in [lo, hi)
	while(lo+1 < hi){
		int mi = (lo + hi) / 2;

		int r1, r2;
		cout << "? " << mi-1 << " 1 1" << endl;
		cin >> r1;
		if (r1 == -1) exit(0);
		cout << "? " << mi   << " 1 1" << endl;
		cin >> r2;
		if (r2 == -1) exit(0);

		if(r1 >= r2) hi = mi;
		else lo = mi;
	}

	cout << "! " << lo << " 1 1" << endl;
}
#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...