# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862701 | IBory | Mechanical Doll (IOI18_doll) | C++17 | 21 ms | 8268 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;
const int MAX = 100007;
vector<int> occur[MAX];
int cn[MAX];
void create_circuit(int M, vector<int> A) {
int N = A.size();
for (int i = 0; i < N; ++i) occur[A[i]].push_back(i);
A.push_back(0);
occur[0].push_back(0);
vector<int> C, X, Y;
C.resize(M + 1);
int pv = 0, sn = 0;
for (int i = 0; i < A.size(); ++i) {
if (occur[pv].size() == 1) C[pv] = A[i];
else {
if (C[pv] < 0) continue;
C[pv] = --sn;
X.push_back(A[occur[pv][cn[pv]++] + 1]);
Y.push_back(A[occur[pv][cn[pv]++] + 1]);
}
pv = A[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... |