# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318033 | wildturtle | Sorting (IOI15_sorting) | C++14 | 380 ms | 25172 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 <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int a,le,ri,ans,mid;
int S1[500005],A[500005];
vector < pair < int , int > > v;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
le=0; ri=M; ans=-1;
while(le<=ri) {
mid=(le+ri)/2;
for(int i=0;i<N;i++)
S1[i]=S[i];
for(int i=0;i<mid;i++) {
swap(S1[X[i]],S1[Y[i]]);
}
for(int i=0;i<N;i++) {
A[S1[i]]=i;
}
v.clear();
for(int i=0;i<N;i++) {
if(S1[i]==i) continue;
v.push_back({i,S1[i]});
swap(S1[i],S1[A[i]]);
swap(A[i],A[S1[A[i]]]);
}
a=v.size();
if(a<=mid) {
for(int i=0;i<N;i++) {
S1[i]=S[i];
A[S1[i]]=i;
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... |