# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946495 | PagodePaiva | 자동 인형 (IOI18_doll) | C++17 | 50 ms | 13732 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) {
vector <int> v;
v.push_back(0);
for(auto x : A) v.push_back(x);
int m = M;
int n = v.size();
vector <int> c, x, y;
vector <int> g[m+1];
v.push_back(0);
for(int i = 0;i < (int) (v.size()) - 1;i++){
int val = v[i], nx = v[i+1];
g[val].push_back(nx);
}
int tp = -1;
for(int i = 0;i <= m;i++){
if(g[i].size() == 0) {
c.push_back(0);
continue;
}
if(g[i].size() == 1){
c.push_back(g[i][0]);
continue;
}
if(g[i].size() == 2){
c.push_back(tp);
x.push_back(g[i][0]);
y.push_back(g[i][1]);
tp--;
continue;
}
if(g[i].size() == 3){
c.push_back(tp);
tp--;
x.push_back(tp);
y.push_back(g[i][2]);
x.push_back(g[i][0]);
y.push_back(g[i][1]);
tp--;
continue;
}
if(g[i].size() == 4){
c.push_back(tp);
tp--;
x.push_back(tp);
y.push_back(tp-1);
x.push_back(g[i][0]);
y.push_back(g[i][1]);
tp--;
tp--;
x.push_back(g[i][2]);
y.push_back(g[i][3]);
}
}
// for(auto t : c){
// cout << t << ' ';
// }
answer(c, x, y);
return;
}
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... |