Submission #1087017

#	Time	Username	Problem	Language	Result	Execution time	Memory
1087017		the_coding_pooh	Sorting (IOI15_sorting)	C++14	0 / 100	3 ms	600 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#define uwu return 0;

using namespace std;

const int SIZE = 2e5 + 5;

int s[SIZE], tar[SIZE], x[SIZE], y[SIZE], p[SIZE], q[SIZE], pos_of_val[SIZE];


void build(int M){
	for(int i = M - 1; i >= 0; i--){
		swap(tar[x[i]], tar[y[i]]);
	}
	return;
}

int get_sequence(int N, int M){
	for(int i = 0; i < M; i++){
		swap(s[x[i]], s[y[i]]);
		for(int j = 0; j < N; j++){
			pos_of_val[s[j]] = j;
		}
		swap(tar[x[i]], tar[y[i]]);
		bool st = 0;
		for(int j = 0; j < N; j++){
			if(s[j] != tar[j]){
				st = 1;
				swap(s[j], s[pos_of_val[tar[j]]]);
				p[i] = j;
				q[i] = pos_of_val[tar[j]];
				break;
			}
		}
		if(!st) 
			return i + 1;
	}
	return M;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for(int i = 0; i < N; i++){
		tar[i] = i;
		s[i] = S[i];
	}
	for(int i = 0; i < M; i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	for(int i = 0; i < M; i++){
		p[i] = 0;
		q[i] = 0;
	}
	int k = get_sequence(N, M);
	for(int i = 0; i < k; i++){
		P[i] = p[i];
		Q[i] = q[i];
	}
	return k;
}

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