제출 #432561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432561		daniel920712	정렬하기 (IOI15_sorting)	C++14	8 / 100	1085 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,ok;
    for(i=N-1;i>=0;i--)
    {
        ok=1;
        for(j=0;j<N;j++) if(S[j]!=j) ok=0;
        if(ok) break;
        swap(S[X[now]],S[Y[now]]);
        for(j=0;j<N;j++)
        {
            if(S[j]==i)
            {
                if(i!=j)
                {
                    P[now]=i;
                    Q[now]=j;
                }
                else
                {
                    P[now]=1;
                    Q[now]=0;
                }
                swap(S[P[now]],S[Q[now]]);
                now++;
                break;
            }
        }

    }
    for(j=0;j<N;j++) if(S[j]!=j) while(1);
	return now;
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:34:34: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   34 |     for(j=0;j<N;j++) if(S[j]!=j) while(1);
      |                                  ^~~~~
sorting.cpp:35:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   35 |  return now;
      |  ^~~~~~
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[])
      |                                   ~~~~^

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