Submission #426952

#	Time	Username	Problem	Language	Result	Execution time	Memory
426952		ollel	Sorting (IOI15_sorting)	C++14	20 / 100	1 ms	332 KiB

sorting

#include <bits/stdc++.h>
#include <iostream>
using namespace std;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;

int findSwapPairs(int n, int S[], int M, int X[], int Y[], int P[], int Q[]) {

  if (Y[0] == 1) {

  if (n == 1) return 0;
  int r = 0;
  swap(S[0], S[1]);
  rep(i,0,n) {
    if (S[i] == 0) {
      P[r] = 0;
      Q[r] = i;
      swap(S[i], S[0]);
      r++;
    }
  }

  swap(S[0], S[1]);
  rep(i,0,n) {
    if (S[i] == 1) {
      P[r] = 0;
      Q[r] = 0;
      swap(S[i], S[0]);
      r++;
    }
  }

  rep(i, 2, n) {
    while (S[i] != i) {
      swap(S[0], S[1]);
      P[r] = i;
      Q[r] = S[i];
      swap(S[i], S[S[i]]);
      r++;
    }
  }

  if (S[0] == 0) return r;
  P[r] = Q[r] = 0;
  return r + 1;

  }

  int r = 0;
  rep(i,0,n) {
    while (S[i] != i) {
      int nw = S[S[i]];
      P[r] = i; Q[r] = S[i];
      swap(S[i], S[S[i]]);
      r++;
    }
  }
  return r;
}

// int main() {
//   int n = 5;
//   int S[] = {4, 0, 2, 1, 3};
//   int M;
//   int X[5], Y[5], P[5], Q[5];
//   cout << findSwapPairs(n, S, M, X, Y, P, Q) << endl;
//   rep (i, 0, 5) cout << P[i] << " " << Q[i] << endl;
// }

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:58:11: warning: unused variable 'nw' [-Wunused-variable]
   58 |       int nw = S[S[i]];
      |           ^~
sorting.cpp:13:39: warning: unused parameter 'M' [-Wunused-parameter]
   13 | int findSwapPairs(int n, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:13:46: warning: unused parameter 'X' [-Wunused-parameter]
   13 | 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