oj.uz

Submission #896003

# Submission time Handle Problem Language Result Execution time Memory
896003 2023-12-31T12:10:42 Z pcc Worm Worries (BOI18_worm) C++14
0 / 100
 2 ms 4184 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 1e6+10;
int N,M,K;
int dp[mxn];

int C = 0;
int ask(int x,int y = 1,int z = 1){
	cout<<"? "<<x<<' '<<y<<' '<<z<<endl;
	C++;
	int re;
	cin>>re;
	if(re == -1)exit(0);
	return re;
}

int main(){
	memset(dp,-1,sizeof(dp));
	cin>>N>>M>>K;
	int l = 1,r = N;
	while(r-l>1){
		int mid = (l+r)>>1;
		if(ask(mid)>=ask(mid+1))r = mid;
		else l = mid+1;
	}
	if(l == r)cout<<"! "<<l<<" 1 1"<<endl;
	else if(ask(l)<=ask(r))cout<<"! "<<r<<" 1 1"<<endl;
	else cout<<"! "<<l<<" 1 1"<<endl;
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Correct 1 ms 4184 KB Output is correct
3 Incorrect 1 ms 4184 KB not a local maximum
4 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4184 KB too many queries. input: ? 985999 1 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Incorrect 1 ms 4184 KB not a local maximum
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Correct 1 ms 4184 KB Output is correct
3 Correct 1 ms 4184 KB Output is correct
4 Incorrect 1 ms 4184 KB not a local maximum
5 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Incorrect 1 ms 4184 KB not a local maximum
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4184 KB Output is correct
2 Incorrect 1 ms 4112 KB not a local maximum
3 Halted 0 ms 0 KB -