# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314813 | 2020-10-21T11:03:32 Z | amunduzbaev | Sorting (IOI15_sorting) | C++14 | 2 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=2*1e5+5; int n,s[N], x[N], y[N] ,pos[N], used[N]; vector<pair<int,int>> ans; bool check(int m){ vector<int> tmp(n); for(int i=0;i<n;i++) tmp[i]=s[i]; for(int i=0;i<n;i++) swap(tmp[x[i]],tmp[y[i]]); for(int i=0;i<n;i++) pos[tmp[i]]=i; vector<pair<int,int>>swaps; for(int i=0;i<n;i++){ if(tmp[i]==i) continue; swaps.push_back({tmp[i],i}); swap(tmp[i],tmp[pos[i]]); swap(pos[tmp[i]], pos[tmp[pos[i]]]); } if(swaps.size() > m) return 0; ans.clear(); for(int i=0;i<n;i++) tmp[i] = s[i] ,pos[tmp[i]] = i; int i; for(i=0;i<swaps.size();i++){ int a=pos[swaps[i].first], b=pos[swaps[i].second]; ans.push_back({a,b}); swap(tmp[x[i]],tmp[y[i]]); swap(pos[tmp[x[i]]], pos[tmp[y[i]]]); 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; } for(int i=0;i<ans.size();i++){ p[i]=ans[i].first, q[i]=ans[i].second; } return ans.size(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Incorrect | 0 ms | 384 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Incorrect | 0 ms | 384 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Incorrect | 0 ms | 384 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |