oj.uz

답안 #1018546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018546 2024-07-10T06:41:39 Z huutuan 정렬하기 (IOI15_sorting) C++14
54 / 100
 5 ms 728 KB 
#include "sorting.h"

#include <bits/stdc++.h>

using namespace std;

int a[200010], pos[200010];

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 728 KB Output is correct
22 Correct 4 ms 604 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 5 ms 600 KB Output is correct
27 Correct 5 ms 604 KB Output is correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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