#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
void create_circuit(int m, vector<int> a) {
int n = a.size();
vector<int> sc(m + 1, -1);
sc[0] = a[0];
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<PII> s(p-1);
vector<bool> t(p-1, 0);
for (int i = 0; i < p/2-1; i ++)
s[i] = mp(-(i*2+1 +1), -(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) s[(x-1)/2].fi = ne;
else s[(x-1)/2].se = ne;
}
vector<int> sx, sy;
for (int j = 0; j < (int) s.size(); j ++) {
sx.pb(s[j].fi);
sy.pb(s[j].se);
}
answer(sc, sx, sy);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
204 KB |
Output is partially correct |
2 |
Correct |
55 ms |
6212 KB |
Output is correct |
3 |
Partially correct |
95 ms |
10180 KB |
Output is partially correct |
4 |
Partially correct |
119 ms |
10968 KB |
Output is partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
204 KB |
Output is partially correct |
2 |
Correct |
55 ms |
6212 KB |
Output is correct |
3 |
Partially correct |
95 ms |
10180 KB |
Output is partially correct |
4 |
Partially correct |
119 ms |
10968 KB |
Output is partially correct |
5 |
Partially correct |
108 ms |
11316 KB |
Output is partially correct |
6 |
Partially correct |
118 ms |
11088 KB |
Output is partially correct |
7 |
Partially correct |
114 ms |
11224 KB |
Output is partially correct |
8 |
Partially correct |
121 ms |
10952 KB |
Output is partially correct |
9 |
Partially correct |
105 ms |
10212 KB |
Output is partially correct |
10 |
Partially correct |
109 ms |
10956 KB |
Output is partially correct |
11 |
Partially correct |
135 ms |
11092 KB |
Output is partially correct |
12 |
Partially correct |
96 ms |
10172 KB |
Output is partially correct |
13 |
Correct |
57 ms |
6340 KB |
Output is correct |
14 |
Partially correct |
100 ms |
10296 KB |
Output is partially correct |
15 |
Partially correct |
100 ms |
10340 KB |
Output is partially correct |
16 |
Partially correct |
4 ms |
716 KB |
Output is partially correct |
17 |
Correct |
68 ms |
6344 KB |
Output is correct |
18 |
Correct |
71 ms |
6312 KB |
Output is correct |
19 |
Partially correct |
98 ms |
10208 KB |
Output is partially correct |
20 |
Partially correct |
107 ms |
10980 KB |
Output is partially correct |
21 |
Partially correct |
120 ms |
10968 KB |
Output is partially correct |
22 |
Partially correct |
103 ms |
11028 KB |
Output is partially correct |