# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986371 | Pyqe | Sorting (IOI15_sorting) | C++17 | 140 ms | 25392 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;
long long a[200069],dsu[200069],pst[200069],pr[200069];
long long fd(long long x)
{
if(dsu[x]!=x)
{
dsu[x]=fd(dsu[x]);
}
return dsu[x];
}
int findSwapPairs(int n,int aa[],int m,int ka[],int la[],int sq[],int sq2[])
{
long long i,j,lh,rh,md,zz,c;
for(lh=0,rh=m;lh<=rh;)
{
md=(lh+rh)/2;
for(i=0;i<n;i++)
{
a[i]=aa[i];
dsu[i]=i;
}
for(i=0;i<md;i++)
{
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... |