Submission #5091

#TimeUsernameProblemLanguageResultExecution timeMemory
5091ainta양말 찾기 (KPI13_socks)C++98
1 / 1
2080 ms1600 KiB
#include<stdio.h> int b[2][65536], r[2]; int main(){ int n, a, i, j, c = 0; scanf("%d", &n); while (n--){ scanf("%d", &a); a += (1 << 30); b[0][a & 32767] ^= a, b[1][a % 65535] ^= a; } for (i = 0; i<2 && c != 2; i++){ c = 0; for (j = 0; j != (1 << 15) << i; j++){ if (b[i][j]) r[c++] = b[i][j] - (1 << 30); } c = c; } if (r[0]>r[1])a = r[0], r[0] = r[1], r[1] = a; printf("%d %d\n", r[0], r[1]); }
#Verdict Execution timeMemoryGrader output
Fetching results...