Submission #1018524

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018524		huutuan	정렬하기 (IOI15_sorting)	C++14	16 / 100	7 ms	516 KiB

sorting

#include "sorting.h"

#include <bits/stdc++.h>

using namespace std;

int a[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;
   iota(a, a+N, 0);
   for (int i=M-1; i>=0; --i) swap(a[X[i]], a[Y[i]]);
   for (int i=0; i<M; ++i){
      swap(a[X[i]], a[Y[i]]);
      swap(S[X[i]], S[Y[i]]);
      for (int j=0; j<N; ++j) if (a[j]!=S[j]){
         int k=find(S, S+N, a[j])-S;
         P[i]=j; Q[i]=k;
         swap(S[j], S[k]);
         break;
      }
   }
   return M;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:17:34: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   17 |          int k=find(S, S+N, a[j])-S;
      |                ~~~~~~~~~~~~~~~~~~^~

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