oj.uz

Submission #102069

# Submission time Handle Problem Language Result Execution time Memory
102069 2019-03-22T06:39:07 Z bert30702 Mechanical Doll (IOI18_doll) C++17
76.0329 / 100
 164 ms 10536 KB 
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
const int MX = 4e5 + 1000;
int ptr = 0;
int x[MX], y[MX], c[MX];
//void answer(vector<int> c, vector<int> x, vector<int> y) {
//	cout << x.size() << endl;
//	for(auto it: c) cout << it << ' '; cout << endl;
//	for(auto it: x) cout << it << ' '; cout << endl;
//	for(auto it: y) cout << it << ' '; cout << endl;
//}
int build(vector<int> v) {
	if(ptr != 0 and *max_element(v.begin(), v.end()) == *min_element(v.begin(), v.end())) return v[0];
	int d = --ptr;
	vector<int> a, b;
	for(int i = 0; i < v.size(); i ++) {
		if(i & 1) b.push_back(v[i]);
		else      a.push_back(v[i]);
	}
	x[-d] = build(a);
	y[-d] = build(b);
	return d;
}
void create_circuit(int n, vector<int> v) {
	vector<int> a(v.begin() + 1, v.end()); a.push_back(0);
	// for(auto it: a) cout << it << ' '; exit(0);
	int k = 1 << __lg(a.size() * 2 - 1);
	vector<int> tmp(k), GG(k, 0);
	int need = k - a.size();
	for(int i = k / 2; i >= 1; i >>= 1) {
		for(int j = 0; j < k; j += i) {
			if(!GG[j] and need) {
				GG[j] = true, tmp[j] = -1, need --;
			}
		}
	}
	for(int i = k - 1; i >= 0; i --) {
		if(!GG[i]) tmp[i] = a.back(), a.pop_back();
	}
	build(tmp); c[0] = v[0];
	for(int i = 1; i <= n; i ++) c[i] = -1;
	answer(
		vector<int>(c, c + n + 1),
		vector<int>(x + 1, x + 1 - ptr),
		vector<int>(y + 1, y + 1 - ptr)
	);
}
//main () {
//	create_circuit(4, {1, 1, 1});
//}

Compilation message

doll.cpp: In function 'int build(std::vector<int>)':
doll.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for(int i = 0; i < v.size(); i ++) {
      |                 ~~^~~~~~~~~~

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 53 ms 4784 KB Output is correct
3 Correct 69 ms 4660 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 17 ms 1484 KB Output is correct
6 Incorrect 83 ms 6776 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 53 ms 4784 KB Output is correct
3 Correct 69 ms 4660 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 17 ms 1484 KB Output is correct
6 Incorrect 83 ms 6776 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 53 ms 4784 KB Output is correct
3 Correct 69 ms 4660 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 17 ms 1484 KB Output is correct
6 Incorrect 83 ms 6776 KB Output isn't correct
7 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 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 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
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 22 ms 4920 KB Output is correct
3 Correct 30 ms 8000 KB Output is correct
4 Correct 47 ms 8884 KB Output is correct

Subtask #6
48.0329090472 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 22 ms 4920 KB Output is correct
3 Correct 30 ms 8000 KB Output is correct
4 Correct 47 ms 8884 KB Output is correct
5 Partially correct 149 ms 10404 KB Output is partially correct
6 Partially correct 143 ms 10408 KB Output is partially correct
7 Partially correct 142 ms 10536 KB Output is partially correct
8 Partially correct 147 ms 10372 KB Output is partially correct
9 Correct 76 ms 8736 KB Output is correct
10 Correct 140 ms 10272 KB Output is correct
11 Partially correct 143 ms 10460 KB Output is partially correct
12 Correct 93 ms 8960 KB Output is correct
13 Correct 89 ms 7112 KB Output is correct
14 Correct 95 ms 8968 KB Output is correct
15 Correct 103 ms 8952 KB Output is correct
16 Correct 4 ms 588 KB Output is correct
17 Correct 101 ms 6816 KB Output is correct
18 Correct 84 ms 6772 KB Output is correct
19 Correct 88 ms 9008 KB Output is correct
20 Partially correct 142 ms 10400 KB Output is partially correct
21 Partially correct 164 ms 10368 KB Output is partially correct
22 Partially correct 139 ms 10408 KB Output is partially correct