Submission #1041970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041970		fv3	정렬하기 (IOI15_sorting)	C++14	0 / 100	1 ms	348 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[]) 
{
	// X[i] = Y[i] = 0
	int cnt = 0;
    for (int i = 0; i < N; i++)
    {
    	swap(S[0], S[1]);
    	int l = 0;
    	for (; l < N; l++)
    	{
    		if (S[l] != l)
    			break;
    	}

    	if (l == N)
    		break;
    	cnt++;


    	P[i] = (i == 1) ? 0 : i;
    	for (int j = 0; j < N; j++)
    	{
    		if (S[j] == i)
    		{
    			Q[i] = j;
    			if (i != j)
    				swap(S[i], S[j]);
    		}
    	}
    }

	int l = 0;
	for (; l < N; l++)
	{
		if (S[l] != l)
			break;
	}

	if (l == N)
		return cnt;
	P[cnt] = 0;
	Q[cnt] = 0;

	return cnt + 1;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:6:39: warning: unused parameter 'M' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                   ~~~~^
sorting.cpp:6:46: warning: unused parameter 'X' [-Wunused-parameter]
    6 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                          ~~~~^~~
sorting.cpp:6:55: warning: unused parameter 'Y' [-Wunused-parameter]
    6 | 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