| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 139373 | ly20 | 자동 인형 (IOI18_doll) | C++17 | 27 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 <bits/stdc++.h>
#include "doll.h"
using namespace std;
const int MAXN=212345;
#define debug(args...) fprintf(stderr,args)
int freq[MAXN];
void create_circuit(int m, vector<int> a) {
int n = a.size();
vector<int> c(m+1),x,y;
for(int i=0;i<m+1;i++)c[i]=0;
for(int i=0;i<n-1;i++)
{
if(freq[a[i]]>0)
{
x.push_back(c[a[n-1]]);
y.push_back(a[i+1]);
c[a[i]]=-x.size();
}
else c[a[i]]=a[i+1];
}
if(freq[a[n-1]]>0)
{
x.push_back(c[a[n-1]]);
y.push_back(0);
c[a[n-1]]=-x.size();
}
else c[a[n-1]]=0;
c[0]=a[0];
answer(c,x,y);
}
| # | 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... | ||||
