# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
958762 | djs100201 | Mechanical Doll (IOI18_doll) | C++17 | 0 ms | 0 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<bits/stdc++.h>
#include "doll.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ =2e5+100, inf = (ll)2e9 * (ll)1e9 + 7, mod = 1e9+7;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll gcd(ll x,ll y){
if(!y)return x;
return gcd(y,x%y);
}
vector<int>v[n_];
void create_circuit(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1),deg(M+1);
for(auto nxt:A)deg[nxt]++;
C[0]=A[0];
std::vector<int> X,Y;
ll base;
for(int i=0;i+1<N;i++)v[A[i]].push_back(A[i+1]);
for(int i=1;i<=M;i++){
if(deg[i]==0)C[i]=0;
else if(deg[i]==1)C[i]=v[i][0];
else {
C[i]=X.size();
X.push_back(v[i][0]);
Y.push_back(v[i][1]);
}
}
answer(C, X, Y);
}c--)solve();
}