# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
949794 | 2024-03-19T17:49:19 Z | rainboy | 양말 찾기 (KPI13_socks) | C++17 | 2378 ms | 10236 KB |
#include <stdio.h> #define L 31 /* L = ceil(log2(2 * 10^9 + 1)) */ int main() { static int xx[L]; int n, l, a, b, x, tmp; scanf("%d", &n); x = 0; while (n--) { scanf("%d", &a); x ^= a; for (l = 0; l < L; l++) if ((a & 1 << l) != 0) xx[l] ^= a; } a = 0, b = x; for (l = 0; l < L; l++) if (xx[l] != 0 && xx[l] != x) { a = xx[l], b = x ^ xx[l]; break; } if (a > b) tmp = a, a = b, b = tmp; printf("%d %d\n", a, b); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 360 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 1 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 2378 ms | 396 KB | Output is correct |
12 | Correct | 2347 ms | 596 KB | Output is correct |
13 | Correct | 2347 ms | 596 KB | Output is correct |
14 | Correct | 92 ms | 2168 KB | Output is correct |
15 | Correct | 92 ms | 2128 KB | Output is correct |
16 | Runtime error | 159 ms | 10236 KB | Memory limit exceeded |
17 | Halted | 0 ms | 0 KB | - |