Submission #1355071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1355071		yogesh_sane	Sorting (IOI15_sorting)	C++20	16 / 100	13 ms	484 KiB

sorting

#include <bits/stdc++.h>
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    vector<int>pos(N);
    for(int i = 0; i < M; i++){
        iota(pos.begin(), pos.end(), 0);
        for(int j = i+1; j < M; j++)
            swap(pos[X[j]], pos[Y[j]]);
        swap(S[X[i]], S[Y[i]]);            
        for(int j = 0; j < N; j++){
            if(S[pos[j]] != j){
                int k = find(S, S+N, j)-S;
                P[i] = pos[j];
                Q[i] = k;
                swap(S[pos[j]], S[k]);
                break;
            }
        }
    }
    return M;
}

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