QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#450793#4912. WereYouLastthelegendary08100 ✓4747ms5020kbC++14820b2024-06-22 18:08:032024-06-22 18:08:03

Judging History

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

  • [2024-06-22 18:08:03]
  • 评测
  • 测评结果:100
  • 用时:4747ms
  • 内存:5020kb
  • [2024-06-22 18:08:03]
  • 提交

answer

#include<bits/stdc++.h>
#define f0r(i,n) for(int i = 1;i<=n;i++)
using namespace std;
bool query(int);
void modify(int,bool);
int cnt = 0;
bool WereYouLast(int n, int m){
	if(m == 10){
		f0r(i, 10){
			if(query(i))modify(i, 0);
			else{
				modify(i, 1);
				break;
			}
		}
		f0r(i, 10){
			if(query(i) != ((n & (1<<(i-1))) > 0))return 0;
		}
	    return 1;
	}
	else{
		int ps = 0;
		int l = __builtin_ctz(n);
		for(int i = 1; i<=5; i++)if(query(i))ps += (1<<(i-1));
		//cout<<ps<<'\n';
		if(ps == l)return 1;
		if(query(ps+6)){
			modify(ps+6, 0);
			ps++;
		}
		else{
			modify(ps+6, 1);
			if(ps != l-1)ps = 0;
			else ps++;
		}
		//cout<<ps<<' '<<l<<" bruh"<<'\n'
		//cout<<ps<<" piss"<<'\n';
		
		for(int i = 1;i<=5;i++)modify(i, (ps&(1<<(i-1))) > 0);
		return 0;
	}
	
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 0ms
memory: 3852kb

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: 5008kb

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: 76ms
memory: 5020kb

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

input:

67108864 100000

output:

12345876 6 6

result:

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