QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#506551 | #4912. WereYouLast | lifan | 100 ✓ | 4695ms | 5060kb | C++14 | 605b | 2024-08-05 19:19:40 | 2024-08-05 19:19:41 |
Judging History
answer
//
bool query(int);
void modify(int , bool);
bool WereYouLast(int n , int m) {
if (m == 10) {
int pos = 0;
for (int i = 0 ; i < 10 ; i = -~i) pos |= query(i + 1) << i;
if (pos == n - 1) return 1;
pos ++;
for (int i = 0 ; i < 10 ; i = -~i) modify(i + 1 , pos >> i & 1);
return 0;
}
int pos = 0;
for (int i = 0 ; i < 5 ; i = -~i) pos |= query(i + 1) << i;
if ((1 << pos) == n) return 1;
bool f = query(pos + 6);
modify(pos + 6 , !f);
if (f || (1 << pos + 1) == n) pos ++;
else pos = 0;
for (int i = 0 ; i < 5 ; i = -~i) modify(i + 1 , pos >> i & 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: 3900kb
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: 4976kb
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: 74ms
memory: 5060kb
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: 4695ms
memory: 4900kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.