QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#492037	#4912. WereYouLast	tx344	100 ✓	4684ms	5060kb	C++14	489b	2024-07-26 08:34:36	2024-07-26 08:34:37

Judging History

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

[2024-07-26 08:34:37]
评测

测评结果：100
用时：4684ms
内存：5060kb

查看

[2024-07-26 08:34:36]
提交

answer

#include<bits/stdc++.h>
using namespace std;
bool query(int);
void modify(int,bool);
bool WereYouLast(int n,int m)
{
	if(m==10)
	{
		int x=0;
		for(int i=0;i<10;i++)x|=query(i+1)<<i;
		if(x==n-1)return 1;
		++x;
		for(int i=0;i<10;i++)modify(i+1,x>>i&1);
		return 0;
	}
	int x=0;
	for(int i=0;i<5;i++)x|=query(i+1)<<i;
	if((1<<x)==n)return 1;
	bool flg=query(x+6);
	modify(x+6,!flg);
	x=(flg||(1<<x+1)==n)?x+1:0;
	for(int i=0;i<5;i++)modify(i+1,x>>i&1);
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 1ms

memory: 3964kb

input:

1024 10

output:

12345876 10 10

result:

ok Correct Answer.
C1 = 10.
C2 = 10.

Subtask #2:

score: 20

Accepted

Test #2:

score: 20

Accepted

time: 3ms

memory: 5060kb

input:

65536 100000

output:

12345876 6 6

result:

ok Correct Answer.
C1 = 6.
C2 = 6.

Subtask #3:

score: 30

Accepted

Test #3:

score: 30

Accepted

time: 75ms

memory: 4996kb

input:

1048576 100000

output:

12345876 6 6

result:

ok Correct Answer.
C1 = 6.
C2 = 6.

Subtask #4:

score: 40

Accepted

Test #4:

score: 40

Accepted

time: 4684ms

memory: 4928kb

input:

67108864 100000

output:

12345876 6 6

result:

ok Correct Answer.
C1 = 6.
C2 = 6.