답안 #800482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800482 2023-08-01T15:21:23 Z Dan4Life 정렬하기 (IOI15_sorting) C++17
100 / 100
227 ms 23052 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] or i==a[i]) continue; int j = i;
        while(!vis[j]){
            if(!vis[a[j]]) v.push_back({j,a[j]}); 
            vis[j] = 1; j=a[j];
        }
    }
    if(v.size()>m) return 0;
    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] = p[v[i][0]], Q[i] = p[v[i][1]]; 
            swap(a[P[i]],a[Q[i]]), swap(p[a[P[i]]],p[a[Q[i]]]);
        }
    }
    return 1;
}

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] or i==a[i]) continue; int j = i;
      |         ^~
sorting.cpp:12:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   12 |         if(vis[i] or i==a[i]) continue; int j = i;
      |                                         ^~~
sorting.cpp:18:16: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     if(v.size()>m) return 0;
      |        ~~~~~~~~^~
sorting.cpp:22: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]
   22 |         if(i<v.size()){
      |            ~^~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:30:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   30 | 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;
      |           ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 560 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 580 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 184 ms 20440 KB Output is correct
16 Correct 179 ms 21036 KB Output is correct
17 Correct 202 ms 21904 KB Output is correct
18 Correct 75 ms 20700 KB Output is correct
19 Correct 151 ms 22004 KB Output is correct
20 Correct 154 ms 22628 KB Output is correct
21 Correct 145 ms 22476 KB Output is correct
22 Correct 159 ms 17276 KB Output is correct
23 Correct 215 ms 22648 KB Output is correct
24 Correct 202 ms 22352 KB Output is correct
25 Correct 219 ms 22160 KB Output is correct
26 Correct 156 ms 21192 KB Output is correct
27 Correct 134 ms 20652 KB Output is correct
28 Correct 197 ms 22308 KB Output is correct
29 Correct 208 ms 22012 KB Output is correct
30 Correct 104 ms 19940 KB Output is correct
31 Correct 227 ms 22580 KB Output is correct
32 Correct 170 ms 21928 KB Output is correct
33 Correct 213 ms 22392 KB Output is correct
34 Correct 201 ms 22256 KB Output is correct
35 Correct 151 ms 21536 KB Output is correct
36 Correct 48 ms 18920 KB Output is correct
37 Correct 214 ms 23052 KB Output is correct
38 Correct 200 ms 22112 KB Output is correct
39 Correct 211 ms 22208 KB Output is correct