QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#490247 | #4912. WereYouLast | OtoriEmu | 100 ✓ | 4926ms | 4996kb | C++14 | 946b | 2024-07-25 13:42:09 | 2024-07-25 13:42:10 |
Judging History
answer
/*
¤ï¤ó¤ï¤ó¡¡¤ï¤ó¤À¤Û©`¤¤¤Ã¡î
Wonderhoy!
*/
bool query(int);
void modify(int,bool);
#include<bits/stdc++.h>
using namespace std;
inline int mv(int x){return x+6;}
bool WereYouLast(int n,int m)
{
if(m==10)
{
int x=0;
for(int i=1;i<=10;++i)
{
x<<=1;
if(query(i)) x|=1;
}
++x;
if(x==n) return true;
for(int i=10;i;--i)
{
int p=x&1;
if(p) modify(i,true);
else modify(i,false);
x>>=1;
}
return false;
}
int x=0;
for(int i=1;i<=5;++i)
{
x<<=1;
if(query(i)) x|=1;
}
if(x==31) return true;
++x;
if(x==__lg(n))
{
for(int i=1;i<=5;++i) modify(i,true);
return false;
}
if(query(mv(x)))
{
modify(mv(x),false);
for(int i=5;i;--i)
{
int p=x&1;
if(p) modify(i,true);
else modify(i,false);
x>>=1;
}
}
else
{
modify(mv(x),true);
for(int i=1;i<=5;++i) modify(i,false);
}
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: 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: 6ms
memory: 4904kb
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: 79ms
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: 4926ms
memory: 4992kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.