#include <bits/stdc++.h>
using namespace std;
#define int long long
int popcount(int x) {
int ans = 0;
while(x != 0) {
ans += (x&1);
x >>= 1;
}
return ans;
}
int greed(int x, int l, int n) {
int period = (l+2*n-1)/(2*n)*4;
x %= period;
//cout << x << " " << period << endl;
return (l+2*n-1)/(2*n)*2*n+popcount(x)%2;
}
int simulate(int x, int l, int n) {
vector<int> st1(10000, 0);
int period = (l+2*n-1)/(2*n)*4;
x %= period;
int t2;
int counter = x+1;
while(counter > 0) {
t2 = st1.back();
st1.pop_back();
for(int& i : st1) i ^= 1;
if(t2 > l) {
--counter;
//cout << counter << ": " << t2 << endl;
} else {
t2 += 2*n;
st1.push_back(t2);
st1.push_back(t2);
}
}
return t2;
}
signed main() {
int q;
cin >> q;
while(q--) {
int x, l, n;
cin >> x >> l >> n; --x;
cout << simulate(x, l, n) /*<< " " << greed(x, l, n)*/ << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
564 KB |
Output is correct |
3 |
Correct |
2 ms |
664 KB |
Output is correct |
4 |
Correct |
2 ms |
664 KB |
Output is correct |
5 |
Correct |
2 ms |
664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
19 ms |
664 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
223 ms |
852 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1574 ms |
1000 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1555 ms |
1264 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1566 ms |
1368 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |