Submission #1108051

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1108051	2024-11-02T16:01:45 Z	Aviansh	Sorting (IOI15_sorting)	C++17	16 / 100	45 ms	38528 KB

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

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.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	592 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	592 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #3
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	3 ms	1372 KB	Output is correct
4	Correct	3 ms	1632 KB	Output is correct
5	Correct	3 ms	1636 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct