Submission #131577

#	Time	Username	Problem	Language	Result	Execution time	Memory
131577		MoNsTeR_CuBe	Sorting (IOI15_sorting)	C++17	0 / 100	10 ms	504 KiB

sorting

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

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    vector< int > simul(M);
    
    for(int i = 0; i < N; i++){
		simul[i] = i;
	}
	
	for(int i = 0; i < M; i++){
		swap(simul[X[i]], simul[Y[i]]);
	}
	
	vector< int > ends(N);
	
	for(int i = 0; i < N; i++){
		ends[simul[i]] = i;
	}
	
	for(int i = 0; i < N; i++){
		simul[i] = i;
	}
	
	for(int i = 0; i < M; i++){
		swap(simul[X[i]], simul[Y[i]]);
		swap(S[X[i]], S[Y[i]]);
		
		int index = -1;
		int lookFor = -1;

		bool verif = false;
		
		for(int j = 0; j < N; j++){
			if(S[j] != ends[simul[j]]){
				if(index == -1){
					index = j;
					lookFor = ends[simul[j]];
				}else if(lookFor == S[j]){
					P[i] = index;
					Q[i] = j;
					verif = true;
					//cout << "SWAP " << i << ' ' << "NUM " << index << ' ' << j << endl;
					swap(S[index], S[j]);
					swap(simul[index], simul[j]);
					break;
				}
			}
		}
		if(!verif){
			P[i] = 0;
			Q[i] = 0;
		}
	}
	
	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