Submission #800802

#TimeUsernameProblemLanguageResultExecution timeMemory
800802biankMechanical Doll (IOI18_doll)C++14
16 / 100
111 ms15064 KiB
#include "doll.h" #include <bits/stdc++.h> using namespace std; #define SIZE(x) (int)x.size() void create_circuit(int M, vector<int> A) { int N = SIZE(A); vector <int> C(M+1); vector <int> X, Y; if (M == 1) { X.resize(N-1); Y.resize(N-1); C[0] = 1; if (N == 1) { C[1] = 0; answer(C,X,Y); return; } if (N == 2) { C[1] = -1; X[0] = 1; Y[0] = 0; answer(C,X,Y); return; } C[1] = -1; X[0] = 1; Y[0] = -2; for (int i=1; i<N-2; i++) { X[i] = -i; Y[i] = -i-2; //cerr << X[i] << ' ' << Y[i] << endl; } X[N-2] = -N+2; Y[N-2] = 0; } else { A.push_back(0); map <int, vector <int>> next; for (int i=0; i<N; i++) { next[A[i]].push_back(A[i+1]); //Scerr << A[i] << ' ' << A[i+1] << endl; } C[0] = A[0]; int j = 0; for (auto &x:next) { int a = x.first; vector <int> n = x.second; int S = SIZE(n); if (S == 1) { C[a] = n[0]; continue; } if (S == 2) { C[a] = --j; X.push_back(n[0]); Y.push_back(n[1]); continue; } if (S == 4) { C[a] = --j; X.push_back(--j); Y.push_back(--j); X.push_back(n[0]); Y.push_back(n[2]); X.push_back(n[1]); Y.push_back(n[3]); continue; } if (S == 3) { C[a] = --j; X.push_back(--j); Y.push_back(--j); X.push_back(n[0]); Y.push_back(n[1]); X.push_back(j+2); Y.push_back(n[2]); } } } /*for (int i=0; i<=M; i++) { cerr << C[i] << " "; } cerr << endl;*/ answer(C, X, Y); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...