# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
952879 | browntoad | 양말 찾기 (KPI13_socks) | C++14 | 880 ms | 65536 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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define pii pair<int, int>
#define ppi pair<pii, int>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define endl '\n'
#define IOS() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
const ll maxn = 1e6+5;
const ll bloc = 63000;
vector<int> toadp(bloc), toadm(bloc);
signed main(){
IOS();
int n; cin>>n;
int x;
REP(i, n){
cin>>x;
x += 1000000049;
//assert(x <= 1000000000);
toadp[x/bloc] ^= x;
toadm[x%bloc] ^= x;
}
int dif = 0, xr = 0;
REP(i, bloc){
if (toadp[i] > 0){
dif++;
}
}
if (dif == 2){
REP(i, bloc){
if (toadp[i] > 0) cout<<toadp[i]-1000000049<<' ';
}
cout<<endl;
}
else {
REP(i, bloc){
if (toadm[i] > 0) cout<<toadm[i]-1000000049<<' ';
}
cout<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |