Submission #1335515

#	Time	Username	Problem	Language	Result	Execution time	Memory
1335515		kawhiet	정렬하기 (IOI15_sorting)	C++20	0 / 100	1 ms	580 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;

int n, m;
vector<int> s, x, y;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int p[], int q[]) {
    n = N;
    m = M;
    s.assign(S, S + N);
    x.assign(X, X + M);
    y.assign(Y, Y + M);
    for (int i = 0; i < m; i++) {
        swap(s[x[i]], s[y[i]]);
    }
    vector<int> pos(n);
    for (int i = 0; i < n; i++) {
        pos[s[i]] = i;
    }
    int sz = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] != i) {
            int j = pos[i];
            p[sz] = i;
            q[sz] = j;
            sz++;
            swap(pos[s[i]], pos[s[j]]);
            swap(s[i], s[j]);
        }
    }
    for (; sz < m; sz++) {
        p[sz] = q[sz] = 0;
    }
    return m;
}

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