| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 143103 | cfalas | 자동 인형 (IOI18_doll) | C++14 | 26 ms | 4536 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;
void create_circuit(int M, std::vector<int> A) {
int N = A.size();
std::vector<int> C(M + 1);
C[0] = A[0];
int cnt[M+1] = {};
for(int i=0;i<A.size();i++){
cnt[A[i]]++;
}
C[0] = A[0];
int s=0;
int used[M+1] = {};
vector<int> X, Y;
for(int i=0;i<A.size()-1;i++){
//cout<<i<<" "<<A[i]<<" "<<cnt[A[i]]<<" "<<used[A[i]]<<endl;
if(cnt[A[i]]==1) C[A[i]] = A[i+1];
else{
used[A[i]]++;
if(used[A[i]]==1){
s++;
C[A[i]] = -s;
X.push_back(A[i+1]);
X[s] = A[i+1];
}
else{
Y.push_back(A[i+1]);
Y[s] = A[i+1];
}
}
//cout<<"--\n";
}
//cout<<A.size()-1<<" "<<A[A.size()-1]<<" "<<cnt[A[A.size()-1]]<<"\n";
if(cnt[A[A.size()-1]]==1) C[A[A.size()-1]] = 0;
else{
Y.push_back(0);
C[A[A.size()-1]] = -s, Y[s] = 0;
}
/*for(int i=0;i<=M;i++) cout<<C[i]<<" ";
cout<<endl;
for(int i=0;i<X.size();i++) cout<<X[i]<<" "<<Y[i]<<endl;*/
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... | ||||
