Submission #434590

#	Time	Username	Problem	Language	Result	Execution time	Memory
434590		ismoilov	Sorting (IOI15_sorting)	C++17	0 / 100	1089 ms	332 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int check(int a[], int n){
    for(int i = 0; i < n; i ++)
        if(a[i] != i)
            return i;
    return -1;
}
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    int i = check(s, n);
    while(i != -1){
        swap(s[x[i]], s[y[i]]);
        for(int j = 0; j < n; j ++){
            if(s[j] == i){
                swap(s[j], s[i]);
                p[i] = i, q[i] = j;
            }
        }
        i = check(s, n);
    }
    return n;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:10:39: warning: unused parameter 'm' [-Wunused-parameter]
   10 | 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