QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#506625 | #4912. WereYouLast | lifan | 100 ✓ | 4667ms | 5000kb | C++14 | 627b | 2024-08-05 20:18:18 | 2024-08-05 20:18:18 |
Judging History
answer
//
#include<bits/stdc++.h>
using namespace std;
bool query(int);
void modify(int,bool);
bool WereYouLast(int n,int m){
if(n==1024){
int now=0;
for(int i=1;i<=10;++i) now<<=1,now|=query(i);
if(now==n-1) return 1;
++now;
for(int i=10;i;--i) modify(i,now&1),now>>=1;
return 0;
}
int pw=__lg(n),now=0;
for(int i=1;i<=5;i++) now=((now<<1)|query(i));
if(now==pw) return 1;
if(now==pw-1){
for(int i=5;i;--i) modify(i,pw&1),pw>>=1;
return 0;
}
int op=query(now+50);
if(op) modify(50+now,0),++now;
else modify(50+now,1),now=0;
for(int i=5;i;--i) modify(i,now&1),now>>=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: 1ms
memory: 3812kb
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: 5ms
memory: 4936kb
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: 4976kb
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: 4667ms
memory: 5000kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.