# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290815 | gs14004 | CATS (NOI14_cats) | C++17 | 1584 ms | 40056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstring>
using lint = long long;
struct cat_stack{
int stack[5000005], sz;
int top(){
if(sz == 0) return 0;
return stack[sz-1];
}
void pop(){
if(sz != 0) sz--;
}
void push(int x){
stack[sz++] = x;
}
}s1;
int main(){
int q;
scanf("%d",&q);
while (q--) {
lint x, l, n;
scanf("%lld %lld %lld",&x,&l,&n);
x--;
if(l / (2 * n + 1) <= 61){
lint Q = l / (2 * n) + 1;
x %= (1ll << (Q + 1));
}
int s2 = 0;
s1.sz = 0;
int g = 0;
while (x>=0) {
s2 = s1.top() ^ g;
s1.pop();
g ^= 1;
if(s2 > l){
x--;
// printf("%d,", s2);
if(x < 0){
printf("%d\n",s2);
break;
}
}
else{
s2 += 2*n;
s1.push(s2^g);
s1.push(s2^g);
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |