oj.uz

Submission #201194

# Submission time Handle Problem Language Result Execution time Memory
201194 2020-02-09T18:15:08 Z MetB CATS (NOI14_cats) C++14
0 / 25
 457 ms 6172 KB 
	
#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;
		if (l / (2 * n) + 1 <= 60) x %= (1LL << (l / (2 * n) + 1));

		cout << 2 * n * (l / (2 * n) + 1) + __builtin_popcount (x - 1) % 2 << '\n';
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Incorrect 9 ms 376 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 504 KB Output is correct
2 Incorrect 45 ms 760 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 457 ms 6172 KB Output isn't correct
2 Halted 0 ms 0 KB -