oj.uz

Submission #75484

# Submission time Handle Problem Language Result Execution time Memory
75484 2018-09-09T21:52:28 Z sevenkplus Mechanical Doll (IOI18_doll) C++14
53 / 100
 211 ms 14252 KB 
#include "doll.h"

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

typedef long long ll;
typedef pair<int, int> PII;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pct __builtin_popcount

#define INF 1000000007

vector<PII> ff(vector<int> a) {
	int n = (int) a.size();
	int p = 1;
	while (p < n) p *= 2;
	vector<PII> s(p-1);
	vector<bool> t(p-1, 0);
	for (int i = 0; i < p/2-1; i ++)
		s[i] = mp(-(i*2+1 +1), -(i*2+2 +1));
	for (int i = 0; i < p; i ++) {
		int x = 0;
		while (x < p-1) {
			if (t[x] == 1) {
				t[x] = 0;
				x = x*2+2;
			} else {
				t[x] = 1;
				x = x*2+1;
			}
		}
		int ne = -1;
		if (i >= p-n) ne = a[i-(p-n)];
		if (x%2) s[(x-1)/2].fi = ne;
		else s[(x-1)/2].se = ne;
	}
	return s;
}
 
bool gg(int m, vector<int> a) {
	int n = a.size();
	vector<int> sc(m + 1, -1);
	sc[0] = a[0];
	
	vector<vector<int> > p(m+1);
	for (int i = 0; i < n; i ++) {
		int ne = 0;
		if (i != n-1) ne = a[i+1];
		p[a[i]].pb(ne);
		// if (p[a[i]].size() >= 5) return false;
	}
	
	vector<int> sx, sy;
	int nc = 0;
	for (int i = 1; i <= m; i ++) {
		if (p[i].empty()) {
			sc[i] = 0;
			continue;
		}
		if (p[i].size() == 1) {
			sc[i] = p[i][0];
			continue;
		}
		vector<PII> v = ff(p[i]);
		sc[i] = -(nc+1);
		for (int j = 0; j < (int) v.size(); j ++) {
			int w = v[j].fi;
			if (w < 0) w -= nc;
			sx.pb(w);
			w = v[j].se;
			if (w < 0) w -= nc;
			sy.pb(w);
		}
		nc += (int) v.size();
	}
	answer(sc, sx, sy);
	return true;
}

void create_circuit(int m, vector<int> a) {
	if (gg(m, a)) return;
	int n = a.size();
	a.pb(0);
	vector<int> sc(m + 1, 0);
	sc[0] = a[0];
	if (n == 1) {
		answer(sc, {}, {});
		return;
	}
	for (int i = 1; i <= m; i ++) sc[i] = -1;
	
	int p = 1;
	while (p < n) p *= 2;
	vector<int> wx(p-1, INF);
	vector<int> wy(p-1, INF);
	vector<bool> t(p-1, 0);
	for (int i = 0; i < p/2-1; i ++) {
		wx[i] = -(i*2+1 +1);
		wy[i] = -(i*2+2 +1);
	}
	for (int i = 0; i < p; i ++) {
		int x = 0;
		while (x < p-1) {
			if (t[x] == 1) {
				t[x] = 0;
				x = x*2+2;
			} else {
				t[x] = 1;
				x = x*2+1;
			}
		}
		int ne = -1;
		if (i >= p-n) ne = a[i-(p-n)+1];
		if (x%2) wx[(x-1)/2] = ne;
		else wy[(x-1)/2] = ne;
	}

	answer(sc, wx, wy);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 35 ms 6596 KB Output is correct
3 Correct 28 ms 5452 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 51 ms 8004 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 35 ms 6596 KB Output is correct
3 Correct 28 ms 5452 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 51 ms 8004 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 81 ms 7700 KB Output is correct
9 Correct 70 ms 9052 KB Output is correct
10 Correct 95 ms 11800 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 35 ms 6596 KB Output is correct
3 Correct 28 ms 5452 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 13 ms 3788 KB Output is correct
6 Correct 51 ms 8004 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 81 ms 7700 KB Output is correct
9 Correct 70 ms 9052 KB Output is correct
10 Correct 95 ms 11800 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 130 ms 11796 KB Output is correct
15 Correct 58 ms 6336 KB Output is correct
16 Correct 89 ms 9492 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 140 ms 11440 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 220 KB Output is partially correct
2 Correct 59 ms 5660 KB Output is correct
3 Partially correct 99 ms 8468 KB Output is partially correct
4 Partially correct 108 ms 9620 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 220 KB Output is partially correct
2 Correct 59 ms 5660 KB Output is correct
3 Partially correct 99 ms 8468 KB Output is partially correct
4 Partially correct 108 ms 9620 KB Output is partially correct
5 Partially correct 120 ms 12800 KB Output is partially correct
6 Partially correct 124 ms 13268 KB Output is partially correct
7 Partially correct 124 ms 13148 KB Output is partially correct
8 Partially correct 129 ms 13608 KB Output is partially correct
9 Partially correct 91 ms 10676 KB Output is partially correct
10 Partially correct 211 ms 14252 KB Output is partially correct
11 Partially correct 129 ms 13992 KB Output is partially correct
12 Partially correct 112 ms 9288 KB Output is partially correct
13 Partially correct 84 ms 8880 KB Output is partially correct
14 Partially correct 112 ms 8720 KB Output is partially correct
15 Partially correct 87 ms 8444 KB Output is partially correct
16 Partially correct 3 ms 460 KB Output is partially correct
17 Partially correct 73 ms 7696 KB Output is partially correct
18 Partially correct 86 ms 7696 KB Output is partially correct
19 Partially correct 74 ms 8084 KB Output is partially correct
20 Partially correct 111 ms 10520 KB Output is partially correct
21 Partially correct 117 ms 12380 KB Output is partially correct
22 Partially correct 103 ms 9904 KB Output is partially correct