Submission #201208

#TimeUsernameProblemLanguageResultExecution timeMemory
201208MetBCATS (NOI14_cats)C++14
25 / 25
554 ms8168 KiB
#include <bits/stdc++.h>
 
#define N 1000001

using namespace std;
 
typedef long long ll;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
 
int q;
 

 
int main () {
	cin >> q;

	for (int i = 0; i < q; i++) {
		ll x, l, n;
		cin >> x >> l >> n;

		x--;
		if (l / (2 * n) + 2 <= 62) x %= (1LL << (l / (2 * n) + 2));

		cout << 2 * n * (l / (2 * n) + 1) + __builtin_popcountll (x) % 2 << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...