Submission #1018552

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018552		huutuan	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	348 KiB

sorting

#include "sorting.h"

#include <bits/stdc++.h>

using namespace std;

int a[200010], pos[200010], s[200010];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
   if (is_sorted(s, s+N)) return 0;
   for (int _=0; _<M; ++_){
      for (int i=0; i<N; ++i) s[i]=S[i];
      for (int i=0; i<N; ++i) pos[s[i]]=i;
      iota(a, a+N, 0);
      for (int i=_; i>=0; --i) swap(a[X[i]], a[Y[i]]);
      for (int i=0; i<M; ++i){
         P[i]=Q[i]=0;
         swap(a[X[i]], a[Y[i]]);
         swap(s[X[i]], s[Y[i]]);
         pos[s[X[i]]]=X[i];
         pos[s[Y[i]]]=Y[i];
         if (is_sorted(s, s+N)) return i+1;
         for (int j=0; j<N; ++j) if (a[j]!=s[j]){
            int k=pos[a[j]];
            P[i]=j, Q[i]=k;
            break;
         }
         swap(s[P[i]], s[Q[i]]);
         pos[s[P[i]]]=P[i];
         pos[s[Q[i]]]=Q[i];
         if (is_sorted(s, s+N)) return i+1;
      }
      return _+1;
   }
   return -1;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26