Submission #1195172

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195172		nikulid	Sorting (IOI15_sorting)	C++20	0 / 100	1 ms	328 KiB

sorting

#include "sorting.h"
#include <vector>

using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int next;
    //bool already_sorted;
    //bool CHECKING=false, DEBUG=false;
    // we are given S[], M, X[], Y[]
    // we are to give P[], Q[]
    vector<int> ns(N);
    for(int i=0; i<N; i++){
    	ns[i] = S[i];
    }
    /*if(DEBUG)
    {
		for(auto x:ns){
	    	cout<<x<<" ";
	    }cout<<"\n\n";
	}*/

    for(int i=0; i<N; i++){
    	for(int j=0; j<N; j++){
    		if(ns[j] == i){
    			next = j;
    			break;
    		}
    	}
    	P[i] = i;
    	Q[i] = next;
    	swap(ns[i], ns[next]);
    	// we have "swapped" positions `i` and `trans[i]`. whatever that means.
    }

    /*for(auto x:ns){
    	cout<<x<<" ";
    }cout<<"\n\n";*/
	return N;
}

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