Submission #415417

#TimeUsernameProblemLanguageResultExecution timeMemory
415417Kevin_Zhang_TWMechanical Doll (IOI18_doll)C++17
47 / 100
268 ms15764 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb emplace_back #define AI(i) begin(i), end(i) template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); } template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); } #ifdef KEV #define DE(args...) kout("[ " + string(#args) + " ] = ", args) void kout() { cerr << endl; } template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); } template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; } #else #define DE(...) 0 #define debug(...) 0 #endif const int MAX_N = 300010; #include "doll.h" void create_circuit(int M, std::vector<int> A) { int n = A.size(); // C is the place where the ith trigger connect to vector<int> C(M + 1), X, Y; auto new_s = [&]() { int ret = X.size(); X.pb(-1), Y.pb(-1); return ret; }; auto addf = [&](vector<int> a, int f) { a.insert(begin(a), f); return a; }; auto sid = [&](int id) { return - (id+1); }; function<int(vector<int>)> create = [&](vector<int> target) { if (target.size() == 1) { return target[0]; } int cur = new_s(); { int osz = target.size(); while (osz != (osz&-osz)) osz += osz&-osz; vector<int> nt; for (int i = target.size();i < osz;++i) nt.pb( - (cur+1) ); for (int u : target) nt.pb(u); target = nt; //target.insert(begin(target), - (cur+1) ); } if (count(AI(target), target[0]) == target.size()) { X[cur] = target[0], Y[cur] = target[0]; return sid(cur); } vector<int> L, R; for (int i = 0;i < target.size();++i) { (i&1?R:L).pb(target[i]); } int a = create(L), b = create(R); X[cur] = a, Y[cur] = b; return sid(cur); }; A.pb(0); vector<vector<int>> pos(M + 1); for (int i = 0;i < n;++i) pos[ A[i] ].pb(i); C[0] = A[0]; int g = create(vector<int>(begin(A)+1, end(A))); for (int i = 1;i <= M;++i) C[i] = g; // for (int i = 1;i <= M;++i) if (pos[i].size()) { // vector<int> nxt; // for (int j : pos[i]) nxt.pb( A[j+1] ); // C[i] = create(nxt); // } debug(AI(C)); DE(n, X.size(), Y.size()); //assert(X.size() <= n + __lg(n) + 10); answer(C, X, Y); }

Compilation message (stderr)

doll.cpp: In lambda function:
doll.cpp:56:36: warning: comparison of integer expressions of different signedness: 'std::__iterator_traits<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, void>::difference_type' {aka 'long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   if (count(AI(target), target[0]) == target.size()) {
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
doll.cpp:61:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for (int i = 0;i < target.size();++i) {
      |                  ~~^~~~~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
doll.cpp:88:2: note: in expansion of macro 'debug'
   88 |  debug(AI(C));
      |  ^~~~~
doll.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
doll.cpp:90:2: note: in expansion of macro 'DE'
   90 |  DE(n, X.size(), Y.size());
      |  ^~
doll.cpp:33:7: warning: variable 'addf' set but not used [-Wunused-but-set-variable]
   33 |  auto addf = [&](vector<int> a, int f) {
      |       ^~~~
#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...