| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 206035 | Segtree | Sorting (IOI15_sorting) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x,begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
int ss[2010];
rep(i,N)ss[i]=S[i];
int R=0;
for(;;R++){
swap(S[X[R]],S[Y[R]]);
ll cnt=0,s[2010];
rep(i,N)s[i]=S[i];
//cout<<R<<"-";rep(i,N)cout<<"S:"<<s[i]<<endl;
rep(i,N){
ll p;
rep(j,N)if(i==s[j])p=j;
if(i!=p){
cnt++;
swap(s[i],s[p]);
}
}
if(cnt<=R+1){
int R=0;
for(int i=0;i<N;i++){
ll p;
for(int j=0;j<N;j++)if(S[j]==i)p=j;
if(i!=p){
P[R]=i,Q[R]=p,R++;
swap(S[i],S[p]);
}
}
return R;
}
}
return -1;
}
int main(){
int n,s[100],m,x[1000],y[1000],p[1000],q[1000];
cin>>n;
rep(i,n)cin>>s[i];
cin>>m;
rep(i,m){
cin>>x[i]>>y[i];
}
ll R=findSwapPairs(n,s,m,x,y,p,q);
cout<<"R="<<R<<endl;
rep(i,R)cout<<"PQ:"<<p[i]<<" "<<q[i]<<endl;
}