oj.uz

Submission #7690

# Submission time Handle Problem Language Result Execution time Memory
7690 2014-08-14T12:01:00 Z gs13068 CATS (NOI14_cats) C++
25 / 25
 100 ms 1088 KB 
#include<cstdio>
 
int main()
{
    int Q;
    scanf("%d",&Q);
    while(Q--)
    {
        long long X,L,N,K,T,C=0;
        scanf("%lld%lld%lld",&X,&L,&N);
        X=X-1;
        K=(L+2*N-1)/(2*N)*(2*N);
        for(T=K/(2*N)+1;X>0&&T>0;X>>=1,T--)C^=X&1;
        printf("%lld\n",K+C);
    }
}

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
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 #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

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