Submission #286713

#	Time	Username	Problem	Language	Result	Execution time	Memory
286713		Ozy	Sorting (IOI15_sorting)	C++17	0 / 100	1 ms	512 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define debug(a) cout << #a << " = " << a << endl

int sum,largo,act,cont;
int seg,n,m,w,pas;
int s[200001],x[600001],y[600001],doble[200001],visitados[200001];

bool checa(int pos) {

    rep(i,0,n-1) visitados[i] = 0;
    rep(i,0,n-1) doble[i] = s[i];
    rep(i,0,pos) {
        w = doble[x[i]];
        doble[x[i]] = doble[y[i]];
        doble[y[i]] = w;
    }

    sum = 0;
    rep(i,0,n-1) {
        if (visitados[i] == 0) {

            act = doble[i];
            largo = 0;
            visitados[i] = 1;

            while (act != i) {
                largo++;
                visitados[act] = 1;
                act = doble[act];
            }

            sum += largo;

        }
    }

    if (sum <= pos) return true;
    else return false;

}

void binaria(int ini, int fin) {
    int mitad;

    if (ini <= fin) {
        mitad = (ini+fin)/2;
        if (checa(mitad)) {
            seg = mitad;
            binaria(ini,mitad-1);
        }
        else binaria(mitad+1 ,fin);

    }
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {

    n = N;
    m = M;
    rep(i,0,N) s[i] = S[i];
    rep(i,0,M) x[i] = X[i];
    rep(i,0,M) y[i] = Y[i];

    binaria(0,M-1);

    rep(i,0,n-1) visitados[i] = 0;
    rep(i,0,n-1) doble[i] = s[i];
    rep(i,0,seg) {
        w = doble[x[i]];
        doble[x[i]] = doble[y[i]];
        doble[y[i]] = w;
    }


    cont = 0;
    rep(i,0,n-1) {
        if (visitados[i] == 0) {

            act = doble[i];
            pas = i;
            visitados[i] = 1;

            while (act != i) {

                P[cont] = pas;
                Q[cont] = act;
                cont++;

                visitados[act] = 1;
                pas = act;
                act = doble[act];
            }

        }
    }


    return seg;
}

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