oj.uz

답안 #1018550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018550 2024-07-10T06:44:02 Z huutuan 정렬하기 (IOI15_sorting) C++14
0 / 100
 1 ms 2396 KB 
#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[]) {
   for (int i=0; i<N; ++i) pos[s[i]]=i;
   if (is_sorted(s, s+N)) return 0;
   for (int _=0; _<M; ++_){
      for (int i=0; i<N; ++i) s[i]=S[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 0;
         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 0;
      }
      return _+1;
   }
   return -1;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -