#include <bits/stdc++.h>
using namespace std;
#define dout if(false) cout
void testcase() {
int X, L, N;
cin >> X >> L >> N;
int level = L/(2*N) + 1;
dout << level << endl;
int flips = 0;
int counterPerIter = 1 << level;
int flipPerIter = 2 * counterPerIter - 1;
int iterations = X / counterPerIter;
flips += iterations * flipPerIter;
X = X % counterPerIter;
dout << counterPerIter << endl;
dout << flipPerIter << endl;
while (counterPerIter > 0 && X != 0) {
dout << counterPerIter << endl;
dout << flipPerIter << endl;
dout << flips << endl << endl;
if (counterPerIter <= X) {
X -= counterPerIter;
flips += flipPerIter;
} else {
flips++;
}
counterPerIter = counterPerIter >> 1;
flipPerIter = flipPerIter >> 1;
level--;
}
dout << endl << flips << endl;
int min = (L/(2*N) + 1) * (2*N);
cout << (min | (flips & 1)) << endl;
dout << flips << "\n";
}
signed main() {
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
testcase();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
47 ms |
632 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
376 KB |
Execution killed with signal 8 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |