# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021743 | induwara16 | Arranging Shoes (IOI19_shoes) | C++17 | 1092 ms | 42676 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define itr(a) a.begin(), a.end()
typedef vector<int> vi;
typedef unordered_map<int, int> mii;
void move(mii &chain, mii &rev, int a, int b)
{
chain[rev[a]] = chain[a];
rev[chain[a]] = rev[a];
chain[a] = chain[b];
rev[chain[b]] = a;
chain[b] = a;
rev[a] = b;
}
int cost(mii chain, int a, int b, int c = 0)
{
if (a == b)
return c;
c++;
return cost(chain, chain[a], b, c);
}
# | 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... |