Submission #832578

#	Time	Username	Problem	Language	Result	Execution time	Memory
832578		aymanrs	정렬하기 (IOI15_sorting)	C++14	54 / 100	188 ms	664 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int R = 0;
	for(int i = 0;i < M;i++){
	    if(is_sorted(S, S+N)) return R;
		R++;
		swap(S[X[i]], S[Y[i]]);
		int opt[N];
		for(int j = 0;j<N;j++) opt[j]=j;
		for(int j = M-1;j > i;j--) swap(opt[X[j]], opt[Y[j]]);
		bool f = false;
		for(int j = 0;j < N;j++){
			if(S[j] != opt[j]){
				f = true;
				for(int k = j+1;k < N;k++) {
					if(S[k] == opt[j]) {
						P[R-1] = j;
						Q[R-1] = k;
						swap(S[j], S[k]);
						break;
					}
				}
				break;
			}
		}
		if(!f) P[R-1] = Q[R-1] = 0;
	}
	assert(is_sorted(S, S+N));
	return R;
}

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