답안 #745656

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
745656	2023-05-20T18:33:59 Z	Dan4Life	정렬하기 (IOI15_sorting)	C++17	컴파일 오류	0 ms	0 KB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)2e5+10;
int n, a[mxN], t[mxN], x[mxN], y[mxN], pos[mxN], vis[mxN];

void swp(int i, int j){ 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] = t[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(vis[i]) continue;
        vector<int> v; v.clear(); int j = i;
        while(!vis[j]) vis[j]=1, v.push_back(j), j = a[j];
        int s = (int)v.size();
        for(j = 0; j < s-1; tot++, j++){
            P[tot] = pos[a[v[j]]];
            Q[tot] = pos[a[v[j+1]]];
            swp(pos[a[v[j]]],pos[a[v[j+1]]]);
        }
    }
    return (is_sorted(a,a+n) and tot<=m)?m: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] = t[i] = A[i];
        x[i] = X[i], y[i] = Y[i];
    }
    int l = 0, r = n-1;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,a,P,Q)<=mid) r=mid;
        else l=mid+1;
    }
    int ans = chk(l,P,Q);
    return ans;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:38:25: error: too many arguments to function 'int chk(int, int*, int*)'
   38 |         if(chk(mid,a,P,Q)<=mid) r=mid;
      |                         ^
sorting.cpp:9:5: note: declared here
    9 | int chk(int m, int P[], int Q[]){
      |     ^~~
sorting.cpp:29:39: warning: unused parameter 'm' [-Wunused-parameter]
   29 | int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^