QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#506168 | #4912. WereYouLast | A_box_of_yogurt | 100 ✓ | 3968ms | 4996kb | C++14 | 831b | 2024-08-05 15:47:03 | 2024-08-05 15:47:04 |
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 pos = 0;
for(int i = 1; i <= m; ++i) {
pos <<= 1;
pos |= query(i);
}
if(++pos == n) return true;
for(int i = m; i && pos; --i, pos >>= 1) {
modify(i, pos & 1);
}
return 0;
}
int len = __lg(n), pos = 0;
for(int i = 1; i <= 5; ++i) {
pos <<= 1;
pos |= query(i);
}
if(++pos == 32) return true;
if(query(5 + pos)) {
modify(5 + pos, 0);
int t = pos;
for(int i = 5; i && t; --i, t >>= 1) {
modify(i, t & 1);
}
}
else {
if(pos == len) {
for(int i = 1; i <= 5; ++i) {
modify(i, 1);
}
}
else {
modify(5 + pos, 1);
for(int i = 1; i <= 5; ++i) {
modify(i, 0);
}
}
}
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: 2ms
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: 60ms
memory: 4932kb
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: 3968ms
memory: 4996kb
input:
67108864 100000
output:
12345876 6 6
result:
ok Correct Answer. C1 = 6. C2 = 6.