# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
311504 | amunduzbaev | Mechanical Doll (IOI18_doll) | C++14 | 11 ms | 2252 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 "grader.cpp"
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
//const int N=1e5+5;
//int used[N];
void create_circuit(int m, vector<int> a) {
int n = a.size();
vector<int> way(m+1);
way[0]=a[0];
for(int i=0;i<m;i++){
way[a[i]]=a[i+1];
}
//for(int i=0;i<=m;i++)
// cout<<i<<" "<<way[i]<<"\n";
vector<int> x,y;
//for (int i = 0; i < n; ++i) {
//x[i] = y[i] = a[i];
//}
answer(way,x,y);
}
/*
9 9
2 9 8 1 3 7 6 4 5
*/
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... |