제출 #69018

#제출 시각아이디문제언어결과실행 시간메모리
69018theknife2001Sorting (IOI15_sorting)C++17
20 / 100
6 ms640 KiB
#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;
const int N=555;
int b[N];
int n;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
    n=N;
    for(int i=0;i<n;i++)
        b[S[i]]=i;
    int ans=0;
    for(int j=0;j<M;j++)
    {
        swap(b[S[X[j]]],b[S[Y[j]]]);
        swap(S[X[j]],S[Y[j]]);
        for(int i=n-1;i>=0;i--)
        {
            if(S[i]!=i)
            {
                P[ans]=b[i];
                Q[ans]=i;
                swap(b[i],b[S[i]]);
                swap(S[i],S[b[S[i]]]);
                ans++;
                break ;
            }
            else if(i==0)
            {
                return ans;
            }
        }
//        for(int i=0;i<n;i++)
//            cout<<b[i]<<' ';
//        cout<<endl;
//        for(int i=0;i<n;i++)
//            cout<<S[i]<<' ';
//        cout<<endl;
    }
    return ans;
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:9:76: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
                                                                            ^
sorting.cpp:5:11: note: shadowed declaration is here
 const int N=555;
           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...