Submission #1080950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080950		Trumling	정렬하기 (IOI15_sorting)	C++14	0 / 100	3 ms	432 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
     
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999999
typedef long long ll;
ll n;

int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[]) 
{ 
	n=N;

	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++)
			if(Se[j]==i)
			{
			P[i]=j;
			Q[i]=i;
			swap(Se[j],Se[i]);
			}

	return N;
		
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:13:40: warning: unused parameter 'M' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[])
      |                                    ~~~~^
sorting.cpp:13:47: warning: unused parameter 'X' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[])
      |                                           ~~~~^~~
sorting.cpp:13:56: warning: unused parameter 'Y' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], 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