oj.uz

Submission #837449

# Submission time Handle Problem Language Result Execution time Memory
837449 2023-08-25T10:58:33 Z oscar1f Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 22596 KB 
#include<bits/stdc++.h>
#include "sorting.h"

using namespace std;

const int MAX_SWAP=1000*1000;
int nbVal,nbSwap,posModif,nouvVal,deb,fin,mid,verif;
int autreSwap[MAX_SWAP][2];
int val[MAX_SWAP];
int obj[MAX_SWAP];
vector<pair<int,int>> nouv;
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];
	}
    fin=nbSwap;
	rep.resize(nbSwap);
	while (deb!=fin) {
		mid=(deb+fin)/2;
		nouv.clear();
		for (int i=0;i<nbVal;i++) {
			obj[i]=i;
		}
		for (int i=0;i<nbVal;i++) {
			val[i]=S[i];
		}
		for (int i=mid-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<mid;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<<" : ";*/
			nouv.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;*/
		}
		verif=1;
		for (int i=0;i<nbVal;i++) {
			if (val[i]!=i) {
				verif=0;
			}
		}
		if (verif==0) {
			deb=mid+1;
		}
		if (verif==1) {
			fin=mid;
			if (nouv.size()<rep.size()) {
				rep=nouv;
			}
		}
	}
	for (int i=0;i<deb;i++) {
		P[i]=rep[i].first;
		Q[i]=rep[i].second;
	}
	return deb;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 452 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 452 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 388 KB Output is correct
21 Correct 14 ms 852 KB Output is correct
22 Correct 13 ms 852 KB Output is correct
23 Correct 13 ms 852 KB Output is correct
24 Correct 12 ms 852 KB Output is correct
25 Correct 17 ms 872 KB Output is correct
26 Correct 11 ms 908 KB Output is correct
27 Correct 12 ms 852 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 596 KB Output is correct
2 Correct 65 ms 596 KB Output is correct
3 Correct 57 ms 596 KB Output is correct
4 Correct 19 ms 604 KB Output is correct
5 Correct 18 ms 596 KB Output is correct
6 Correct 24 ms 584 KB Output is correct
7 Correct 47 ms 616 KB Output is correct
8 Correct 62 ms 584 KB Output is correct
9 Correct 61 ms 588 KB Output is correct
10 Correct 84 ms 608 KB Output is correct
11 Correct 69 ms 600 KB Output is correct
12 Correct 52 ms 596 KB Output is correct
13 Correct 60 ms 596 KB Output is correct
14 Correct 17 ms 596 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 596 KB Output is correct
2 Correct 65 ms 596 KB Output is correct
3 Correct 57 ms 596 KB Output is correct
4 Correct 19 ms 604 KB Output is correct
5 Correct 18 ms 596 KB Output is correct
6 Correct 24 ms 584 KB Output is correct
7 Correct 47 ms 616 KB Output is correct
8 Correct 62 ms 584 KB Output is correct
9 Correct 61 ms 588 KB Output is correct
10 Correct 84 ms 608 KB Output is correct
11 Correct 69 ms 600 KB Output is correct
12 Correct 52 ms 596 KB Output is correct
13 Correct 60 ms 596 KB Output is correct
14 Correct 17 ms 596 KB Output is correct
15 Execution timed out 1020 ms 22596 KB Time limit exceeded
16 Halted 0 ms 0 KB -