# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
125410 | 2019-07-05T09:10:32 Z | Touubs | CATS (NOI14_cats) | C++17 | 667 ms | 8008 KB |
#include <bits/stdc++.h> using namespace std; #define dout if(false) cout #define int unsigned long long void testcase() { int X, L, N; cin >> X >> L >> N; int originalX = X; X--; dout << 1 << endl; int level = L/(2*N) + 1; dout << "level: " << level << endl; int counterPerIter = (2 << level) | -1ul; dout << 2.5 << endl; int flips = 0; dout << 3 << endl; X = X % counterPerIter; dout << "counterPerIter: " << counterPerIter << endl; dout << 4 << endl; while (X > 0) { //dout << "X: " << X << ", flips: " << flips << " | "; if ((X & 1) == 1) flips = flips ^ 1; X = X >> 1; } dout << 5 << endl; dout << endl << "end. flips: " << flips << endl; int min = (L/(2*N) + 1) * (2*N); cout << ((min ^ ((flips) & 1))) << endl; } signed main() { int Q; cin >> Q; for (int i = 0; i < Q; i++) { testcase(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 376 KB | Output is correct |
2 | Incorrect | 8 ms | 376 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 48 ms | 680 KB | Output is correct |
2 | Incorrect | 51 ms | 740 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 563 ms | 2464 KB | Output is correct |
2 | Incorrect | 667 ms | 8008 KB | Output isn't correct |