Submission #958592

#TimeUsernameProblemLanguageResultExecution timeMemory
95859212345678Sorting (IOI15_sorting)C++17
54 / 100
2 ms604 KiB
#include "sorting.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=505;
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int idx[nx], s[nx];
    for (int i=0; i<N; i++) idx[i]=i, s[i]=S[i];
    for (int i=N-1; i>=0; i--) swap(idx[X[i]], idx[Y[i]]);
    for (int i=0; i<N; i++)
    {
        swap(idx[X[i]], idx[Y[i]]);
        swap(s[X[i]], s[Y[i]]);
        for (int j=0; j<N; j++) if (idx[j]==i) P[i]=j;
        for (int j=0; j<N; j++) 
        {
            if (s[j]==i) 
            {
                Q[i]=j;
                swap(s[P[i]], s[Q[i]]);
                break;
            }
        }
    }
    for (int i=0; i<N; i++)
    {
        swap(S[X[i]], S[Y[i]]);
        swap(S[P[i]], S[Q[i]]);
        bool sorted=1;
        for (int j=0; j<N; j++) if (S[j]!=j) sorted=0;
        if (sorted) return i+1;
    }
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:8:39: warning: unused parameter 'M' [-Wunused-parameter]
    8 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
   35 | }
      | ^
#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...