Submission #745642

# Submission time Handle Problem Language Result Execution time Memory
745642 2023-05-20T17:41:31 Z Dan4Life Sorting (IOI15_sorting) C++17
0 / 100
2 ms 468 KB
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)2e5+10;
int n, a[mxN], temp[mxN], x[mxN], y[mxN], pos[mxN], vis[mxN];

void swp(int i, int j){
    if(i==j) return;
    swap(pos[a[i]],pos[a[j]]), swap(a[i],a[j]);
}

int chk(int m, int P[], int Q[]){
    for(int i = 0; i < n; i++)
        a[i] = temp[i], vis[i]=0, pos[a[i]] = i;
    for(int i = 0; i < m; i++)
        swp(x[i],y[i]), P[i]=Q[i]=0;
    int tot = 0;
    for(int i = 0; i < n; i++){
        if(pos[i]==i) continue;
        if(vis[i]) continue;
        int j = i;
        while(!vis[j]){
            P[tot] = j, Q[tot] = pos[j];
            vis[j]=1; j = pos[j];
            swp(P[tot],Q[tot]), tot++;
        }
    }
    if(is_sorted(a,a+n) and tot<=m) return m;
    return mxN;
}

int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
    n = N;
    for(int i = 0; i < n; i++)
        a[i] = temp[i] = A[i];
    for(int i = 0; i < m; i++)
        x[i] = X[i], y[i] = Y[i], P[i]=Q[i]=0;
    int l = 0, r = m;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,P,Q)<=mid) r=mid;
        else l=mid+1;
    }
    return chk(l,P,Q);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -