QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#138369	#6394. Turn on the Light	Schi2oid	WA	5ms	13464kb	C++14	941b	2023-08-11 16:41:26	2023-08-11 16:41:28

Judging History

你现在查看的是最新测评结果

[2023-08-11 16:41:28]
评测

测评结果：WA
用时：5ms
内存：13464kb

查看

[2023-08-11 16:41:26]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int ask(int x){
	int ret;
	cout<<"? "<<x<<endl;
	cin>>ret;
	return ret;
}
int id[2][2000005];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) id[0][i]=i;
	bool op=0;
	int bef=0;
	while(n>4){
		int p1=n/4,p2=n-n/4;
		int x=ask(id[op][p1]);
		if(x==bef){
			cout<<"! p1";
			return 0;
		}
		 int y=ask(id[op][p2]);
		 if(y==x){
		 	cout<<"! p2";
		 	return 0;
		 }
		 int delta=y-bef;
		 op^=1;
		 if(delta==0){
		 	n=p2-p1;
		 	int cnt=0;
		 	for(int i=p1+1;i<=p2;i++){
		 		id[op][++cnt]=id[op^1][i];
		 	}
		 }
		 else{
		 	n=n-p2+p1-1;
		 	int cnt=0;
		 	for(int i=1;i<p1;i++){
		 		id[op][++cnt]=id[op^1][i];
		 	}
		 	for(int i=p2+1;i<=n;i++){
		 		id[op][++cnt]=id[op^1][i];
		 	}
		 }
		 bef=y;
	}
	for(int i=1;i<=n;i++){
		int x=ask(id[op][i]);
		if(x==bef){
			cout<<"! "<<id[op][i];
			return 0;
		}
		bef=x;
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3404kb

input:

output:

? 1
? 2
? 3
! 3

result:

ok Correct position at 3

Test #2:

score: 0

Accepted

time: 1ms

memory: 5504kb

input:

output:

? 2
? 8
? 3
? 7
? 4
? 5
! 5

result:

ok Correct position at 5

Test #3:

score: 0

Accepted

time: 1ms

memory: 5452kb

input:

output:

? 2
? 7
? 3
? 6
? 4
? 5
! 5

result:

ok Correct position at 5

Test #4:

score: 0

Accepted

time: 1ms

memory: 5508kb

input:

output:

? 2
? 6
? 3
? 4
! 4

result:

ok Correct position at 4

Test #5:

score: 0

Accepted

time: 2ms

memory: 5464kb

input:

output:

? 1
? 6
? 2
? 5
? 3
? 4
! 4

result:

ok Correct position at 4

Test #6:

score: 0

Accepted

time: 1ms

memory: 5512kb

input:

output:

? 1
? 5
? 2
? 3
! 3

result:

ok Correct position at 3

Test #7:

score: 0

Accepted

time: 0ms

memory: 5512kb

input:

output:

? 1
? 4
? 2
? 3
! 3

result:

ok Correct position at 3

Test #8:

score: 0

Accepted

time: 1ms

memory: 3624kb

input:

output:

? 1
? 2
? 3
? 4
! 4

result:

ok Correct position at 4

Test #9:

score: 0

Accepted

time: 1ms

memory: 3524kb

input:

3
1
1

output:

? 1
? 2
! 2

result:

ok Correct position at 2

Test #10:

score: 0

Accepted

time: 1ms

memory: 3456kb

input:

2
1
1

output:

? 1
? 2
! 2

result:

ok Correct position at 2

Test #11:

score: 0

Accepted

time: 2ms

memory: 3460kb

input:

1
0

output:

? 1
! 1

result:

ok Correct position at 1

Test #12:

score: 0

Accepted

time: 0ms

memory: 12616kb

input:

output:

result:

ok Correct position at 500001

Test #13:

score: 0

Accepted

time: 2ms

memory: 11880kb

input:

output:

result:

ok Correct position at 499999

Test #14:

score: 0

Accepted

time: 4ms

memory: 11444kb

input:

output:

result:

ok Correct position at 500000

Test #15:

score: 0

Accepted

time: 1ms

memory: 13464kb

input:

output:

result:

ok Correct position at 499998

Test #16:

score: 0

Accepted

time: 0ms

memory: 11996kb

input:

output:

result:

ok Correct position at 499999

Test #17:

score: 0

Accepted

time: 5ms

memory: 11192kb

input:

output:

result:

ok Correct position at 499997

Test #18:

score: 0

Accepted

time: 2ms

memory: 11440kb

input:

output:

result:

ok Correct position at 499998

Test #19:

score: 0

Accepted

time: 1ms

memory: 12488kb

input:

output:

result:

ok Correct position at 499996

Test #20:

score: 0

Accepted

time: 1ms

memory: 12556kb

input:

output:

result:

ok Correct position at 499997

Test #21:

score: 0

Accepted

time: 1ms

memory: 12504kb

input:

output:

result:

ok Correct position at 499995

Test #22:

score: -100

Wrong Answer

time: 3ms

memory: 11200kb

input:

output:

result:

wrong answer Integer parameter [name=x] equals to 0, violates the range [1, 1000000]