# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105053 | Alexa2001 | Sorting (IOI15_sorting) | C++17 | 722 ms | 29380 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;
const int Nmax = 2e5 + 5;
bool used[Nmax];
int p[Nmax], P[Nmax], A[Nmax], wA[Nmax], B[Nmax], wB[Nmax], wp[Nmax];
vector< pair<int,int> > get_moves(int n, int p[])
{
int i;
for(i=0; i<n; ++i) used[i] = 0;
vector< pair<int,int> > mv;
for(i=0; i<n; ++i)
if(!used[i])
{
int x = i;
vector<int> cycle;
do
{
used[x] = 1;
cycle.push_back(x);
x = p[x];
}
while(!used[x]);
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... |