제출 #135329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135329		tinjyu	정렬하기 (IOI15_sorting)	C++14	20 / 100	8 ms	376 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;
    //for(int i=0;i<n;i++)cout<<s[i]<<" ";
    //cout<<endl;
    int r=0;
    for(int i=0;i<n;i++)
    {
        int t=0;
        swap(s[x[r]],s[y[r]]);
        //cout<<x[r]<<" "<<y[r]<<endl;
        for(int j=0;j<n;j++)if(s[j]==i)
        {
            t=j;
            break;
        }
        //cout<<i<<" "<<t<<endl;
        if(i==t)
        {

            swap(s[x[r]],s[y[r]]);
            continue;
        }
        swap(s[i],s[t]);
        P[r]=i;
        Q[r]=t;
        r++;
        int cnt=0;
        for(int i=0;i<n-1;i++)
        {
            //cout<<s[i]<<" ";
            if(s[i]>s[i+1])cnt=1;
        }
        if(cnt==0)break;
        //cout<<endl;
    }
    if(s[0]==1)
    {
        r++;
        P[r]=0;
        Q[r]=1;
    }
	return r;
}

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:44:17: warning: declaration of 'i' shadows a previous local [-Wshadow]
         for(int i=0;i<n-1;i++)
                 ^
sorting.cpp:22:13: note: shadowed declaration is here
     for(int i=0;i<n;i++)
             ^
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: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26