oj.uz

답안 #800468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800468 2023-08-01T15:13:52 Z Dan4Life 정렬하기 (IOI15_sorting) C++17
0 / 100
 2 ms 468 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];
    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, vis[i]=0;
    vector<array<int,2>> v; v.clear();
    for(int i = 0; i < n; i++){
        if(vis[i]) continue; int j = i;
        while(!vis[j]){
            if(!vis[p[j]]) v.push_back({j,p[j]}); 
            vis[j] = 1; j=p[j];
        }
    }
    for(int i = 0; i < n; i++) a[i]=A[i], p[a[i]]=i;
    for(int i = 0; i < m; i++){
        swap(a[X[i]],a[Y[i]]), swap(p[a[X[i]]],p[a[Y[i]]]);
        if(i<v.size()){
            P[i] = v[i][0], Q[i] = v[i][1]; 
            swap(a[P[i]],a[Q[i]]), swap(p[a[P[i]]],p[a[Q[i]]]);
        }
    }
    return v.size()<=m;
}
 
int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
    n = N; 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:12:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   12 |         if(vis[i]) continue; int j = i;
      |         ^~
sorting.cpp:12:30: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   12 |         if(vis[i]) continue; int j = i;
      |                              ^~~
sorting.cpp:21:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |         if(i<v.size()){
      |            ~^~~~~~~~~
sorting.cpp:26:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |     return v.size()<=m;
      |            ~~~~~~~~^~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:29:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   29 | 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 1 ms 312 KB Output is correct
3 Correct 2 ms 312 KB Output is correct
4 Incorrect 1 ms 304 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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