oj.uz

답안 #800424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800424 2023-08-01T14:40:05 Z Dan4Life 정렬하기 (IOI15_sorting) C++17
0 / 100
 1 ms 448 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5+10;
int n, a[N], p[N], vis[N];
 
bool chk(int m, int A[], int X[], int Y[], int P[], int Q[]){
    for(int i = 0; i < n; i++) a[i] = A[i], vis[i]=0;
    for(int i = 0; i < m; i++) swap(a[X[i]],a[Y[i]]), P[i]=Q[i]=0;
    for(int i = 0; i < n; i++) p[a[i]]=i;
    int T = 0; fill(vis,vis+n,0);
    for(int i = 0; i < n; i++){
        if(vis[i]) continue; 
        int j = i; vector<int> v; v.clear();
        while(!vis[j]){
            vis[j] = 1; v.push_back(j); j = p[j];
        }
        //reverse(begin(v),end(v));
        for(int j = 0; j < (int)v.size()-1; j++){
            P[j] = v[j], Q[T] = v[j+1];
            swap(a[P[T]],a[Q[T]]);
            swap(p[a[P[T]]],p[a[Q[T]]]); T++;
        }
    }
    return T<=m;
}
 
int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
    n = N; if(is_sorted(A,A+n)) return 0;
    for(int i = 0; i < n; i++) a[i]=A[i];
    int l = 0, r = m;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,A,X,Y,P,Q)) r=mid;
        else l=mid+1;
    }
    chk(l,A,X,Y,P,Q); return l;
}

Compilation message

sorting.cpp: In function 'bool chk(int, int*, int*, int*, int*, int*)':
sorting.cpp:18:17: warning: declaration of 'j' shadows a previous local [-Wshadow]
   18 |         for(int j = 0; j < (int)v.size()-1; j++){
      |                 ^
sorting.cpp:13:13: note: shadowed declaration is here
   13 |         int j = i; vector<int> v; v.clear();
      |             ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:27:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   27 | int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
      |                   ~~~~^
sorting.cpp:3:11: note: shadowed declaration is here
    3 | const int N = (int)2e5+10;
      |           ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 308 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 448 KB Output isn't correct
2 Halted 0 ms 0 KB -