| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 952878 | Darren0724 | 양말 찾기 (KPI13_socks) | C++17 | 1 ms | 604 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 LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e9;
const int K=45000;
const int C=1e9;
int32_t main() {
    LCBorz;
    int n;cin>>n;
    vector<int> v(K),v1(K);
    for(int i=0;i<n;i++){
        int p;cin>>p;
        p+=C;
        v[p%K]^=p;
        v1[p/K]^=p;
    }
    int cnt1=0;
    for(int i=0;i<K;i++){
        cnt1+=(v[i]>0);
    }
    if(cnt1==2){
        for(int i=0;i<K;i++){
            if(v[i])cout<<v[i]-C<<' ';
        }
        cout<<endl;
        return 0;
    }
    for(int i=0;i<K;i++){
        if(v1[i])cout<<v1[i]-C<<' ';
    }
    cout<<endl;
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
