# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
953129 | 2024-03-25T14:31:42 Z | Pacybwoah | 양말 찾기 (KPI13_socks) | C++17 | 2255 ms | 65536 KB |
#include<cstdio> using namespace std; int arr[32][2]; int main(){ int n; scanf("%d",&n); int x,i; for(i=0;i<32;i++) arr[i][0]=0,arr[i][1]=0; int j; for(i=0;i<n;i++){ scanf("%d",&x); x+=1000000001; for(j=31;j>=0;j--){ if(x&(1<<j)) arr[j][1]^=x; else arr[j][0]^=x; } } for(i=0;i<32;i++){ if(arr[i][0]>0&&arr[i][1]>0){ arr[i][0]-=1000000001; arr[i][1]-=1000000001; printf("%d %d\n",(arr[i][0]<arr[i][1]?arr[i][0]:arr[i][1]),(arr[i][1]>arr[i][0]?arr[i][1]:arr[i][0])); return 0; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 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 | 1 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 2213 ms | 392 KB | Output is correct |
12 | Runtime error | 2255 ms | 65536 KB | Memory limit exceeded |
13 | Halted | 0 ms | 0 KB | - |