Submission #134284

#TimeUsernameProblemLanguageResultExecution timeMemory
134284Runtime_error_Sorting (IOI15_sorting)C++14
0 / 100
4 ms380 KiB
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    if(N < 2)
        return 0;

    int l =2,tr=1;
    for(int i=0;i<N;i++)
        if(S[i] != i)
            tr = 0;
    if(tr)
        return 0;

    for(int i=0;i<M;i++){
        swap( S[ X[i] ],S[ Y[i] ] );

        while(S[l] == l && l<N)
            l++;

        if( l == N){

            if(S[0] == 0 && S[1] == 1)
                P[i] = 0,Q[i] = 0;

            else
                P[i]=0,Q[i] = 1;

            i++;
            return i;
        }
        int j;
        for(j=0;j<N;j++)
            if(S[j] == l)
                break;
        P[i] = l , Q[i] = j;
        swap(S[l],S[j]);
    }
}


Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...