oj.uz

답안 #952883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952883 2024-03-25T04:07:44 Z Darren0724 양말 찾기 (KPI13_socks) C++17
0 / 1
 1 ms 776 KB 
#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=1.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);
    }
    vector<int> ans;
    if(cnt1==2){
        for(int i=0;i<K;i++){
            if(v[i])ans.push_back(v[i]-C);
        }
        sort(all(ans));
        cout<<ans[0]<<' '<<ans[1]<<endl;
        return 0;
    }
    for(int i=0;i<K;i++){
        if(v1[i])ans.push_back(v1[i]-C);
    }
    sort(all(ans));
    cout<<ans[0]<<' '<<ans[1]<<endl;

    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 776 KB Output is correct
5 Incorrect 1 ms 604 KB Output isn't correct
6 Halted 0 ms 0 KB -