oj.uz

Submission #255293

# Submission time Handle Problem Language Result Execution time Memory
255293 2020-07-31T17:09:09 Z arayi Mechanical Doll (IOI18_doll) C++17
84 / 100
 153 ms 33864 KB 
#include "doll.h"
//Arayi
//#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int> 
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;


const int N = 1e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 238;
const ld e = 1e-13;

int n, m, i1 = 1;
vii fp[N];
vii c, x, y;
bool col[N];
void rec(int ii, int v)
{
	if (!col[v])
	{
		col[v] = true;
		if (x[v] == mod)
		{
			x[v] = fp[ii].back();
			fp[ii].pop_back();
			rec(ii, -c[ii] - 1);
		}
		else if (x[v] < 0) rec(ii, -x[v] - 1);
	}
	else
	{
		col[v] = false;
		if (y[v] == mod)
		{
			y[v] = fp[ii].back();
			fp[ii].pop_back();
			rec(ii, -c[ii] - 1);
		}
		else if (y[v] < 0) rec(ii, -y[v] - 1);
	}
}
void mk(int ii)
{
	vii sm = fp[ii];
	int n = sm.size();
	int er = 0;
	while ((1 << er) < n) er++;
	int ss = (1 << er) - n;
	c[ii] = -i1;
	vii nax, nw;
	nax.ad(i1);
	i1++;
	x.ad(mod), y.ad(mod);
	for (int i = 1; i < er; i++)
	{
		for (int j = nax.size() - 1; j >= 0; j--)
		{
			nw.ad(i1);
			y[nax[j] - 1] = -i1, i1++;
			nw.ad(i1);
			x[nax[j] - 1] = -i1, i1++;
			x.ad(mod), x.ad(mod), y.ad(mod), y.ad(mod);
		}
		if (ss & (1 << (er - i)))
		{
			x[nax[0] - 1] = c[ii];
			i1--;
			x.pop_back();
			y.pop_back();
			nw.pop_back();
		}
		reverse(all(nw));
		swap(nax, nw);
		nw.clear();
	}
	if (ss & 1)
	{
		x[nax[0] - 1] = c[ii];
	}
	reverse(all(fp[ii]));
	rec(ii, -c[ii] - 1);
}
void create_circuit(int M, vector<int> A) {
	n = A.size();
	m = M;
	c.resize(m + 1);
	c[0] = A[0];
	for (int i = 1; i <= m; i++)
	{
		c[i] = -1;
	}
	fp[1] = A;
	fp[1].ad(0);
	reverse(all(fp[1]));
	fp[1].pop_back();
	reverse(all(fp[1]));
	mk(1);
	answer(c, x, y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 58 ms 28000 KB Output is correct
3 Correct 60 ms 27624 KB Output is correct
4 Correct 19 ms 23788 KB Output is correct
5 Correct 30 ms 24908 KB Output is correct
6 Correct 82 ms 29772 KB Output is correct
7 Incorrect 21 ms 23756 KB state 'Y'

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 58 ms 28000 KB Output is correct
3 Correct 60 ms 27624 KB Output is correct
4 Correct 19 ms 23788 KB Output is correct
5 Correct 30 ms 24908 KB Output is correct
6 Correct 82 ms 29772 KB Output is correct
7 Incorrect 21 ms 23756 KB state 'Y'

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 58 ms 28000 KB Output is correct
3 Correct 60 ms 27624 KB Output is correct
4 Correct 19 ms 23788 KB Output is correct
5 Correct 30 ms 24908 KB Output is correct
6 Correct 82 ms 29772 KB Output is correct
7 Incorrect 21 ms 23756 KB state 'Y'

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23744 KB Output is correct
2 Correct 14 ms 23780 KB Output is correct
3 Correct 15 ms 23668 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 19 ms 23752 KB Output is correct
7 Correct 20 ms 23760 KB Output is correct
8 Correct 15 ms 23776 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23756 KB Output is correct
2 Correct 81 ms 29676 KB Output is correct
3 Correct 88 ms 29692 KB Output is correct
4 Correct 124 ms 32924 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23756 KB Output is correct
2 Correct 81 ms 29676 KB Output is correct
3 Correct 88 ms 29692 KB Output is correct
4 Correct 124 ms 32924 KB Output is correct
5 Correct 127 ms 33864 KB Output is correct
6 Correct 130 ms 33748 KB Output is correct
7 Correct 153 ms 33776 KB Output is correct
8 Correct 128 ms 33576 KB Output is correct
9 Correct 98 ms 29656 KB Output is correct
10 Correct 134 ms 33568 KB Output is correct
11 Correct 139 ms 33216 KB Output is correct
12 Correct 102 ms 29952 KB Output is correct
13 Correct 99 ms 30128 KB Output is correct
14 Correct 91 ms 30332 KB Output is correct
15 Correct 89 ms 30308 KB Output is correct
16 Correct 19 ms 23980 KB Output is correct
17 Correct 94 ms 29952 KB Output is correct
18 Correct 96 ms 29936 KB Output is correct
19 Correct 93 ms 29880 KB Output is correct
20 Correct 133 ms 33428 KB Output is correct
21 Correct 130 ms 33208 KB Output is correct
22 Correct 125 ms 33304 KB Output is correct