Submission #1108058

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108058		Aviansh	Sorting (IOI15_sorting)	C++17	16 / 100	42 ms	38472 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    int be[n];
    iota(be,be+n,0);
    int ber[m][n];
    for(int i = m-1;i>=0;i--){
        swap(be[x[i]],be[y[i]]);
        for(int j = 0;j<n;j++){
            ber[i][be[j]]=j;
        }
    }
    int r = 0;
    for(int i = 0;i<n;i++){
        swap(s[x[i]],s[y[i]]);
        int ind = find(s,s+n,i)-s;
        swap(s[ind],s[ber[r+1][i]]);
        p[r]=ind;
        q[r]=(ber[r+1][i]);
        r++;
    }
    assert(r<=m);
    for(;r<m;r++){
        p[r]=0;
        q[r]=0;
        swap(s[x[r]],s[y[r]]);
    }
    for(int i = 0;i<n;i++){
        assert(s[i]==i);
    }
	return r;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:19:32: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   19 |         int ind = find(s,s+n,i)-s;
      |                   ~~~~~~~~~~~~~^~

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