# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483582 | ponytail | Mechanical Doll (IOI18_doll) | C++17 | 63 ms | 12440 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 <vector>
#include <cstdio>
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
void create_circuit(int M, std::vector<int> A) {
vector<int> C(M+1);
vector<int> X, Y;
int N = A.size();
C[0] = A[0];
vector<int> all[M+1];
for(int i=0; i<N; i++) all[A[i]].push_back(i);
for(int i=1; i<=M; i++) {
if(all[i].size() == 1) {
C[i] = (all[i][0] == N-1 ? 0 : A[all[i][0] + 1]);
}
else if(all[i].size() == 2) {
C[i] = -X.size() - 1;
X.push_back((all[i][0] == N-1 ? 0 : A[all[i][0] + 1]));
Y.push_back((all[i][1] == N-1 ? 0 : A[all[i][1] + 1]));
}
}
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... |