Submission #837427

#	Time	Username	Problem	Language	Result	Execution time	Memory
837427		oscar1f	Sorting (IOI15_sorting)	C++17	16 / 100	14 ms	580 KiB

sorting

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

using namespace std;

const int MAX_SWAP=1000*1000;
int nbVal,nbSwap,posModif,nouvVal;
int autreSwap[MAX_SWAP][2];
int val[MAX_SWAP];
int obj[MAX_SWAP];
vector<pair<int,int>> rep;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	nbVal=N;
	nbSwap=M;
	for (int i=0;i<nbVal;i++) {
		val[i]=S[i];
	}
	for (int i=0;i<nbSwap;i++) {
		autreSwap[i][0]=X[i];
		autreSwap[i][1]=Y[i];
	}

	for (int i=0;i<nbVal;i++) {
		obj[i]=i;
	}
	for (int i=nbSwap-1;i>=0;i--) {
		swap(obj[autreSwap[i][0]],obj[autreSwap[i][1]]);
		/*for (int j=0;j<nbVal;j++) {
			cout<<obj[j]<<" ";
		}
		cout<<endl;*/
	}
	for (int i=0;i<nbSwap;i++) {
		swap(obj[autreSwap[i][0]],obj[autreSwap[i][1]]);
		swap(val[autreSwap[i][0]],val[autreSwap[i][1]]);
		posModif=0;
		nouvVal=0;
		for (int j=0;j<nbVal;j++) {
			if (val[j]!=obj[j]) {
				posModif=j;
			}
		}
		for (int j=0;j<nbVal;j++) {
			if (obj[j]==val[posModif]) {
				nouvVal=j;
			}
		}
		/*for (int j=0;j<nbVal;j++) {
			cout<<val[j]<<" ";
		}
		cout<<"    ";
		for (int j=0;j<nbVal;j++) {
			cout<<obj[j]<<" ";
		}
		cout<<"         ";

		cout<<posModif<<" : ";*/
		rep.push_back({posModif,nouvVal});
		swap(val[posModif],val[nouvVal]);
		/*for (int j=0;j<nbVal;j++) {
			cout<<val[j]<<" ";
		}
		cout<<"    ";
		for (int j=0;j<nbVal;j++) {
			cout<<obj[j]<<" ";
		}
		cout<<endl;*/
	}

	for (int i=0;i<nbSwap;i++) {
		P[i]=rep[i].first;
		Q[i]=rep[i].second;
	}
	return nbSwap;
}

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