# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
314819 | 2020-10-21T11:18:14 Z | amunduzbaev | 정렬하기 (IOI15_sorting) | C++14 | 1 ms | 512 KB |
//#include "grader.cpp" #include "sorting.h" #include <bits/stdc++.h> using namespace std; #define pb(a) push_back(a) const int N=800005; int n,s[N],x[N],y[N],tmp[N],pos[N]; vector<pair<int,int>> ans; bool check(int m){ int i; for(i=0;i<n;i++)tmp[i]=s[i]; for(i=0;i<m;i++)swap(tmp[x[i]],tmp[y[i]]); for(i=0;i<n;i++)pos[tmp[i]]=i; vector<pair<int,int>>swaps; ans.clear(); for(i=0;i<n;i++){ if(pos[i]==i)continue; swaps.push_back({tmp[i],tmp[pos[i]]}); swap(tmp[pos[i]],tmp[i]); swap(pos[tmp[pos[i]]],pos[tmp[i]]); } if(swaps.size()>m)return 0; for(i=0;i<n;i++)tmp[i]=s[i],pos[tmp[i]]=i; for(i=0;i<swaps.size();i++){ int a=pos[swaps[i].first],b=pos[swaps[i].second]; swap(tmp[x[i]],tmp[y[i]]); swap(pos[tmp[x[i]]],pos[tmp[y[i]]]); ans.push_back({a,b}); swap(tmp[a],tmp[b]); swap(pos[tmp[a]],pos[tmp[b]]); } for(;i<m;i++)ans.push_back({0,0}); return 1; } int findSwapPairs(int N, int S[], int M, int X[], int Y[], int p[], int q[]) { n=N; for(int i=0;i<n;i++) s[i]=S[i]; for(int i=0;i<M;i++) x[i]=X[i], y[i]= Y[i]; int l=0,r=M; while(l<r) { int mid=(l+r)/2; if(check(mid) <= M) r=mid; else l=mid+1; } check(l); for(int i=0;i<l;i++){ p[i]=ans[i].first, q[i]=ans[i].second; } return l; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |