QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#492348 | #4912. WereYouLast | PatrickStar | 100 ✓ | 4763ms | 5060kb | C++14 | 684b | 2024-07-26 11:33:33 | 2024-07-26 11:33:34 |
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 u = 0;
for (int p=1;p<=10;p++) {
u+=query(p)*(1<<p-1);
}
u++;
for (int p=1;p<=10;p++) {
modify(p, (u>>p-1)&1);
}
if (u==n) return 1;
return 0;
}
int u = 0;
for (int p=1;p<=5;p++) {
u+=query(p)*(1<<p-1);
}
if (u==31) return 1;
if (u==__lg(n)-1) {
for (int p=1;p<=5;p++) {
modify(p, 1);
}
}
else {
if (query(6+u)) {
modify(6+u, 0);
u++;
}
else {
modify(6+u, 1);
u = 0;
}
for (int p=1;p<=5;p++) {
modify(p, (u>>p-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: 1ms
memory: 3836kb
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: 2ms
memory: 4912kb
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: 72ms
memory: 4916kb
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: 4763ms
memory: 5060kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.