oj.uz

Submission #75461

# Submission time Handle Problem Language Result Execution time Memory
75461 2018-09-09T20:35:41 Z sevenkplus Mechanical Doll (IOI18_doll) C++14
47 / 100
 133 ms 9240 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

void create_circuit(int m, vector<int> a) {
	int n = a.size();
	vector<int> sc(m + 1, -1);
	sc[0] = a[0];
	if (n == 1) {
		for (int i = 1; i <= m; i ++) sc[i] = 0;
		answer(sc, {}, {});
		return;
	}
	
	vector<int> b;
	for (int i = 1; i < n; i ++) b.pb(a[i]);
	b.pb(0);

	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 = b[i-(p-n)];
		if (x%2) wx[(x-1)/2] = ne;
		else wy[(x-1)/2] = ne;
	}

	answer(sc, wx, wy);
}

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 2 ms 204 KB Output is correct
3 Correct 1 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 1 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 56 ms 5160 KB Output is correct
3 Partially correct 99 ms 8096 KB Output is partially correct
4 Partially correct 106 ms 8872 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 56 ms 5160 KB Output is correct
3 Partially correct 99 ms 8096 KB Output is partially correct
4 Partially correct 106 ms 8872 KB Output is partially correct
5 Partially correct 116 ms 9240 KB Output is partially correct
6 Partially correct 111 ms 9004 KB Output is partially correct
7 Partially correct 110 ms 9156 KB Output is partially correct
8 Partially correct 106 ms 8872 KB Output is partially correct
9 Partially correct 117 ms 8124 KB Output is partially correct
10 Partially correct 104 ms 8956 KB Output is partially correct
11 Partially correct 112 ms 8888 KB Output is partially correct
12 Partially correct 95 ms 8096 KB Output is partially correct
13 Correct 56 ms 5036 KB Output is correct
14 Partially correct 104 ms 8224 KB Output is partially correct
15 Partially correct 95 ms 8348 KB Output is partially correct
16 Partially correct 4 ms 588 KB Output is partially correct
17 Correct 60 ms 5052 KB Output is correct
18 Correct 57 ms 5020 KB Output is correct
19 Partially correct 100 ms 8092 KB Output is partially correct
20 Partially correct 133 ms 8868 KB Output is partially correct
21 Partially correct 117 ms 8876 KB Output is partially correct
22 Partially correct 125 ms 8876 KB Output is partially correct