Submission #434628

#	Time	Username	Problem	Language	Result	Execution time	Memory
434628		Maqsut_03	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	716 KiB

sorting

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

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]){
    int R = 0;
    for (int i = 0 ; i< N; i++) {
        for (int j = 1; j < N; j++) {
            if (S[j-1] > S[j]) {
                std::swap(S[j-1],S[j]);
                P[R] = j-1;
                Q[R] = j;
                R++;
            }
        }
    }
    assert(R<=M);
    for (int i = 0;i<N;i++) {
        assert(S[i]==i);
    }
    return R;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
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