QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#606962#8939. Permutationliguo#TL 0ms0kbC++201.0kb2024-10-03 13:17:062024-10-03 13:17:07

Judging History

This is the latest submission verdict.

  • [2024-10-03 13:17:07]
  • Judged
  • Verdict: TL
  • Time: 0ms
  • Memory: 0kb
  • [2024-10-03 13:17:06]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
int ask(int l,int r){
	printf("? %d %d\n",l,r);
	fflush(stdout);
	int res;scanf("%d",&res);
	return res;
}
void solve(){
	int n;scanf("%d",&n);
	int l=1,r=n,sl;
	int fl=1;
	while(l<r){
		if(fl==1){
			sl=ask(l,r);fl=0;
		}
		if(l+1==r){
			printf("! %d\n",r-sl+l);
			fflush(stdout);
			return;
		}
		else if(l+2==r){
			int mid=(l+r)/2;
			if(sl<=mid)
				if(ask(l,mid)==sl)
					printf("! %d\n",l+mid-sl);
				else
					printf("! %d\n",r);
			else
				if(ask(mid,r)==sl)
					printf("! %d\n",mid+r-sl);
				else
					printf("! %d\n",l);
			return;
		}
		int mid=l+(r-l)/2;
		int midl=l+(r-l)/3;
		int midr=r-(r-l)/3;
		if(l<=sl&&sl<=mid){
			int res=ask(l,midr);
			if(res==sl)
				r=midr;
			else
				l=midr+1,fl=1;
		}
		else{
			int res=ask(midl,r);
			if(res==sl)
				l=midl;
			else
				r=midl-1,fl=1;
		}
	}
	printf("! %d\n",l);
	fflush(stdout);
}
int main(){
	int t;scanf("%d",&t);
	while(t--){
		solve();
	}
}

詳細信息

Test #1:

score: 0
Time Limit Exceeded

input:

3
5
3
3
3
2

output:

? 1 5
? 1 4
? 2 4
? 2 3

result: