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 <bits/stdc++.h>
using namespace std;
#define dout if(false) cout
#define int unsigned long long
void testcase() {
int X, L, N;
cin >> X >> L >> N;
int originalX = X;
int level = L/(2*N) + 1;
dout << "level: " << level << endl;
int counterPerIter = 1 << level;
int flipPerIter = 2 * counterPerIter - 1;
int iterations = X / counterPerIter;
int flips = iterations & 1;
X = X % counterPerIter;
dout << "counterPerIter: " << counterPerIter << endl;
dout << "flipPerIter: " << flipPerIter << endl;
while (counterPerIter > 0 && X != 0) {
dout << "while" << endl;
dout << "counterPerIter: " << counterPerIter << endl;
dout << "flipPerIter: " << flipPerIter << endl;
dout << "flips: " << flips << endl << endl;
if (counterPerIter <= X) {
X -= counterPerIter;
flips = flips ^ 1;
} else {
}
counterPerIter = counterPerIter >> 1;
flipPerIter = flipPerIter >> 1;
level--;
}
dout << endl << "end. flips: " << flips << endl;
int min = (L/(2*N) + 1) * (2*N);
cout << ((min | ((~flips) & 1)) ^ ((~originalX) & 1)) << endl;
}
signed main() {
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
testcase();
}
}
# | 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... |