Submission #1053806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053806		Osplei	정렬하기 (IOI15_sorting)	C++17	20 / 100	1 ms	600 KiB

sorting

#include "sorting.h"
    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define pb push_back
     
    typedef long long ll;
    typedef pair <ll, ll> LL;
     
    int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
     
      vector <int> orden;
      int ans = 0, pos = 0;
     
      for (int i = 0; i < N; i++) {
        orden.pb(S[i]);
      }
     
      sort(orden.begin(), orden.end());
     
      for (int i = 0; i < N; i++) {
     
        if (orden[i] != S[i]) {
          
          ans++;
          
          swap(S[X[pos]], S[Y[pos]]);
          
          for (int j = i; j < N; j++) {
            if (orden[i] == S[j]) {
     
              swap(S[i], S[j]);
     
              P[pos] = i;
              Q[pos] = j;
     
              pos++;
     
              break;
            }
          }
        }
     
      }

      for (int i = 0; i < N; i++) {
     
        if (orden[i] != S[i]) {
          
          ans++;
          
          swap(S[X[pos]], S[Y[pos]]);
          
          for (int j = i; j < N; j++) {
            if (orden[i] == S[j]) {
     
              swap(S[i], S[j]);
     
              P[pos] = i;
              Q[pos] = j;
     
              pos++;
     
              break;
            }
          }
        }
     
      }

      for (int i = 0; i < N; i++) {
     
        if (orden[i] != S[i]) {
          
          ans++;
          
          swap(S[X[pos]], S[Y[pos]]);
          
          for (int j = i; j < N; j++) {
            if (orden[i] == S[j]) {
     
              swap(S[i], S[j]);
     
              P[pos] = i;
              Q[pos] = j;
     
              pos++;
     
              break;
            }
          }
        }
     
      }
     
      if (N != 1 && S[0] > S[1]) {
        ans++;
        P[pos] = 0;
        Q[pos] = 1;
        pos++;
      } 
     
      return ans;
    }

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:11:43: warning: unused parameter 'M' [-Wunused-parameter]
   11 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                       ~~~~^

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