QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#505695 | #4912. WereYouLast | lifan | 100 ✓ | 4772ms | 4992kb | C++14 | 660b | 2024-08-05 09:00:54 | 2024-08-05 09:00:54 |
Judging History
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=1;i<=10;i++){
x+=query(i)*(1<<i-1);
}
x++;
for(int i=1;i<=10;i++){
modify(i,(x>>i-1)&1);
}
if(x==n){
return 1;
}
return 0;
}
int x=0;
for(int i=1;i<=5;i++){
x+=query(i)*(1<<i-1);
}
if(x==31){
return 1;
}
if(x==__lg(n)-1){
for(int i=1;i<=5;i++){
modify(i,1);
}
}else{
if(query(6+x)){
modify(6+x,0);
x++;
}else{
modify(6+x,1);
x=0;
}
for(int i=1;i<=5;i++){
modify(i,(x>>i-1)&1);
}
}
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: 3816kb
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: 4992kb
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: 4924kb
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: 4772ms
memory: 4976kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.