oj.uz

Submission #75452

# Submission time Handle Problem Language Result Execution time Memory
75452 2018-09-09T20:14:10 Z sevenkplus Mechanical Doll (IOI18_doll) C++14
47 / 100
 125 ms 11284 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

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;
}

void create_circuit(int m, vector<int> a) {
	int n = a.size();
	vector<int> sc(m + 1, -1);
	sc[0] = a[0];
	
	vector<int> b;
	for (int i = 1; i < n; i ++) b.pb(a[i]);
	b.pb(0);
	vector<PII> v = ff(b);
	
	vector<int> sx, sy;
	for (int j = 0; j < (int) v.size(); j ++) {
		sx.pb(v[j].fi);
		sy.pb(v[j].se);
	}
	
	/*
	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);
	}
	
	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();
	}
	*/
	/*
	for (int i = 0; i < (int) sc.size(); i ++)
		printf("%d: %d\n", i, sc[i]);
	for (int i = 0; i < (int) sx.size(); i ++)
		printf("%d: %d %d\n", -(i+1), sx[i], sy[i]);
	*/
	answer(sc, sx, sy);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
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 #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 57 ms 6176 KB Output is correct
3 Partially correct 98 ms 10084 KB Output is partially correct
4 Partially correct 103 ms 11176 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct
2 Correct 57 ms 6176 KB Output is correct
3 Partially correct 98 ms 10084 KB Output is partially correct
4 Partially correct 103 ms 11176 KB Output is partially correct
5 Partially correct 118 ms 11280 KB Output is partially correct
6 Partially correct 113 ms 11284 KB Output is partially correct
7 Partially correct 115 ms 11208 KB Output is partially correct
8 Partially correct 125 ms 11152 KB Output is partially correct
9 Partially correct 100 ms 10120 KB Output is partially correct
10 Partially correct 117 ms 11156 KB Output is partially correct
11 Partially correct 108 ms 11148 KB Output is partially correct
12 Partially correct 94 ms 10184 KB Output is partially correct
13 Correct 69 ms 6328 KB Output is correct
14 Partially correct 97 ms 10184 KB Output is partially correct
15 Partially correct 97 ms 10356 KB Output is partially correct
16 Partially correct 5 ms 588 KB Output is partially correct
17 Correct 78 ms 6208 KB Output is correct
18 Correct 57 ms 6168 KB Output is correct
19 Partially correct 95 ms 10180 KB Output is partially correct
20 Partially correct 107 ms 11176 KB Output is partially correct
21 Partially correct 105 ms 11164 KB Output is partially correct
22 Partially correct 119 ms 11148 KB Output is partially correct