Submission #830575

#	Time	Username	Problem	Language	Result	Execution time	Memory
830575		Shithila	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	436 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
  int pos[N];
  for(int i=0;i<N;i++) pos[s[i]]=i;
  for(int i=0;i<N;i++)
  {
      P[i]=i;
      Q[i]=pos[i];
      int x=pos[i];
      pos[i]=i;
      pos[s[i]]=x;
      s[x]=s[i];
      s[i]=i;
    }
    return N;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:4:39: warning: unused parameter 'M' [-Wunused-parameter]
    4 | int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:4:46: warning: unused parameter 'X' [-Wunused-parameter]
    4 | int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:4:55: warning: unused parameter 'Y' [-Wunused-parameter]
    4 | int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~

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