Submission #415449

#	Time	Username	Problem	Language	Result	Execution time	Memory
415449		Kevin_Zhang_TW	자동 인형 (IOI18_doll)	C++17	28 / 100	168 ms	20772 KiB

doll

#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, inf = 1e9;
#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); };

	DE(n, M);
	int P = inf;

	function<vector<int>(vector<int>)> solve = [&](vector<int> target) {
		int osz = target.size(), sz = osz;
		while (osz != (osz&-osz)) 
			osz += osz&-osz;
		int more = osz - sz;

		vector<int> allid(osz); iota(AI(allid), 0);

		vector<int> val(osz);
		vector<int> ban(osz);

		function<void(int,vector<int>)> gen = [&](int more, vector<int> allid) {
			if (more == 0) return ;
			
			if (more == allid.size()) {
				for (int u : allid) ban[u] = true, val[u] = P;
				return;
			}

			vector<int> L, R;
			for (int i = 0;i < allid.size();++i) {
				(i&1?R:L).pb(allid[i]);
			}

			int sz = L.size(), lm = min(more, sz), rm = more - lm;

			assert(L.size() == R.size());

			if (count(AI(L), osz-1)) swap(lm, rm);

			gen(lm, L), gen(rm, R);
		};

		gen(more, allid);

		for (int i = 0, j = 0;i < sz;++i) {
			while (ban[j]) ++j;
			val[j++] = target[i];
			if (i == sz-1) assert(j == osz);
		}

		return val;
	};

	function<int(vector<int>)> create = [&](vector<int> target) {
		if (target.size() == 1) {
			return target[0];
		}
		assert(target.size() % 2 == 0);
		int cur = new_s();
		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);
	};


	C[0] = A[0];

	A.pb(0);

	vector<int> tar = solve(vector<int>(begin(A)+1, end(A)));

	assert(tar.back() == 0);

	debug(AI(tar));

	int g = create(tar);

	for (int i = 1;i <= M;++i)
		C[i] = g;

	for (int i = 0;i < X.size();++i) {
		if (X[i] == P) X[i] = g;
		if (Y[i] == P) Y[i] = g;
	}

	debug(AI(C));

	DE(n, X.size(), Y.size());

	assert(X.size() <= n + __lg(n) + 1);

	answer(C, X, Y);

}

Compilation message (stderr)

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
doll.cpp:40:2: note: in expansion of macro 'DE'
   40 |  DE(n, M);
      |  ^~
doll.cpp: In lambda function:
doll.cpp:57:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    if (more == allid.size()) {
      |        ~~~~~^~~~~~~~~~~~~~~
doll.cpp:63:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |    for (int i = 0;i < allid.size();++i) {
      |                   ~~^~~~~~~~~~~~~~
doll.cpp: In lambda function:
doll.cpp:93: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]
   93 |   if (count(AI(target), target[0]) == target.size()) {
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
doll.cpp:98:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   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:115:2: note: in expansion of macro 'debug'
  115 |  debug(AI(tar));
      |  ^~~~~
doll.cpp:122:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |  for (int i = 0;i < X.size();++i) {
      |                 ~~^~~~~~~~~~
doll.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
doll.cpp:127:2: note: in expansion of macro 'debug'
  127 |  debug(AI(C));
      |  ^~~~~
doll.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
doll.cpp:129:2: note: in expansion of macro 'DE'
  129 |  DE(n, X.size(), Y.size());
      |  ^~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from doll.cpp:1:
doll.cpp:131:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  131 |  assert(X.size() <= n + __lg(n) + 1);
      |         ~~~~~~~~~^~~~~~~~~~~~~~~~~~
doll.cpp:33:7: warning: variable 'addf' set but not used [-Wunused-but-set-variable]
   33 |  auto addf = [&](vector<int> a, int f) {
      |       ^~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 18 / 18
• Subtask 6: 0 / 56