oj.uz

답안 #745651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745651 2023-05-20T18:15:14 Z Dan4Life 정렬하기 (IOI15_sorting) C++17
0 / 100
 6 ms 980 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(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(int j = 0; j < s-1; j++)
            swp(v[j],v[j+1]), P[tot] = v[j], Q[tot++] = 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] = 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 = n-1;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,P,Q)<=mid) r=mid;
        else l=mid+1;
    }
    int ans = chk(l,P,Q);
    return ans;
}

Compilation message

sorting.cpp: In function 'int chk(int, int*, int*)':
sorting.cpp:23:17: warning: declaration of 'j' shadows a previous local [-Wshadow]
   23 |         for(int j = 0; j < s-1; j++)
      |                 ^
sorting.cpp:20:39: note: shadowed declaration is here
   20 |         vector<int> v; v.clear(); int j = i;
      |                                       ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 3 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 3 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 3 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 3 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 980 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 980 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -