Submission #94894

#	Time	Username	Problem	Language	Result	Execution time	Memory
94894		someone_aa	Sorting (IOI15_sorting)	C++17	20 / 100	4 ms	668 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
const int maxn = 110;
int value[maxn], ind[maxn];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int br = 0;

    for(int i=0;i<N;i++) {
        value[i] = S[i];
        ind[S[i]] = i;
    }

    for(int i=0;i<M;i++) {

        ind[value[X[i]]] = Y[i];
        ind[value[Y[i]]] = X[i];
        swap(value[X[i]], value[Y[i]]);

        for(int i=N-1;i>=0;i--) {
            if(value[i] == i) continue;
            P[br] = i;
            Q[br] = ind[i];
            ind[value[i]] = ind[i];
            value[ind[i]] = value[i];
            value[i] = i;
            ind[i] = i;
            br++;
            break;
        }
    }

    return br;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:21:17: warning: declaration of 'i' shadows a previous local [-Wshadow]
         for(int i=N-1;i>=0;i--) {
                 ^
sorting.cpp:15:13: note: shadowed declaration is here
     for(int i=0;i<M;i++) {
             ^

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