#include <bits/stdc++.h> #include "doll.h" using namespace std; const int N = 2e5 + 10; int n , m; vector <int> C , X , Y , adj[N]; int Solve(vector <int> vec , bool flg = true) { if(vec.size() == 1) return vec[0]; X.push_back(0); Y.push_back(0); int now = X.size(); if(flg) { int tmp = 1; while(tmp < vec.size()) tmp *= 2; vector <int> fake; while(vec.size() + fake.size() < tmp) fake.push_back(-now); for(auto u : vec) fake.push_back(u); vec = fake; } if(vec[0] < 0 && vec.back() < 0) { X[now - 1] = vec[0]; Y[now - 1] = vec[0]; return -now; } vector <int> v[2]; if(vec.size() % 2 == 1) { vec.push_back(-now); swap(vec[vec.size() - 1] , vec[vec.size() - 2]); } for(int i = 0 ; i < vec.size() ; i++) v[i % 2].push_back(vec[i]); int tmp = Solve(v[0] , 0); X[now - 1] = tmp; tmp = Solve(v[1] , 0); Y[now - 1] = tmp; return -1 * now; } void Build(int v) { if(adj[v].empty()) { C[v] = 0; return; } int tmp = Solve(adj[v]); C[v] = tmp; } void create_circuit(int mm , vector <int> A) { n = A.size(); m = mm; C.resize(m + 1); adj[0].push_back(A[0]); for(int i = 0 ; i + 1 < n ; i++) adj[A[i]].push_back(A[i + 1]); adj[A.back()].push_back(0); for(int i = 0 ; i <= m ; i++) { Build(i); } answer(C , X , Y); }

doll.cpp: In function 'int Solve(std::vector<int>, bool)':
doll.cpp:20:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   while(tmp < vec.size())
      |         ~~~~^~~~~~~~~~~~
doll.cpp:23:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |   while(vec.size() + fake.size() < tmp)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
doll.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i = 0 ; i < vec.size() ; i++)
      |                  ~~^~~~~~~~~~~~