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 <bits/stdc++.h>
#include "doll.h"
using namespace std;
const int MAX_M = 1e5 + 5;
int N, M, S;
vector <int> nxt[MAX_M];
vector<int> C, X, Y;
void create_circuit(int m, vector <int> A) {
N = A.size(), M = m;
C.resize(M + 1);
A.push_back(0);
for(int i = 0; i < N; i++) {
nxt[A[i]].push_back(A[i + 1]);
}
C[0] = A[0];
for(int a = 1; a <= M; a++) {
if(nxt[a].empty()) {
continue;
}
else if(nxt[a].size() == 1) {
C[a] = nxt[a][0];
}
else {
S++;
C[a] = -S;
if(nxt[a].size() == 2) {
X.push_back(nxt[a][0]);
Y.push_back(nxt[a][1]);
}
else if(nxt[a].size() == 3) {
X.push_back(-(++S));
Y.push_back(-(++S));
X.push_back(nxt[a][0]);
Y.push_back(-(S - 2));
X.push_back(nxt[a][1]);
Y.push_back(nxt[a][2]);
}
else if(nxt[a].size() == 4) {
X.push_back(-(++S));
Y.push_back(-(++S));
X.push_back(nxt[a][0]);
Y.push_back(nxt[a][2]);
X.push_back(nxt[a][1]);
Y.push_back(nxt[a][3]);
}
}
}
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... |