이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e3+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 2e5+5;
#include "doll.h"
vi adj[nax];
void create_circuit(int m, vi a) {
int n = a.size();
vi c(m + 1,0);
vi x, y;
int par = 0;
for (int i = 0; i < n; ++i) {
adj[par].pb(a[i]);
par = a[i];
}
adj[par].pb(0);
int swtch= 0;
for (int i = 0; i <= m; ++i)
{
if(adj[i].size() == 0){
c[i] = 0;
} else if(adj[i].size() == 1){
c[i] = adj[i][0];
} else if(adj[i].size() == 2){
c[i] = -swtch-1;
x[swtch] = adj[i][0];
y[swtch] = adj[i][1];
swtch++;
}
}
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... |