| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1018839 | 2024-07-10T10:07:10 Z | amirhoseinfar1385 | Sorting (IOI15_sorting) | C++17 | 0 ms | 0 KB |
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000000+10;
int all[maxn],n,q,fake[maxn],vis[maxn];
pair<int,int>alltagh[maxn];
vector<vector<int>> besaz(int ind){
vector<vector<int>>ret;
for(int i=0;i<n;i++){
fake[i]=all[i];
vis[i]=0;
}
for(int i=1;i<=ind;i++){
swap(fake[alltagh[i].first],fake[alltagh[i].second]);
}
for(int i=0;i<n;i++){
if(vis[i]==0){
ret.push_back({});
int now=i;
while(vis[now]==0){
// cout<<now<<" "<<fake[now]<<endl;
vis[now]=1;
ret.back().push_back(now);
now=fake[now];
}
}
}
return ret;
}
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++){
all[i]=S[i];
}
q=M;
for(int i=1;i<=q;i++){
alltagh[i]=make_pair(X[i-1],Y[i-1]);
}
vector<vector<int>>ger=besaz(q);
int now=0;
for(int i=0;i<(int)ger.size();i++){
int tof=gr[i][0];
for(int j=1;j<(int)ger[i].size();j++){
P[now]=ger[i][j];
Q[now]=tof;
now++;
}
}
return q;
}