# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080001 | Trumling | Sorting (IOI15_sorting) | C++14 | 1 ms | 348 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 "sorting.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999999
typedef long long ll;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
ll pos[N];
for(int i=0;i<N;i++)
{
pos[S[i]]=i;
}
// for(int i=0;i<N;i++)
// cout<<pos[i]<<' ';
// cout<<'\n';
for(int i=0;i<N;i++)
{
P[i]=pos[i];
Q[i]=i;
if(pos[i]>i)
swap(P[i],Q[i]);
pos[S[i]]=pos[i];
S[pos[i]]=S[i];
S[i]=i;
pos[i]=i;
}
for(int i=0;i<N;i++)
cout<<S[i]<<' ';
return N;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |