QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#505693#4912. WereYouLastliuzimingc100 ✓4686ms5004kbC++14558b2024-08-05 08:57:382024-08-05 08:57:38

Judging History

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

  • [2024-08-05 08:57:38]
  • 评测
  • 测评结果:100
  • 用时:4686ms
  • 内存:5004kb
  • [2024-08-05 08:57:38]
  • 提交

answer

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 true;
		x++;
		for (int i = 0; i < 10; i++) modify(i + 1, x >> i & 1);
		return false;
	}
	int x = 0;
	for (int i = 0; i < 5; i++) x |= query(i + 1) << i;
	if ((1 << x) == n) return true;
	bool f = query(x + 6);
	modify(x + 6, !f);
	if (f || (1 << x + 1) == n) x++;
	else x = 0;
	for (int i = 0; i < 5; i++) modify(i + 1, x >> i & 1);
	return false;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 1ms
memory: 3932kb

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: 6ms
memory: 5004kb

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: 70ms
memory: 4988kb

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: 4686ms
memory: 4912kb

input:

67108864 100000

output:

12345876 6 6

result:

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