Submission #816053

#TimeUsernameProblemLanguageResultExecution timeMemory
816053Jarif_RahmanMechanical Doll (IOI18_doll)C++17
16 / 100
76 ms11724 KiB
#include "doll.h" #include <bits/stdc++.h> #define pb push_back #define f first #define sc second using namespace std; typedef long long int ll; typedef string str; const int inf = 1e9; void create_circuit(int m, vector<int> A){ int n = A.size(); A.pb(inf); vector<vector<int>> pos(m); for(int i = 0; i < n; i++) pos[A[i]-1].pb(i); vector<int> C(m+1, 0), X, Y; C[0] = A[0]; int ls = 0; for(int i = 0; i < m; i++) if(!pos[i].empty()){ if(pos[i].size() == 1){ C[i+1] = A[pos[i][0]+1]; } else if(pos[i].size() == 2){ X.pb(A[pos[i][0]+1]), Y.pb(A[pos[i][1]+1]); C[i+1] = -int(X.size()); } else if(pos[i].size() == 4){ C[i+1] = -int(X.size()+1); X.pb(-int(X.size()+2)), Y.pb(-int(Y.size()+3)); X.pb(A[pos[i][0]+1]), X.pb(A[pos[i][1]+1]); Y.pb(A[pos[i][2]+1]), Y.pb(A[pos[i][3]+1]); } else{ C[i+1] = -int(X.size()+1); X.pb(-int(X.size()+2)), Y.pb(-int(Y.size()+3)); X.pb(A[pos[i][0]+1]), X.pb(A[pos[i][1]+1]); Y.pb(A[pos[i][2]+1]), Y.pb(ls); ls = -int(X.size())+2; } } for(int &x: C) if(x == inf) x = ls; for(int &x: X) if(x == inf) x = ls; for(int &x: Y) if(x == inf) x = ls; 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...