Submission #100608

#	Time	Username	Problem	Language	Result	Execution time	Memory
100608		luciocf	정렬하기 (IOI15_sorting)	C++14	0 / 100	3 ms	384 KiB

sorting

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

using namespace std;

const int maxn = 2e5+10;

int pos[maxn];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) 
{
    for (int i = 0; i < N; i++) pos[S[i]] = i;

    if (Y[0] == 0)
    {   
        for (int i = 0; i < N; i++)
        {
            int j = S[i];

            P[i] = pos[i];
            Q[i] = i;

            S[pos[i]] = j;
            S[i] = i;

            pos[j] = pos[i];
            pos[i] = i;
        }
    }

    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]
 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) 
                                       ^
sorting.cpp:10:48: warning: unused parameter 'X' [-Wunused-parameter]
 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