Submission #1088676

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088676		gustavo_d	정렬하기 (IOI15_sorting)	C++17	16 / 100	12 ms	552 KiB

sorting

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

int findSwapPairs(
	int N, int S[], int M, int X[], int Y[], int P[], int Q[]
) {
    swap(S[X[0]], S[Y[0]]); // now is our turn
    for (int t=0; t<N; t++) {
    	int permut[N];
    	for (int i=0; i<N; i++) permut[i] = i;
    	for (int i=t+1; i<M; i++) {
    		swap(permut[X[i]], permut[Y[i]]);
    	}
    	int a=0, b=0;
    	for (int i=0; i<N; i++) {
    		if (S[i] == t) a = i;
    	}
    	b = permut[t];
    	swap(S[a], S[b]);
    	P[t] = a; Q[t] = b;
    	swap(S[X[t+1]], S[Y[t+1]]);
    }

    for (int t=N; t<M; t++) {
    	P[t] = Q[t] = 0;
    }
    return M;
}

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