oj.uz

답안 #419232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419232 2021-06-06T15:02:15 Z Mounir 정렬하기 (IOI15_sorting) C++14
0 / 100
 1 ms 460 KB 
#include "sorting.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define chmax(x, v) x = max(x, v)
#define chmin(x, v) x = min(x, v)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<int, int>
#define x first
#define y second
using namespace std;

const int N_VALS = 1e6;

int nVals, nTours;
vector<int> vals, tmp;
vector<pii> modifs;
bool vu[N_VALS];

int nCycles(){
	for (int ind = 0; ind < nVals; ++ind)
		vu[ind] = false;
	
	int nb = 0;
	
	//cout << "BEGIN" << endl;

	for (int depart = 0; depart < nVals; ++depart){
		if (!vu[depart]){
			nb++;

			vu[depart] = true;
			int noeud = vals[depart];
			while (noeud != depart){
				vu[noeud] = true;
				noeud = vals[noeud];
			}
		}
	}

	//cout << "END" << endl;

	return nb;
}

void faireSwaps(int borneMax){
	for (int ind = 0; ind < nVals; ++ind)
		vals[ind] = tmp[ind];
	for (int ind = 1; ind < borneMax; ++ind)
		swap(vals[modifs[ind].x], vals[modifs[ind].y]);
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    //initialisation.
    nVals = N, nTours = M;
    vals.resize(nVals), tmp.resize(nVals);
    for (int ind = 0; ind < nVals; ++ind)
    	vals[ind] = tmp[ind] = S[ind];

    modifs.resize(nTours + 1);
    for (int ind = 0; ind < nTours; ++ind)
    	modifs[ind + 1] = {X[ind], Y[ind]};


    //Dichotomie pour trouver R.
    int gauche = 0, droite =  nTours + 1; //vu que la fin est exclue
    while (droite > gauche){
    	int milieu = (droite + gauche)/2;
    	faireSwaps(milieu);

    //	cout << "m " <<  milieu << " " << gauche << " " << droite << endl;

    /*	cout << "MILIEU " << milieu << " " << nCycles() << endl;
    	for (int val : vals)
    		cout << val << " ";
    	cout << endl;
*/
    	if (milieu >= nVals - nCycles())
    		droite = milieu;
    	else
    		gauche = milieu + 1;
    }

    

    int res = gauche - 1;
    faireSwaps(res); 

    vector<int> p, q;

    int nb = 0;
    for (int ind = 0; ind < nVals; ++ind){
    	while (vals[ind] != ind){
    		p.pb(ind);
    		q.pb(vals[ind]);
    		swap(vals[ind], vals[vals[ind]]);
    		nb++;
    	}
    }

    while (nb < res){
 		p.pb(0);
 		q.pb(0);
 		nb++;
    }
/*
 	for (int ind = 0; ind < res; ++ind)
 		cout << P[ind] << " " << Q[ind] << endl;
*/


    vector<int> permutation(nVals);
    for (int ind = 0; ind < nVals; ++ind)
    	permutation[ind] = ind;

    for (int iModif = res; iModif >= 2; --iModif){
    	swap(vals[permutation[modifs[iModif].x]], vals[permutation[modifs[iModif].y]]);
    	swap(permutation[modifs[iModif].x], permutation[modifs[iModif].y]);
    	p[iModif] = vals[p[iModif]];
    	q[iModif] = vals[q[iModif]];             
    }


    for (int ind = 0; ind < res; ++ind){
    	P[ind] = p[ind];
    	Q[ind] = q[ind];
    }
/*
    for (int ind = 0; ind < res; ++ind){
    	P[ind] = P[ind + 1];
    	Q[ind] = Q[ind + 1];
    }
*/
/*
    cout << "SALUT\n";
    for (int ind = 0; ind < res; ++ind){
    	cout << "TOUR\n";
    	cout << X[ind] << " " << Y[ind] << endl;
    	cout << P[ind] << " " << Q[ind] << endl;
    	swap(vals[X[ind]], vals[Y[ind]]);
    	swap(vals[P[ind]], vals[Q[ind]]);

    	for (int val : vals)
    		cout << val << " ";
    	cout << endl;
    }

*/

	return res;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 204 KB MODEL SOLUTION IS WRONG
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 204 KB MODEL SOLUTION IS WRONG
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Failed 1 ms 204 KB MODEL SOLUTION IS WRONG
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 204 KB MODEL SOLUTION IS WRONG
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -