Submission #1053713

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053713		XJP12	Sorting (IOI15_sorting)	C++14	20 / 100	2 ms	348 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
typedef vector<int> vi;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
		int r=0;
	bool ban=true;
	for(int i=0; i<n; i++){
		if(s[i]!=i){
			ban=false;
			break;
		}
	}
	if (ban) return 0;
    if(y[0]==1){
		for(int i=0; i<n; i++){
			swap(s[1], s[0]);
			r++;
			/*for(int j=0; j<n; j++){
				cout<<s[j]<<" ";
			}*/
		//	cout<<endl;
		ban=true;
		for(int j=0; j<n; j++){
			if(s[j]!=j){
				ban=false;
				break;
			}
		}
		if (ban) break;
			for(int j=0; j<n; j++){
				if(s[j]==i){
					if(s[i]==0 && i==1){
						p[r-1]=j;
						q[r-1]=i-1;
						swap(s[i-1], s[j]);
					}else{
					p[r-1]=j;
					q[r-1]=i;
					swap(s[i], s[j]);
					}
					break;
				}
			}
		/*	for(int j=0; j<n; j++){
				cout<<s[j]<<" ";
			}
			cout<<endl<<endl;*/
		}
		if(s[1]!=1 && s[0]!=0){
			p[r]=0;
			q[r]=1;
			r++;
		}
			/*for(int i=0; i<r; i++){
			cout<<p[i]<<" "<<q[i]<<endl;
		}*/
	}else{
		for(int i=0; i<n; i++){
			for(int j=0; j<n; j++){
				if(s[j]==i && j!=i){
					r++;
					p[r-1]=j;
					q[r-1]=i;
					swap(s[i], s[j]);
					break;
				}
			}
		/*	for(int j=0; j<n; j++){
				cout<<s[j]<<" ";
			}
			cout<<endl;*/
		}
	/*	for(int i=0; i<r; i++){
			cout<<p[i]<<" "<<q[i]<<endl;
		}*/
	}
	return r;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:39: warning: unused parameter 'm' [-Wunused-parameter]
    5 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                   ~~~~^
sorting.cpp:5:46: warning: unused parameter 'x' [-Wunused-parameter]
    5 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                          ~~~~^~~

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