oj.uz

Submission #260024

# Submission time Handle Problem Language Result Execution time Memory
260024 2020-08-09T01:36:47 Z ChrisT Mechanical Doll (IOI18_doll) C++17
53 / 100
 166 ms 13112 KB 
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
void create_circuit (int m, vector<int> a) {
	int n = a.size();
	vector<vector<int>> togo(m+1); vector<int> exit(m+1),x,y;
	int lst = 0;
	for (int i = 0; i < n; i++) {
		togo[lst].push_back(a[i]);
		lst = a[i];
	}
	togo[lst].push_back(0);
	for (int j = 0; j <= m; j++) {
		if (togo[j].empty()) exit[j] = j;
		else if (togo[j].size() == 1) exit[j] = togo[j][0];
		else {
			int levels = __lg((int)togo[j].size() - 1) + 1, base = (int)x.size();
			x.resize(base + (1 << levels) - 1);
			y.resize(base + (1 << levels) - 1); vector<int> val(1 << levels); val[1] = 0;
			exit[j] = -(base + 1);
			for (int i = 1; i < (1 << (levels - 1)); i++) {
				x[base + i - 1] = -(base + i * 2);
				val[i*2] = val[i];
				y[base + i - 1] = -(base + i * 2 + 1);
				val[i*2+1] = val[i] | (1 << __lg(i));
			}
			int lower = (1 << levels) - (int)togo[j].size();
			for (int i = (1 << (levels-1)); i < (1 << levels); i++) {
				int lVal = val[i], rVal = val[i] | (1 << __lg(i));
				if (lVal >= lower) x[base + i - 1] = togo[j][lVal - lower];
				else x[base + i - 1] = -(base + 1);
				if (rVal >= lower) y[base + i - 1] = togo[j][rVal - lower];
				else y[base + i - 1] = -(base + 1); 
			}
		}
	}
	answer(exit,x,y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 65 ms 6268 KB Output is correct
3 Correct 39 ms 5068 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 49 ms 7640 KB Output is correct
7 Correct 2 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 65 ms 6268 KB Output is correct
3 Correct 39 ms 5068 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 49 ms 7640 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 81 ms 7148 KB Output is correct
9 Correct 98 ms 8604 KB Output is correct
10 Correct 142 ms 11064 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 65 ms 6268 KB Output is correct
3 Correct 39 ms 5068 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 14 ms 3788 KB Output is correct
6 Correct 49 ms 7640 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 81 ms 7148 KB Output is correct
9 Correct 98 ms 8604 KB Output is correct
10 Correct 142 ms 11064 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 136 ms 10908 KB Output is correct
15 Correct 56 ms 5724 KB Output is correct
16 Correct 105 ms 8612 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 139 ms 10588 KB Output is correct
21 Correct 2 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 1 ms 204 KB Output is partially correct
2 Correct 57 ms 4928 KB Output is correct
3 Partially correct 97 ms 7944 KB Output is partially correct
4 Partially correct 85 ms 8676 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 4928 KB Output is correct
3 Partially correct 97 ms 7944 KB Output is partially correct
4 Partially correct 85 ms 8676 KB Output is partially correct
5 Partially correct 148 ms 12072 KB Output is partially correct
6 Partially correct 166 ms 12496 KB Output is partially correct
7 Partially correct 121 ms 12332 KB Output is partially correct
8 Partially correct 121 ms 12664 KB Output is partially correct
9 Partially correct 73 ms 8600 KB Output is partially correct
10 Partially correct 151 ms 12952 KB Output is partially correct
11 Partially correct 128 ms 13112 KB Output is partially correct
12 Partially correct 77 ms 8788 KB Output is partially correct
13 Partially correct 83 ms 8292 KB Output is partially correct
14 Partially correct 96 ms 8084 KB Output is partially correct
15 Partially correct 97 ms 8000 KB Output is partially correct
16 Partially correct 3 ms 460 KB Output is partially correct
17 Partially correct 64 ms 7108 KB Output is partially correct
18 Partially correct 61 ms 7164 KB Output is partially correct
19 Partially correct 85 ms 7524 KB Output is partially correct
20 Partially correct 99 ms 9724 KB Output is partially correct
21 Partially correct 130 ms 11664 KB Output is partially correct
22 Partially correct 81 ms 9056 KB Output is partially correct