제출 #1173846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173846		HappyCapybara	정렬하기 (IOI15_sorting)	C++20	54 / 100	6 ms	584 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[]){
	vector<int> f(N), g(N);
	for (int i=0; i<N; i++){
		f[i] = i;
		g[i] = i;
	}
	for (int i=0; i<M; i++){
		swap(g[X[i]], g[Y[i]]);
		swap(f[g[Y[i]]], f[g[X[i]]]);
	}
	//for (int i=0; i<N; i++) cout << f[i] << " " << g[i] << endl;
    vector<int> v(N);
	for (int i=0; i<N; i++) v[i] = S[g[i]];
	//for (int i=0; i<N; i++) cout << v[i] << " ";
	//cout << endl;
	vector<int> s(N);
	for (int i=0; i<N; i++) s[i] = S[i];
	vector<int> s2 = s;
	sort(s2.begin(), s2.end());
	for (int i=0; i<M; i++){
		swap(f[X[i]], f[Y[i]]);
		swap(g[f[Y[i]]], g[f[X[i]]]);
		P[i] = 0;
		Q[i] = 0;
		for (int j=0; j<N; j++){
			if (v[j] != j){
				P[i] = g[j];
				Q[i] = g[v[j]];
				swap(v[j], v[v[j]]);
				break;
			}
		}
		swap(s[X[i]], s[Y[i]]);
		swap(s[P[i]], s[Q[i]]);
		if (s == s2) return i+1;
	}
	//for (int i=0; i<N; i++) cout << f[i] << " " << g[i] << endl;
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

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