oj.uz

Submission #837412

# Submission time Handle Problem Language Result Execution time Memory
837412 2023-08-25T10:36:51 Z oscar1f Sorting (IOI15_sorting) C++17
16 / 100
 13 ms 592 KB 
#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;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;
		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.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -