제출 #552912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
552912		elazarkoren	정렬하기 (IOI15_sorting)	C++17	100 / 100	410 ms	21064 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
//#define int ll
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAX_N = 2e5 + 5;

int x[MAX_N], y[MAX_N];
int n;

int cnt;

vi Compute(vi s) {
    for (int i = 0; i < cnt; i++) swap(s[x[i]], s[y[i]]);
    return s;
}

bool Ok(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
    cnt = m;
    vi s(n);
    for (int i = 0; i < n; i++) s[i] = S[i], x[i] = X[i], y[i] = Y[i];
    vi s2 = Compute(s);
    vi ind1(n), ind2(n);
    for (int i = 0; i < n; i++) {
        ind1[s[i]] = i;
        ind2[s2[i]] = i;
    }
    int index = 0;
    for (int i = 0; i < cnt; i++) {
        swap(s[x[i]], s[y[i]]);
        ind1[s[x[i]]] = x[i];
        ind1[s[y[i]]] = y[i];
        int v1 = 0, v2 = 0;
        for (; index < n; index++) {
            if (s2[index] == index) continue;
            int j = ind2[index];
            v1 = s2[index], v2 = s2[j];
            swap(s2[index], s2[j]);
            ind2[s2[index]] = index;
            ind2[s2[j]] = j;
            index++;
            break;
        }
        int i1 = ind1[v1], i2 = ind1[v2];
//        for (i1 = 0; s[i1] != v1; i1++);
//        for (i2 = 0; s[i2] != v2; i2++);
        p[i] = i1, q[i] = i2;
        swap(s[p[i]], s[q[i]]);
        ind1[s[i1]] = i1;
        ind1[s[i2]] = i2;
    }
    return is_sorted(all(s));
}

int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
    n = N;
    int begin = 0, end = n - 1, mid;
    while (begin < end) {
        mid = (begin + end) >> 1;
        if (Ok(N, S, mid, X, Y, p, q)) {
            end = mid;
        } else begin = mid + 1;
    }
    Ok(N, S, end, X, Y, p, q);
    return end;
}
//8
//3 5 6 2 1 7 0 4
//8
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In function 'bool Ok(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:29:13: warning: unused parameter 'N' [-Wunused-parameter]
   29 | bool Ok(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
      |         ~~~~^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:66:39: warning: unused parameter 'm' [-Wunused-parameter]
   66 | int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
      |                                   ~~~~^

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