| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5088 | ainta | 양말 찾기 (KPI13_socks) | C++98 | 2000 ms | 1440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int b[2][45010], r[2];
int main(){
int n, a, i, j, c = 0;
scanf("%d", &n);
while (n--){ scanf("%d", &a); a += 1000000001; b[0][a % 45001] ^= a, b[1][a % 45000] ^= a; }
for (i = 0; i<2 && c != 2; i++){
c = 0;
for (j = 0; j<45001; j++)if (b[i][j]) r[c++] = b[i][j] - 1000000001;
}
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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||