Submission #432501

#	Time	Username	Problem	Language	Result	Execution time	Memory
432501		daniel920712	정렬하기 (IOI15_sorting)	C++14	20 / 100	2 ms	332 KiB

sorting

#include "sorting.h"
#include <iostream>
using namespace std;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    int i,j,now=0;
    for(i=0;i<N;i++)
    {
        for(j=0;j<N;j++)
        {
            if(S[j]==i)
            {
                if(i!=j)
                {
                    P[now]=i;
                    Q[now]=j;
                    now++;
                }

                swap(S[i],S[j]);
                break;
            }
        }
    }
	return now;
}

Compilation message (stderr)

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

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