Submission #885844

#	Time	Username	Problem	Language	Result	Execution time	Memory
885844		JakobZorz	Sorting (IOI15_sorting)	C++17	16 / 100	3 ms	600 KiB

sorting

#include"sorting.h"
#include<iostream>
#include<vector>
using namespace std;

int n;
int*x,*y,*s;

vector<pair<int,int>>construct(int m){
    vector<pair<int,int>>ans(m);
    vector<int>perm(n),curr(n);
    for(int i=0;i<n;i++){
        perm[i]=i;
        curr[i]=s[i];
    }
    
    for(int i=0;i<m;i++)
        swap(curr[x[i]],curr[y[i]]);
    
    for(int i=m-1;i>=0;i--)
        swap(perm[x[i]],perm[y[i]]);
    
    for(int i=0;i<m;i++){
        swap(perm[x[i]],perm[y[i]]);
        for(int j=0;j<n;j++){
            if(curr[j]!=j){
                ans[i].first=perm[j];
                for(int k=0;k<n;k++){
                    if(curr[k]==j){
                        swap(curr[j],curr[k]);
                        ans[i].second=perm[k];
                        break;
                    }
                }
                break;
            }
        }
    }
    
    return ans;
}

int findSwapPairs(int N,int S[],int _,int X[],int Y[],int P[],int Q[]){
    n=N;
    x=X;
    y=Y;
    s=S;
    
    vector<pair<int,int>>res=construct(n);
    for(int i=0;i<n;i++){
        P[i]=res[i].first;
        Q[i]=res[i].second;
    }
    
    vector<int>test(n);
    for(int i=0;i<n;i++)
        test[i]=s[i];
    
    for(int i=0;i<n;i++){
        swap(test[x[i]],test[y[i]]);
        swap(test[P[i]],test[Q[i]]);
    }
    
    //for(int i:test)
        //cout<<i<<" ";
    //cout<<"\n";
	return n;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:43:37: warning: unused parameter '_' [-Wunused-parameter]
   43 | int findSwapPairs(int N,int S[],int _,int X[],int Y[],int P[],int Q[]){
      |                                 ~~~~^

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