제출 #583756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583756		InternetPerson10	정렬하기 (IOI15_sorting)	C++17	74 / 100	1054 ms	19244 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

int findSwapPairs(int n, int R[], int m, int X[], int Y[], int P[], int Q[]) {
    int S[200001];
    int l = -1, r = m;
    vector<int> targetArr(n);
    vector<int> revInd(n);
    unordered_set<int> notGood; // Indices of places where no match
    int countMatches;
    auto swapTwo = [&](int i, int a, int b) {
        if(a == S[a]) countMatches--;
        if(b == S[b]) countMatches--;
        swap(S[a], S[b]);
        P[i] = a; Q[i] = b;
        if(a == S[a]) countMatches++;
        if(b == S[b]) countMatches++;
    };
    while(l != r - 1) {
        m = (l + r + 1) / 2;
        for(int i = 0; i < n; i++) S[i] = R[i];
        countMatches = 0;
        for(int i = 0; i < n; i++) {
            targetArr[i] = i;
            if(S[i] == i) countMatches++;
        }
        for(int i = m-1; i >= 0; i--) {
            swap(targetArr[X[i]], targetArr[Y[i]]);
        }
        for(int i = 0; i < n; i++) {
            revInd[targetArr[i]] = i;
        }
        for(int i = 0; i < n; i++) {
            if(S[i] != targetArr[i]) notGood.insert(i);
        }
        for(int i = 0; i < m; i++) {
            if(countMatches == n) {
                m = i;
                break;
            }
            if(X[i] != Y[i]) {
                int x = (int)notGood.count(X[i]);
                int y = (int)notGood.count(Y[i]);
                if(X[i] == S[X[i]]) countMatches--;
                if(Y[i] == S[Y[i]]) countMatches--;
                swap(revInd[targetArr[X[i]]], revInd[targetArr[Y[i]]]);
                swap(targetArr[X[i]], targetArr[Y[i]]);
                swap(S[X[i]], S[Y[i]]);
                notGood.erase(X[i]);
                notGood.erase(Y[i]);
                if(x) notGood.insert(Y[i]);
                if(y) notGood.insert(X[i]);
                if(X[i] == S[X[i]]) countMatches++;
                if(Y[i] == S[Y[i]]) countMatches++;
            }
            if(notGood.size() == 0) {
                swapTwo(i, 0, 0);
                continue;
            }
            int a = *(notGood.begin());
            int b = revInd[S[a]];
            swapTwo(i, a, b);
            assert(S[b] == targetArr[b]);
            if(S[a] == targetArr[a]) notGood.erase(a);
            if(S[b] == targetArr[b]) notGood.erase(b);
        }
        if(countMatches == n) r = m;
        else l = m;
        unordered_set<int>().swap(notGood);
    }
    m = r;
    for(int i = 0; i < n; i++) S[i] = R[i];
    countMatches = 0;
    for(int i = 0; i < n; i++) {
        targetArr[i] = i;
        if(S[i] == i) countMatches++;
    }
    for(int i = m-1; i >= 0; i--) {
        swap(targetArr[X[i]], targetArr[Y[i]]);
    }
    for(int i = 0; i < n; i++) {
        revInd[targetArr[i]] = i;
    }
    for(int i = 0; i < n; i++) {
        if(S[i] != targetArr[i]) notGood.insert(i);
    }
    for(int i = 0; i < m; i++) {
        if(countMatches == n) {
            m = i;
            break;
        }
        if(X[i] != Y[i]) {
            int x = (int)notGood.count(X[i]);
            int y = (int)notGood.count(Y[i]);
            if(X[i] == S[X[i]]) countMatches--;
            if(Y[i] == S[Y[i]]) countMatches--;
            swap(revInd[targetArr[X[i]]], revInd[targetArr[Y[i]]]);
            swap(targetArr[X[i]], targetArr[Y[i]]);
            swap(S[X[i]], S[Y[i]]);
            notGood.erase(X[i]);
            notGood.erase(Y[i]);
            if(x) notGood.insert(Y[i]);
            if(y) notGood.insert(X[i]);
            if(X[i] == S[X[i]]) countMatches++;
            if(Y[i] == S[Y[i]]) countMatches++;
        }
        if(notGood.size() == 0) {
            swapTwo(i, 0, 0);
            continue;
        }
        int a = *(notGood.begin());
        int b = revInd[S[a]];
        swapTwo(i, a, b);
        assert(S[b] == targetArr[b]);
        if(S[a] == targetArr[a]) notGood.erase(a);
        if(S[b] == targetArr[b]) notGood.erase(b);
    }
    return r;
}

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 20 / 20
• Subtask 6: 0 / 26