| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 879597 | andrei_boaca | Mechanical Doll (IOI18_doll) | C++17 | 49 ms | 12576 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 "doll.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
int n;
vector<int> vecini[100005];
vector<int> C,X,Y;
vector<int> v;
int s;
int build(int st,int dr)
{
if(st==dr)
return v[st];
int mij=(st+dr)/2;
int a=build(st,mij);
int b=build(mij+1,dr);
s++;
X.push_back(a);
Y.push_back(b);
return -s;
}
void create_circuit(int M, std::vector<int> A)
{
n=A.size();
for(int i=0;i<A.size();i++)
{
int x=A[i];
int nxt=0;
if(i+1<A.size())
nxt=A[i+1];
vecini[x].push_back(nxt);
}
C.resize(M+1);
C[0]=A[0];
for(int i=1;i<=M;i++)
{
if(vecini[i].empty())
{
C[i]=0;
continue;
}
else
{
v=vecini[i];
C[i]=build(0,v.size()-1);
}
}
answer(C,X,Y);
}
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... | ||||
