Submission #95508

#	Time	Username	Problem	Language	Result	Execution time	Memory
95508		tincamatei	정렬하기 (IOI15_sorting)	C++14	20 / 100	4 ms	384 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200000;

int *p, *q, *s;
int top;

int poz[MAX_N];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
  p = P;
  q = Q;
  s = S;

  for(int i = 0; i < N; ++i)
    poz[i] = i;

  for(int i = 0; i < N; ++i) {
    while(i != S[i]) {
      p[top] = i;
      q[top++] = S[i];
      swap(S[i], S[S[i]]);
    }
  }

	return top;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:13:39: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
                                       ^
sorting.cpp:13:48: warning: unused parameter 'X' [-Wunused-parameter]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
                                                ^
sorting.cpp:13:57: warning: unused parameter 'Y' [-Wunused-parameter]
 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