oj.uz

Submission #138994

# Submission time Handle Problem Language Result Execution time Memory
138994 2019-07-31T06:50:31 Z MAMBA Mechanical Doll (IOI18_doll) C++17
6 / 100
 136 ms 14716 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

#define rep(i , j , k) for(int i = j; i < (int)k; i++)
#define pb push_back

typedef vector<int> vi;

const int N = 2e5 + 10;

vi C , X  ,Y, nx[N];

int n, cnt = 1;

inline int inve(int sz , int l) {
	int res = 0;
	rep(i , 0 , sz)
		if (l & (1 << i))
			res ^= (1 << (sz - 1 - i));
	return res;
}

int build2(vi &vec , int l = 0, int r = -1) {
	if (r == -1) r = vec.size();
	if (l == r - 1) return vec[inve(__builtin_ctz(vec.size()), l)];
	int mid = l + r >> 1;
	int me = cnt++;
	X.pb(0), Y.pb(0);
	int le = build2(vec , l , mid);
	int re = build2(vec , mid , r);
	X[me - 1] = le;
	Y[me - 1] = re;
	return -me;
}

void build(vi vec) {
	//if (vec.empty()) return;
	int sz = vec.size();
	if(__builtin_popcount(sz) == 1) {
		build2(vec);
		return;
	}

	for (int i = 20; ~i; i--)
		if (sz > (1 << i) - 1) {
			vi local(vec.begin() , vec.begin() + (1 << i) - 1);
			local.pb(-(cnt + (1 << i) - 1));
			build2(local);
			build(vi(vec.begin() + (1 << i) - 1 , vec.end()));
			break;
		}
}

void create_circuit(int M, vi A) {
	n = A.size();
	A.pb(0);

	rep(i , 0 , n) 
		nx[A[i]].pb(A[i + 1]);

	C.resize(M + 1);

	C[0] = A[0];

	rep(i , 1 , M + 1) {
		if (nx[i].empty()) 
			C[i] = 0;
		else if (nx[i].size() == 1) {
			C[i] = nx[i][0];
		}
		else {
			C[i] = -cnt;
			build(nx[i]);
		}
	}



	answer(C , X , Y);
	return;
}

Compilation message

doll.cpp: In function 'int build2(vi&, int, int)':
doll.cpp:28:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |  int mid = l + r >> 1;
      |            ~~^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 41 ms 8648 KB Output is correct
3 Correct 30 ms 8456 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 18 ms 6092 KB Output is correct
6 Correct 50 ms 10208 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 41 ms 8648 KB Output is correct
3 Correct 30 ms 8456 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 18 ms 6092 KB Output is correct
6 Correct 50 ms 10208 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 62 ms 11156 KB Output is correct
9 Correct 67 ms 11528 KB Output is correct
10 Correct 136 ms 14716 KB Output is correct
11 Correct 4 ms 4960 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 41 ms 8648 KB Output is correct
3 Correct 30 ms 8456 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 18 ms 6092 KB Output is correct
6 Correct 50 ms 10208 KB Output is correct
7 Correct 5 ms 4940 KB Output is correct
8 Correct 62 ms 11156 KB Output is correct
9 Correct 67 ms 11528 KB Output is correct
10 Correct 136 ms 14716 KB Output is correct
11 Correct 4 ms 4960 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Incorrect 123 ms 13800 KB wrong motion
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB wrong motion
2 Halted 0 ms 0 KB -