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>
struct cat_stack{
int stack[5000005], sz;
bool key;
void filp(){
key ^= 1;
}
int top(){
if(sz == 0) return key;
return stack[sz-1]^key;
}
void pop(){
if(sz != 0) sz--;
}
void push(int x){
stack[sz++] = x;
}
}s1;
int main(){
int q;
scanf("%d",&q);
while (q--) {
int x,l,n;
scanf("%d %d %d",&x,&l,&n);
int s2 = 0;
int rotten = 0;
while (x>0) {
s2 = s1.top();
if(rotten) s2 ^= s1.key;
s1.pop();
s1.filp();
rotten = 0;
if(s2 > l){
x--;
if(x == 0){
printf("%d\n",s2);
break;
}
}
else{
s2 += 2*n;
s1.push(s2^s1.key);
s1.push(s2^s1.key);
rotten = 1;
}
}
}
}
# | 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... |