| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 4840 |
2014-01-04T16:27:02 Z |
tncks0121 |
양말 찾기 (KPI13_socks) |
C++ |
|
1780 ms |
1212 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <time.h>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
int n;
int A[4][1<<8];
vector<int> ans;
int main() {
int i, j, k;
scanf("%d", &n);
for(i = 0; i < n; i++) {
int v; scanf("%d", &v);
for(j = 0; j < 4; j++) A[j][(v >> j*8) & 255] ^= v;
}
for(j = 0; j < 4; j++) {
ans.clear();
for(i = 0; i < 256; i++)
if(A[j][i] != 0) ans.push_back(A[j][i]);
if(ans.size() == 2) {
sort(ans.begin(), ans.end());
for(i = 0; i < 2; i++) printf("%d ", ans[i]);
return 0;
}
}
for(j = 0; j < 4; j++) {
ans.clear();
for(i = 0; i < 256; i++)
if(A[j][i] != 0) return 0 & printf(A[j][i] > 0 ? "0 %d" : "%d 0", A[j][i]);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
1780 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
1776 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
1704 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
104 ms |
1212 KB |
Output is correct |
| 15 |
Correct |
104 ms |
1212 KB |
Output is correct |
| 16 |
Correct |
168 ms |
1212 KB |
Output is correct |
| 17 |
Correct |
164 ms |
1212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 20 |
Correct |
164 ms |
1212 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 23 |
Correct |
172 ms |
1212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 26 |
Correct |
176 ms |
1212 KB |
Output is correct |
| 27 |
Correct |
180 ms |
1212 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 30 |
Correct |
176 ms |
1212 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 33 |
Correct |
200 ms |
1212 KB |
Output is correct |
| 34 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 35 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 36 |
Correct |
168 ms |
1212 KB |
Output is correct |
| 37 |
Correct |
176 ms |
1212 KB |
Output is correct |
| 38 |
Correct |
184 ms |
1212 KB |
Output is correct |
| 39 |
Correct |
176 ms |
1212 KB |
Output is correct |
| 40 |
Correct |
164 ms |
1212 KB |
Output is correct |
| 41 |
Correct |
132 ms |
1212 KB |
Output is correct |
| 42 |
Correct |
172 ms |
1212 KB |
Output is correct |
| 43 |
Correct |
172 ms |
1212 KB |
Output is correct |
| 44 |
Correct |
184 ms |
1212 KB |
Output is correct |
| 45 |
Correct |
172 ms |
1212 KB |
Output is correct |
| 46 |
Correct |
180 ms |
1212 KB |
Output is correct |
| 47 |
Correct |
168 ms |
1212 KB |
Output is correct |
| 48 |
Correct |
180 ms |
1212 KB |
Output is correct |
| 49 |
Correct |
180 ms |
1212 KB |
Output is correct |
| 50 |
Correct |
164 ms |
1212 KB |
Output is correct |
