oj.uz

Submission #7695

# Submission time Handle Problem Language Result Execution time Memory
7695 2014-08-14T12:20:28 Z tncks0121 CATS (NOI14_cats) C++
12 / 25
 96 ms 1088 KB 
#include <stdio.h>
   
typedef long long ll;
ll X,L,N;
   
int main() {
  for(scanf("%*d");3==scanf("%lld%lld%lld",&X,&L,&N); ){
    ll res = 0;
    ll T = ((X-1) & ((1ll<<(L/(2*N)+2))-1));
    for(int i = 0; i < 60; i++) if((T >> i) & 1) ++res;
    res &= 1;
    res += 2*N + L/(2*N)*(2*N);
    printf("%lld\n", res);
  }
  return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct

Subtask #4
0.0 / 4.0

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

Subtask #5
0.0 / 4.0

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

Subtask #6
0.0 / 5.0

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