Submission #800409

#TimeUsernameProblemLanguageResultExecution timeMemory
800409Dan4Life정렬하기 (IOI15_sorting)C++17
20 / 100
2 ms448 KiB
#include <bits/stdc++.h> using namespace std; const int N = (int)2e5+10; int n, tot, a[N], t[N], x[N], y[N], p[N], vis[N]; bool chk(int m, int P[], int Q[]){ for(int i = 0; i < n; i++) a[i] = t[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; tot = 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; if(vis[p[j]]) break; P[tot]=j,Q[tot++]=p[j], j = p[j]; } } return tot<=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] = t[i] = A[i], x[i] = X[i], y[i] = Y[i]; int l = 0, r = m; while(l<r){ int mid = (l+r)/2; if(chk(mid,P,Q)) r=mid; else l=mid+1; } chk(l,P,Q); return l; }

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:22:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   22 | 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;
      |           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...