oj.uz

답안 #213015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213015 2020-03-24T18:41:58 Z mode149256 자동 인형 (IOI18_doll) C++14
65.6728 / 100
 156 ms 14324 KB 
/*input

*/
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

vi C;
vi X, Y;
int S = 0;

vii iseina;
int N;
int truksta;
int n;
int pradSw;
int maxLvl;
vpi place;

int nxtS() {
	X.push_back(0);
	Y.push_back(0);
	S++;
	// printf("s = %d, grazinu = %d\n", S, -S);
	return -S;
}

void make(int sw, int currLvl, int pos) {
	int manoMedyElm = (1 << (maxLvl - currLvl + 1));
	// printf("sw = %d, pradsW = %d, manoMedyElm = %d, truksta = %d\n", sw, pradSw, manoMedyElm, truksta);
	if (manoMedyElm <= truksta) {
		X[sw] = Y[sw] = pradSw;
		truksta -= manoMedyElm;
		return;
	}

	if (currLvl == maxLvl) {
		if (!truksta) place[pos] = {sw, 0};
		else {
			X[sw] = pradSw;
			truksta--;
		}

		pos |= (1 << currLvl);
		place[pos] = {sw, 1};
	} else {
		int ns = nxtS();
		X[sw] = ns;
		ns = nxtS();
		Y[sw] = ns;

		// print(X, "X: ");
		// print(Y, "Y: ");

		// printf("sw = %d, x y = %d %d, S = %d\n", sw, X[sw], Y[sw], S);
		make(-X[sw], currLvl + 1, pos);
		make(-Y[sw], currLvl + 1, pos | (1 << currLvl));
	}
}


void daryk(int m) {
	int sz = (int)iseina[m].size();
	n =	(1 << (int)ceil(log2(sz)));
	maxLvl = log2(n);
	maxLvl--;
	truksta = n - sz;

	// printf("sz = %d, n = %d, mxlvl = %d,truksta = %d\n", sz, n, maxLvl, truksta);
	place = vpi(n, pi(0, 0));

	int cs = nxtS();
	C[m] = cs;
	pradSw = C[m];

	make(-C[m], 0, 0);

	// printf("m = %d, sz = %d, n = %d, place:\n", m, sz, n);
	// for (auto u : place)
	// 	printf("%d %d\n", u.x, u.y);
	// printf("\n");

	int j = 0;
	for (int i = 0; i < sz; ++i)
	{
		while (j < n and !place[j].x) j++;
		assert(j < n);

		int h = place[j].x;

		// printf("i = %d, iseina = %d, h = %d\n", i, iseina[m][i], h);
		if (place[j].y) Y[h] = iseina[m][i];
		else X[h] = iseina[m][i];
		j++;
	}
}

void create_circuit(int M, vi A) {
	N = A.size();
	C = vi(M + 1);
	iseina = vii(M + 1);
	A.emplace_back(0);

	C[0] = A[0];

	for (int i = 0; i < N; ++i)
		iseina[A[i]].emplace_back(A[i + 1]);

	X.emplace_back(0);
	Y.emplace_back(0);

	for (int i = 1; i <= M; ++i)
	{
		if (iseina[i].empty()) C[i] = 0;
		else if (iseina[i].size() == 1) C[i] = iseina[i][0];
		else daryk(i);
	}
	X.erase(X.begin());
	Y.erase(Y.begin());

	// printf("S = %d\n", S);
	// print(C, "C: ");
	// for (int i = 0; i < S; ++i) printf("%d ", X[i]); printf("\n");
	// for (int i = 0; i < S; ++i) printf("%d ", Y[i]); printf("\n");
	answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 39 ms 6344 KB Output is correct
3 Correct 24 ms 5304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 56 ms 7860 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 39 ms 6344 KB Output is correct
3 Correct 24 ms 5304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 56 ms 7860 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 67 ms 7904 KB Output is correct
9 Correct 71 ms 9108 KB Output is correct
10 Correct 105 ms 12376 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 39 ms 6344 KB Output is correct
3 Correct 24 ms 5304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 56 ms 7860 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 67 ms 7904 KB Output is correct
9 Correct 71 ms 9108 KB Output is correct
10 Correct 105 ms 12376 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 111 ms 13348 KB Output is correct
15 Correct 61 ms 6844 KB Output is correct
16 Correct 106 ms 10116 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 106 ms 12344 KB Output is correct
21 Correct 1 ms 236 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
14.7580402392 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 55 ms 7368 KB Output is correct
3 Partially correct 49 ms 7572 KB Output is partially correct
4 Correct 78 ms 10380 KB Output is correct

Subtask #6
34.914797876 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 55 ms 7368 KB Output is correct
3 Partially correct 49 ms 7572 KB Output is partially correct
4 Correct 78 ms 10380 KB Output is correct
5 Partially correct 156 ms 14324 KB Output is partially correct
6 Partially correct 119 ms 13744 KB Output is partially correct
7 Partially correct 132 ms 13932 KB Output is partially correct
8 Partially correct 106 ms 12520 KB Output is partially correct
9 Partially correct 49 ms 6992 KB Output is partially correct
10 Partially correct 91 ms 11788 KB Output is partially correct
11 Partially correct 87 ms 9940 KB Output is partially correct
12 Partially correct 56 ms 5844 KB Output is partially correct
13 Partially correct 76 ms 8220 KB Output is partially correct
14 Partially correct 86 ms 8336 KB Output is partially correct
15 Partially correct 84 ms 8648 KB Output is partially correct
16 Partially correct 4 ms 460 KB Output is partially correct
17 Partially correct 55 ms 6532 KB Output is partially correct
18 Partially correct 63 ms 6512 KB Output is partially correct
19 Partially correct 55 ms 5576 KB Output is partially correct
20 Partially correct 86 ms 9740 KB Output is partially correct
21 Partially correct 79 ms 9080 KB Output is partially correct
22 Partially correct 77 ms 9088 KB Output is partially correct