# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134280 | Runtime_error_ | Sorting (IOI15_sorting) | C++14 | 4 ms | 420 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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, r =0,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){
// for(int i=0;i<N;i++)
// cout<<S[i]<<" ";
if(S[0] == 0 && S[1] == 1)
return i;
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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |