Submission #990040

#	Time	Username	Problem	Language	Result	Execution time	Memory
990040		AdamGS	정렬하기 (IOI15_sorting)	C++17	16 / 100	8 ms	604 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
int findSwapPairs(int n, int S[], int m, int X[], int Y[], int P[], int Q[]) {
  vector<int>T(n);
  rep(i, n) T[i]=S[i];
  vector<int>C=T;
  rep(i, m) swap(T[X[i]], T[Y[i]]);
  int l=0;
  rep(i, m) {
    swap(C[X[i]], C[Y[i]]);
    while(l<n-1 && T[l]==l) ++l;
    if(l==n) {
      P[i]=Q[i]=0;
      continue;
    }
    int a=-1, b=-1;
    rep(j, n) if(C[j]==T[l]) a=j;
    rep(j, n) if(C[j]==T[T[l]]) b=j;
    P[i]=a;
    Q[i]=b;
    swap(C[a], C[b]);
    swap(T[l], T[T[l]]);
  }
  return m;
}

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