Submission #793772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
793772	2023-07-26T06:35:31 Z	NothingXD	Mechanical Doll (IOI18_doll)	C++17	6 / 100	55 ms	15140 KB

doll

#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double ld;
typedef complex<ld> point;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 2e5 + 10;

int n, m, a[maxn], out[maxn], out1[maxn], out2[maxn], res;
vector<int> idx[maxn];

void solve(int v, vector<int> tmp){
	vector<int> l;
	vector<int> r;
	for (int i = 0; i < tmp.size(); i++){
		if (i&1) r.push_back(tmp[i]);
		else l.push_back(tmp[i]);
	}
	if (l.size() == 1){
		out1[v-1] = a[l[0]+1];
	}
	else{
		res++;
		out1[v-1] = -res;
		solve(res, l);
	}
	if (r.size() == 1){
		out2[v-1] = a[r[0]+1];
	}
	else{
		res++;
		out2[v-1] = -res;
		solve(res, r);
	}
}

void create_circuit(int M, vector<int> A) {
	n = A.size(); m = M;
	for (int i = 0; i < n; i++){
		a[i] = A[i];
		idx[a[i]].push_back(i);
	}
	a[n] = 0;
	out[0] = a[0];
	for (int i = 1; i <= m; i++){
		int tmp = idx[i].size();
		if (tmp == 3){
			//assert(a[idx[i][0]+1] == a[idx[i][1]+1] && a[idx[i][1]+1] == a[idx[i][2]+1]);
		}
		if (tmp == 0){
			out[i] = 0;
			continue;
		}
		while(tmp % 2 == 0) tmp /= 2;
		int sz = idx[i].size() / tmp;
		if (sz == 1){
			out[i] = a[idx[i][0]+1];
			continue;
		}
		res++;
		out[i] = -res;
		solve(res, idx[i]);
	}
	vector<int> C(m+1), X(res), Y(res);
	for (int i = 0; i <= m; i++){
		C[i] = out[i];
	}
	for (int i = 0; i < res; i++){
		X[i] = out1[i];
		Y[i] = out2[i];
	}
	answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void solve(int, std::vector<int>)':
doll.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 0; i < tmp.size(); i++){
      |                  ~~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	19 ms	9372 KB	Output is correct
3	Correct	15 ms	8800 KB	Output is correct
4	Correct	2 ms	4948 KB	Output is correct
5	Correct	9 ms	6484 KB	Output is correct
6	Correct	23 ms	10860 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	19 ms	9372 KB	Output is correct
3	Correct	15 ms	8800 KB	Output is correct
4	Correct	2 ms	4948 KB	Output is correct
5	Correct	9 ms	6484 KB	Output is correct
6	Correct	23 ms	10860 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	41 ms	11676 KB	Output is correct
9	Correct	41 ms	12184 KB	Output is correct
10	Correct	55 ms	15140 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4948 KB	Output is correct
2	Correct	19 ms	9372 KB	Output is correct
3	Correct	15 ms	8800 KB	Output is correct
4	Correct	2 ms	4948 KB	Output is correct
5	Correct	9 ms	6484 KB	Output is correct
6	Correct	23 ms	10860 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	41 ms	11676 KB	Output is correct
9	Correct	41 ms	12184 KB	Output is correct
10	Correct	55 ms	15140 KB	Output is correct
11	Correct	3 ms	4948 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Incorrect	31 ms	10372 KB	wrong motion
15	Halted	0 ms	0 KB	-