Submission #1065136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065136		pawned	정렬하기 (IOI15_sorting)	C++17	0 / 100	1 ms	348 KiB

sorting

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

#include "sorting.h"

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	vi s;
	for (int i = 0; i < N; i++) {
		s.pb(S[i]);
	}
	for (int i = 0; i < N; i++) {
		int pos = -1;
		for (int j = 0; j < N; j++) {
			if (s[j] == i)
				pos = j;
		}
		P[i] = i;
		Q[i] = pos;
		swap(s[i], s[pos]);
	}
	P[N] = 0;
	Q[N] = 0;
	return N + 1;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:15:39: warning: unused parameter 'M' [-Wunused-parameter]
   15 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:15:46: warning: unused parameter 'X' [-Wunused-parameter]
   15 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:15:55: warning: unused parameter 'Y' [-Wunused-parameter]
   15 | 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