이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "doll.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MAX_M = 1e5 + 5;
vi graph[MAX_M];
void create_circuit(int m, std::vector<int> a) {
int n = a.size();
a.push_back(0);
graph[0].push_back(a[0]);
for (int i = 0; i < n; i++) {
graph[a[i]].push_back(a[i + 1]);
}
vi c(m + 1), x, y;
for (int i = 0; i <= m; i++) {
if (graph[i].size() == 1) {
c[i] = graph[i][0];
} else if (!graph[i].empty()) {
x.push_back(graph[i][0]), y.push_back(graph[i][1]);
c[i] = -int(x.size());
}
}
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... |