Submission #65690

#	Time	Username	Problem	Language	Result	Execution time	Memory
65690		Talant	Sorting (IOI15_sorting)	C++17	0 / 100	4 ms	356 KiB

sorting

#include "sorting.h"
//#include "grader.cpp"

#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back

using namespace std;

const int NN = (1e6 + 5);
const int inf = (1e9 + 7);

int id = -1;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      for (int i = 0; i < N; i ++) {
            int pos = i;
            for (int j = 0; j < N; j ++) {
                  if (i == S[j]) {
                        pos = j;
                        break;
                  }
            }
            P[++id] = i;
            Q[id] = pos;
            swap(S[i],S[pos]);
      }
      return (id + 1);
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18: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:18: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:18: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: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26