Submission #298494

#	Time	Username	Problem	Language	Result	Execution time	Memory
298494		TMJN	정렬하기 (IOI15_sorting)	C++17	0 / 100	1 ms	384 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[]) {
	int d=0;
	for(int i=0;i<N;i++){
		if(S[i]!=i)d++;
	}
	for(int i=0;i<M;i++){
		if((d+1)/2<=i)return i;
		d+=(S[X[i]]==X[i])+(S[Y[i]]==Y[i]);
		swap(S[X[i]],S[Y[i]]);
		d-=(S[X[i]]==X[i])+(S[Y[i]]==Y[i]);
		if((d+1)/2<=i+1)return i+1;
	}
	return -1;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:64: warning: unused parameter 'P' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                            ~~~~^~~
sorting.cpp:5:73: warning: unused parameter 'Q' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                                     ~~~~^~~

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