Submission #434622

#	Time	Username	Problem	Language	Result	Execution time	Memory
434622		Maqsut_03	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	460 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
int S[500500];
int findSwapPairs(int N, int s[], int M, int X[], int Y[], int P[], int Q[]) {
    for (int i = 0;i<M;i++) {
        assert(X[i]+Y[i]==0);
    }
    for (int i = 0; i < N; i++) S[i] = s[i];
    int r = 0;
    for (int i=0; i<N; i++)
        for (int j=i; j<N; j++)
    {
        if (S[i] > S[j]) {
                swap(S[i], S[j]); P[r] = i; Q[r] = j; r++;
        }
    }
    return M;
}

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