# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82013 | gusagalover | 자동 인형 (IOI18_doll) | C++17 | 77 ms | 6964 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>
using namespace std;
typedef pair<int,int> pii;
void create_circuit(int M, std::vector<int> A)
{
int N=A.size();
vector<int> cnt(M+1),visit(M+1);
for(int i=0;i<N;i++)
cnt[A[i]]++;
vector<int> C(M+1);
vector<int> X,Y,SN(M+1);
int bf=0,sc=0;
C[0]=A[0];
A.push_back(0);
for(int i=0;i<N;i++)
{
int here=A[i];
//int there=A[i+1];
if(cnt[here]==2)
{
if(!visit[here])
{
SN[here]=++sc;
X.push_back(0); Y.push_back(0);
C[here]=-SN[here];
X[SN[here]-1]=A[i+1];
visit[here]=1;
}
else
{
Y[SN[here]-1]=A[i+1];
}
}
else
C[here]=A[i+1];
}
A.pop_back();
//for(int i=0;i<C.size();i++)
// printf("%d ",C[i]);
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... |