#include "doll.h"
#include<cstdio>
#include<algorithm>
#include<queue>
#define N_ 101000
using namespace std;
int n, m, Out[N_], cnt, chk[N_*10], PV;
int RR[N_ * 10][2];
vector<int>E[N_], TP;
void Go(int a, int L, int cur, int ed) {
if (L == 1) {
if (RR[a][cur & 1]) {
RR[RR[a][cur & 1]][0] = ed;
return;
}
RR[a][cur & 1] = ed;
return;
}
if (!RR[a][cur & 1])RR[a][cur & 1] = ++cnt;
Go(RR[a][cur & 1], L - 1, cur >> 1, ed);
}
int Make() {
int ret = cnt + 1;
int i, sz = 1, cc = 0, j;
int L = TP.size();
while (sz < L) sz *= 2, cc++;
for (i = 1; i < sz/2; i++) {
RR[cnt + i][0] = cnt + i * 2;
RR[cnt + i][1] = cnt + i * 2 + 1;
}
cnt += sz - 1;
for (i = 0; i < L; i++) {
Go(ret, cc, sz - L + i, -TP[i]);
}
for (i = ret; i <= cnt; i++) {
if (!RR[i][0])RR[i][0] = ret;
}
return -ret;
}
void create_circuit(int M, std::vector<int> A) {
n = A.size();
m = M;
E[0].push_back(A[0]);
int i;
for (i = 0; i < n - 1; i++) {
E[A[i]].push_back(A[i + 1]);
}
E[A[n - 1]].push_back(0);
for (i = 0; i <= M; i++) {
if (E[i].size() == 0) Out[i] = 0;
else if (E[i].size() == 1)Out[i] = E[i][0];
else {
TP = E[i];
Out[i] = Make();
}
}
vector<int>C(m+1), X(cnt), Y(cnt);
for (i = 0; i <= m; i++)C[i] = Out[i];
for (i = 0; i < cnt; i++)X[i] = -RR[i+1][0], Y[i] = -RR[i+1][1];
answer(C, X, Y);
}
Compilation message
doll.cpp: In function 'int Make()':
doll.cpp:29:25: warning: unused variable 'j' [-Wunused-variable]
29 | int i, sz = 1, cc = 0, j;
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
37 ms |
7212 KB |
Output is correct |
3 |
Correct |
41 ms |
6616 KB |
Output is correct |
4 |
Correct |
3 ms |
2636 KB |
Output is correct |
5 |
Correct |
18 ms |
4172 KB |
Output is correct |
6 |
Correct |
69 ms |
8748 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
37 ms |
7212 KB |
Output is correct |
3 |
Correct |
41 ms |
6616 KB |
Output is correct |
4 |
Correct |
3 ms |
2636 KB |
Output is correct |
5 |
Correct |
18 ms |
4172 KB |
Output is correct |
6 |
Correct |
69 ms |
8748 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
60 ms |
9636 KB |
Output is correct |
9 |
Correct |
65 ms |
10252 KB |
Output is correct |
10 |
Correct |
109 ms |
12896 KB |
Output is correct |
11 |
Correct |
3 ms |
2636 KB |
Output is correct |
12 |
Correct |
3 ms |
2636 KB |
Output is correct |
13 |
Correct |
3 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
37 ms |
7212 KB |
Output is correct |
3 |
Correct |
41 ms |
6616 KB |
Output is correct |
4 |
Correct |
3 ms |
2636 KB |
Output is correct |
5 |
Correct |
18 ms |
4172 KB |
Output is correct |
6 |
Correct |
69 ms |
8748 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
60 ms |
9636 KB |
Output is correct |
9 |
Correct |
65 ms |
10252 KB |
Output is correct |
10 |
Correct |
109 ms |
12896 KB |
Output is correct |
11 |
Correct |
3 ms |
2636 KB |
Output is correct |
12 |
Correct |
3 ms |
2636 KB |
Output is correct |
13 |
Correct |
3 ms |
2636 KB |
Output is correct |
14 |
Correct |
123 ms |
14508 KB |
Output is correct |
15 |
Correct |
62 ms |
9156 KB |
Output is correct |
16 |
Correct |
100 ms |
12088 KB |
Output is correct |
17 |
Correct |
3 ms |
2636 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
19 |
Correct |
3 ms |
2636 KB |
Output is correct |
20 |
Correct |
149 ms |
13556 KB |
Output is correct |
21 |
Correct |
2 ms |
2636 KB |
Output is correct |
22 |
Correct |
2 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
2660 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
2636 KB |
Output is partially correct |
2 |
Correct |
74 ms |
9772 KB |
Output is correct |
3 |
Partially correct |
92 ms |
13812 KB |
Output is partially correct |
4 |
Partially correct |
124 ms |
15020 KB |
Output is partially correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
2636 KB |
Output is partially correct |
2 |
Correct |
74 ms |
9772 KB |
Output is correct |
3 |
Partially correct |
92 ms |
13812 KB |
Output is partially correct |
4 |
Partially correct |
124 ms |
15020 KB |
Output is partially correct |
5 |
Partially correct |
138 ms |
16732 KB |
Output is partially correct |
6 |
Partially correct |
153 ms |
17888 KB |
Output is partially correct |
7 |
Partially correct |
127 ms |
17536 KB |
Output is partially correct |
8 |
Partially correct |
145 ms |
18608 KB |
Output is partially correct |
9 |
Partially correct |
120 ms |
13476 KB |
Output is partially correct |
10 |
Partially correct |
150 ms |
18668 KB |
Output is partially correct |
11 |
Partially correct |
155 ms |
19140 KB |
Output is partially correct |
12 |
Partially correct |
98 ms |
13984 KB |
Output is partially correct |
13 |
Partially correct |
102 ms |
13012 KB |
Output is partially correct |
14 |
Partially correct |
100 ms |
12668 KB |
Output is partially correct |
15 |
Partially correct |
84 ms |
12184 KB |
Output is partially correct |
16 |
Partially correct |
5 ms |
2924 KB |
Output is partially correct |
17 |
Partially correct |
87 ms |
11868 KB |
Output is partially correct |
18 |
Partially correct |
69 ms |
11776 KB |
Output is partially correct |
19 |
Partially correct |
102 ms |
12384 KB |
Output is partially correct |
20 |
Partially correct |
121 ms |
14968 KB |
Output is partially correct |
21 |
Partially correct |
116 ms |
17392 KB |
Output is partially correct |
22 |
Partially correct |
93 ms |
14276 KB |
Output is partially correct |