Submission #223082

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

sorting

#include "sorting.h"
#include <vector>
using namespace std;

int findSwapPairs(int n, int a[], int m, int x[], int y[], int p[], int q[])
{
    for (int i = 0; i < n; ++i)
    {
        swap(a[x[i]], a[y[i]]);
        vector<int> b(a, a + n);
        for (int j = i + 1; j < n; ++j)
            swap(b[x[j]], b[y[j]]);
        for (int j = 0; j < n; ++j)
            if (a[j] == i)
            {
                p[i] = j;
                break;
            }
        for (int j = 0; j < n; ++j)
            if (a[j] == b[i])
            {
                q[i] = j;
                break;
            }
        swap(a[p[i]], a[q[i]]);
    }
    return n;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:39: warning: unused parameter 'm' [-Wunused-parameter]
 int findSwapPairs(int n, int a[], 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