제출 #16643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16643		khsoo01	정렬하기 (IOI15_sorting)	C++98	74 / 100	58 ms	19888 KiB

sorting

#include<bits/stdc++.h>
#include "sorting.h"
using namespace std;
int n,m,cur[200005],def[200005],x[200005],y[200005];
int p[200005],q[20005],where[200005],vis[200005],cnt,ans;

void Swap(int A,int B) {
    int tmp;
    tmp=where[cur[A]];
    where[cur[A]]=where[cur[B]];
    where[cur[B]]=tmp;
    tmp=cur[A];
    cur[A]=cur[B];
    cur[B]=tmp;
}

int param(int s,int e) {
    int piv=(s+e)/2,i;
    for(i=0;i<n;i++) {
        cur[i]=def[i];
        where[cur[i]]=i;
    }
    for(i=0;i<piv;i++) {
        Swap(x[i],y[i]);
    }
    memset(vis,0,sizeof(vis));
    cnt=0;
    for(i=0;i<n;i++) {
        while(cur[i]!=i) {
            p[cnt]=cur[i];
            q[cnt]=cur[cur[i]];
            Swap(i,cur[i]);
            cnt++;
        }
    }
    if(s==e)return s;
    if(cnt<=piv) return param(s,piv);
    return param(piv+1,e);
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int i; n=N; m=M;
    for(i=0;i<n;i++) def[i]=S[i];
    for(i=0;i<m;i++) {
        x[i]=X[i];
        y[i]=Y[i];
    }
    ans=param(0,m);
    for(i=0;i<n;i++) {
        cur[i]=def[i];
        where[cur[i]]=i;
    }
    for(i=0;i<cnt;i++) {
        Swap(x[i],y[i]);
        P[i]=where[p[i]]; Q[i]=where[q[i]];
        Swap(where[p[i]],where[q[i]]);
    }
    for(i=cnt;i<ans;i++) {P[i]=0;Q[i]=0;}
    return ans;
}

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