이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
void answer(vector<int> C, vector<int> X, vector<int> Y);
int n, m;
vector<int> a;
vector<vector<int>> adj;
int p = 0;
vector<int> c, x, y;
int new_switch(int g, int d) {
p++;
x.push_back(g);
y.push_back(d);
return -p;
}
int new_switch(int g) {
p++;
x.push_back(-p);
y.push_back(g);
return -p;
}
int create(int t, int i, int j) {
if(i > j) return 0;
if(i == j) return adj[t][i];
if(i + 2 == j)
return new_switch(new_switch(adj[t][i], adj[t][i + 2]), adj[t][i + 1]);
if(i + 3 == j)
return new_switch(new_switch(adj[t][i], adj[t][i + 2]), new_switch(adj[t][i + 1], adj[t][i + 3]));
return new_switch(create(t, i, (i + j) / 2), create(t, (i + j) / 2 + 1, j));
}
void create_circuit(int M, vector<int> A) {
n = (int)A.size();
m = M;
a = A;
c.assign(m + 1, 0);
adj.assign(m + 1, vector<int>());
for(int i = 0; i < n - 1; ++i)
adj[a[i]].push_back(a[i + 1]);
adj[0].push_back(a[0]);
adj[a.back()].push_back(0);
/*
for(int i = 0; i <= m; ++i) {
cout << i << ": ";
for(int j : adj[i])cout<<j<<" ";
cout<<endl;
}
*/
for(int i = 0; i <= m; ++i)
c[i] = create(i, 0, (int)adj[i].size() - 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... |