Submission #712141

#	Time	Username	Problem	Language	Result	Execution time	Memory
712141		neki	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	340 KiB

sorting

#include <bits/stdc++.h>
//#include "sorting.h"
#define vc vector
 
using namespace std;
 
int findSwapPairs(int n, int s[], int m, int x[], int y[], int a[], int b[])
{
    int is[n];for(int i=0;i<n;++i) is[s[i]]=i;
    
    function<bool (int)> solve=[&](int meja){
        int p[n], ip[n], z[n], iz[n];
        for(int i=0;i<n;++i) p[i]=i, z[i]=iz[i]=i;
        for(int i=0;i<=meja;++i) swap(p[x[i]], p[y[i]]);
		for(int i=0;i<n;++i) ip[p[i]]=i;
        
        int j=0;
        for(int i=meja;i>=0;--i){
            while(j<n && j==s[p[iz[j]]]) ++j;
            if(j<n) a[i]=iz[j], b[i]=ip[is[j]];
            else a[i]=b[i]=0;
            
            swap(ip[p[x[i]]], ip[p[y[i]]]);
            swap(p[x[i]], p[y[i]]);
            
            swap(iz[z[a[i]]], iz[z[b[i]]]);
            swap(z[a[i]], z[b[i]]);
            swap(iz[z[x[i]]], iz[z[y[i]]]);
            swap(z[x[i]], z[y[i]]);
        }
        return j==n;
    };
    
    int l=0, r=m-1;
    while(l<r){
        int mid=(l+r)/2;
        
        if(solve(mid)) r=mid;
        else l=mid+1;
    }
    solve(l);
    
    return l;
}

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