Submission #135303

#	Time	Username	Problem	Language	Result	Execution time	Memory
135303		tinjyu	정렬하기 (IOI15_sorting)	C++14	0 / 100	6 ms	456 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 num[50005];
    for(int i=0;i<n;i++)num[i]=i;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<i;j++)
        {
            if(s[i]<s[j])
            {
                swap(num[i],num[j]);
                swap(s[i],s[j]);
            }
        }
    }
    for(int i=0;i<n;i++)s[num[i]]=i;
    int r=0;
    for(int i=1;i<n;i++)
    {
        int t=0;
        for(int j=0;j<n;j++)if(s[j]==i)
        {
            t=j;
            break;
        }
        p[r]=i;
        q[r]=t;
        swap(s[i],s[t]);
        swap(s[x[i-2]],s[y[i-2]]);
        r++;
    }
    if(s[0]!=0)r++;
	return r+1;
}

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]
 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