QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #761061 | #9519. Build a Computer | oO_Oo | AC ✓ | 26ms | 28604kb | C++14 | 5.7kb | 2024-11-18 20:45:39 | 2024-11-18 20:45:41 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using i128 = __int128_t;
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#ifdef LOCAL
#include "../debug.h"
#else
#define debug(...) do {} while(false)
#endif
const int N = 1000010, M = 20 * N;
int tr[M][2];
int flag[M];
void solut() {
int l, r;
cin >> l >> r;
int tot = 1;
int Q = 19;
auto insert = [&](int x) {
int u = 1;
for (int i = Q; i >= 0; i --) {
if (!tr[u][x >> i & 1]) tr[u][x >> i & 1] = ++ tot;
u = tr[u][x >> i & 1];
}
flag[u] = 1;
};
for (int i = l; i <= r; i ++) insert(i);
debug(tot);
int Node = 1;
auto newNode = [&]() {
assert(Node <= 100);
return Node ++;
};
int beg = newNode();
int end = newNode();
vector<vector<pii>> e(101);
int edges = 0;
auto add = [&](int u, int v, int w) {
edges++;
assert(edges <= 200 * 100);
e[u].push_back({v, w});
};
vector<int> idx(20);
function<int(int)> get = [&](int i) {
if (i < 0) return end;
if (idx[i]) return idx[i];
idx[i] = newNode();
int v = get(i - 1);
add(idx[i], v, 1);
add(idx[i], v, 0);
debug(idx[i]);
return idx[i];
};
function<void(int, int, int, int, bool, int)> dfs = [&](int u, int up, int down, int now, bool zero, int i) {
debug(u, now, up, down, zero, i, vector<int>{tr[u]});
if (up && down) {
if (tr[u][0] && tr[u][1]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
int newNow = now;
if (!zero) {
int v = newNode();
add(now, v, 0);
newNow = v;
}
dfs(tr[u][0], 0, 1, newNow, zero, i - 1);
}
if (flag[tr[u][1]]) add(now, end, 1);
else {
int v = newNode();
add(now, v, 1);
dfs(tr[u][1], 1, 0, v, 0, i - 1);
}
} else if (tr[u][0]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
int newNow = now;
if (!zero) {
int v = newNode();
add(now, v, 0); newNow = v;
}
dfs(tr[u][0], 1, 1, newNow, zero, i - 1);
}
} else if (tr[u][1]) {
if (flag[tr[u][1]]) add(now, end, 1);
else {
int v = newNode();
add(now, v, 1);
dfs(tr[u][1], 1, 1, v, 0, i - 1);
}
} else assert(false);
} else if (up) {
if (tr[u][0] && tr[u][1]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
assert(!zero);
add(now, get(i - 1), 0);
}
if (flag[tr[u][1]]) add(now, end, 1);
else {
int v = newNode();
add(now, v, 1);
dfs(tr[u][1], 1, 0, v, 0, i - 1);
}
} else if (tr[u][0]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
assert(!zero);
int v = newNode();
add(now, v, 0);
dfs(tr[u][0], 1, 0, v, zero, i - 1);
}
} else if (tr[u][1]) {
if (flag[tr[u][1]]) add(now, end, 1);
else {
int v = newNode();
add(now, v, 1);
dfs(tr[u][1], 1, 0, v, 0, i - 1);
}
} else assert(false);
} else if (down) {
if (tr[u][0] && tr[u][1]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
int newNow = now;
if (!zero) {
int v = newNode();
add(now, v, 0); newNow = v;
}
dfs(tr[u][0], 0, 1, newNow, zero, i - 1);
}
if (flag[tr[u][1]]) add(now, end, 1);
else {
add(now, get(i - 1), 1);
}
} else if (tr[u][0]) {
if (flag[tr[u][0]]) add(now, end, 0);
else {
int newNow = now;
if (!zero) {
int v = newNode();
add(now, v, 0); newNow = v;
}
dfs(tr[u][0], 0, 1, newNow, zero, i - 1);
}
} else if (tr[u][1]) {
if (flag[tr[u][1]]) add(now, end, 1);
else {
int v = newNode();
add(now, v, 1);;
dfs(tr[u][1], 0, 1, v, 0, i - 1);
}
} else {
exit(0);
}
} else {
assert(false);
}
};
debug(tot);
dfs(1, 1, 1, beg, 1, Q);
cout << Node - 1 << '\n';
for (int i = 1; i < Node; i ++) {
cout <<e[i].size() << ' ';
for (auto [v, w]: e[i]) {
cout << v << ' ' << w << ' ';
}
cout << '\n';
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while (t --) solut();
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
5 7
output:
5 1 3 1 0 2 4 0 5 1 1 2 1 2 2 0 2 1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
10 27
output:
12 2 3 1 8 1 0 2 4 0 6 1 1 5 1 2 2 0 2 1 2 7 1 7 0 2 2 1 2 0 2 9 0 10 1 2 6 1 6 0 1 11 0 2 7 0 12 1 2 2 0 2 1
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
5 13
output:
9 2 3 1 6 1 0 2 4 0 5 1 1 2 1 2 2 1 2 0 2 7 0 8 1 2 5 1 5 0 1 9 0 2 2 0 2 1
result:
ok ok
Test #4:
score: 0
Accepted
time: 26ms
memory: 28604kb
input:
1 1000000
output:
39 20 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 0 2 2 1 2 0 2 3 1 3 0 2 4 1 4 0 2 5 1 5 0 2 6 1 6 0 2 7 1 7 0 2 8 1 8 0 2 9 1 9 0 2 10 1 10 0 2 11 1 11 0 2 12 1 12 0 2 13 1 13 0 2 14 1 14 0 2 15 1 15 0 2 16 1 16 0 2 17 1 17 0 2 18 1...
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3460kb
input:
1 1
output:
2 1 2 1 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
7 9
output:
7 2 3 1 5 1 0 1 4 1 1 2 1 1 6 0 1 7 0 2 2 0 2 1
result:
ok ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
3 7
output:
6 2 3 1 4 1 0 1 2 1 2 5 0 6 1 2 2 1 2 0 2 2 0 2 1
result:
ok ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
1 5
output:
5 3 2 1 3 1 4 1 0 2 2 1 2 0 1 5 0 2 2 0 2 1
result:
ok ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1 4
output:
5 3 2 1 3 1 4 1 0 2 2 1 2 0 1 5 0 1 2 0
result:
ok ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
8 9
output:
5 1 3 1 0 1 4 0 1 5 0 2 2 0 2 1
result:
ok ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
7 51
output:
13 4 3 1 5 1 8 1 9 1 0 1 4 1 1 2 1 2 6 1 6 0 2 7 1 7 0 2 2 1 2 0 2 5 1 5 0 2 8 0 10 1 1 11 0 1 12 0 2 7 0 13 1 2 2 0 2 1
result:
ok ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
51 79
output:
16 2 3 1 11 1 0 1 4 1 2 5 0 10 1 2 6 0 8 1 1 7 1 1 2 1 2 9 1 9 0 2 2 1 2 0 2 8 1 8 0 1 12 0 1 13 0 2 10 0 14 1 2 8 0 15 1 2 9 0 16 1 2 2 0 2 1
result:
ok ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
92 99
output:
14 1 3 1 0 2 4 0 10 1 1 5 1 1 6 1 1 7 1 2 8 0 9 1 2 2 0 2 1 2 2 1 2 0 1 11 0 1 12 0 1 13 0 2 9 0 14 1 2 2 0 2 1
result:
ok ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
27 36
output:
13 2 3 1 9 1 0 1 4 1 2 5 0 7 1 1 6 1 1 2 1 2 8 1 8 0 2 2 1 2 0 1 10 0 1 11 0 2 7 0 12 1 1 13 0 1 2 0
result:
ok ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
55 84
output:
17 2 3 1 11 1 0 1 4 1 2 5 0 8 1 1 6 1 1 7 1 1 2 1 2 9 1 9 0 2 10 1 10 0 2 2 1 2 0 1 12 0 2 13 0 14 1 2 8 1 8 0 1 15 0 2 9 0 16 1 1 17 0 1 2 0
result:
ok ok
Test #16:
score: 0
Accepted
time: 19ms
memory: 19136kb
input:
297208 929600
output:
57 2 3 1 38 1 0 2 4 0 37 1 2 5 0 35 1 1 6 1 2 7 0 34 1 2 8 0 33 1 2 9 0 31 1 1 10 1 2 11 0 30 1 2 12 0 29 1 2 13 0 23 1 1 14 1 1 15 1 1 16 1 1 17 1 1 18 1 2 19 0 22 1 2 20 0 21 1 2 2 0 2 1 2 2 1 2 0 2 21 1 21 0 2 24 1 24 0 2 25 1 25 0 2 26 1 26 0 2 27 1 27 0 2 28 1 28 0 2 ...
result:
ok ok
Test #17:
score: 0
Accepted
time: 16ms
memory: 17044kb
input:
45728 589156
output:
54 5 3 1 32 1 34 1 35 1 36 1 0 2 4 0 29 1 1 5 1 1 6 1 2 7 0 28 1 2 8 0 26 1 1 9 1 2 10 0 24 1 1 11 1 2 12 0 22 1 1 13 1 2 14 0 21 1 2 15 0 20 1 2 16 0 19 1 2 17 0 18 1 2 2 0 2 1 2 2 1 2 0 2 18 1 18 0 2 19 1 19 0 2 20 1 20 0 2 23 1 23 0 2 21 1 21 0 2 25 1 25 0 2 22 1 22 0 2 2...
result:
ok ok
Test #18:
score: 0
Accepted
time: 1ms
memory: 3728kb
input:
129152 138000
output:
47 2 3 1 29 1 0 1 4 1 1 5 1 1 6 1 1 7 1 1 8 1 2 9 0 28 1 2 10 0 27 1 2 11 0 25 1 1 12 1 2 13 0 24 1 2 14 0 23 1 2 15 0 22 1 2 16 0 21 1 2 17 0 20 1 2 18 0 19 1 2 2 0 2 1 2 2 1 2 0 2 19 1 19 0 2 20 1 20 0 2 21 1 21 0 2 22 1 22 0 2 23 1 23 0 2 26 1 26 0 2 24 1 24 0 2 25 1 25 ...
result:
ok ok
Test #19:
score: 0
Accepted
time: 9ms
memory: 13572kb
input:
245280 654141
output:
56 3 3 1 34 1 38 1 0 1 4 1 1 5 1 2 6 0 28 1 1 7 1 1 8 1 1 9 1 1 10 1 1 11 1 2 12 0 27 1 2 13 0 26 1 2 14 0 24 1 1 15 1 2 16 0 23 1 2 17 0 22 1 2 18 0 21 1 2 19 0 20 1 2 2 0 2 1 2 2 1 2 0 2 20 1 20 0 2 21 1 21 0 2 22 1 22 0 2 25 1 25 0 2 23 1 23 0 2 24 1 24 0 2 26 1 26 0 2 ...
result:
ok ok
Test #20:
score: 0
Accepted
time: 3ms
memory: 7220kb
input:
202985 296000
output:
52 2 3 1 35 1 0 1 4 1 2 5 0 34 1 2 6 0 33 1 2 7 0 30 1 1 8 1 1 9 1 2 10 0 29 1 2 11 0 28 1 2 12 0 24 1 1 13 1 1 14 1 1 15 1 2 16 0 22 1 1 17 1 2 18 0 21 1 2 19 0 20 1 1 2 1 2 2 1 2 0 2 20 1 20 0 2 23 1 23 0 2 21 1 21 0 2 25 1 25 0 2 26 1 26 0 2 27 1 27 0 2 22 1 22 0 2 24 1...
result:
ok ok
Test #21:
score: 0
Accepted
time: 16ms
memory: 15856kb
input:
438671 951305
output:
57 2 3 1 37 1 0 1 4 1 2 5 0 35 1 1 6 1 2 7 0 32 1 1 8 1 1 9 1 2 10 0 31 1 2 11 0 30 1 2 12 0 27 1 1 13 1 1 14 1 2 15 0 26 1 2 16 0 25 1 2 17 0 21 1 1 18 1 1 19 1 1 20 1 1 2 1 2 22 1 22 0 2 23 1 23 0 2 24 1 24 0 2 2 1 2 0 2 21 1 21 0 2 25 1 25 0 2 28 1 28 0 2 29 1 29 0 2 2...
result:
ok ok
Test #22:
score: 0
Accepted
time: 6ms
memory: 12212kb
input:
425249 739633
output:
56 2 3 1 37 1 0 1 4 1 2 5 0 36 1 2 6 0 30 1 1 7 1 1 8 1 1 9 1 1 10 1 1 11 1 2 12 0 28 1 1 13 1 2 14 0 27 1 2 15 0 25 1 1 16 1 2 17 0 24 1 2 18 0 23 1 2 19 0 22 1 2 20 0 21 1 1 2 1 2 2 1 2 0 2 21 1 21 0 2 22 1 22 0 2 23 1 23 0 2 26 1 26 0 2 24 1 24 0 2 25 1 25 0 2 29 1 29 0...
result:
ok ok
Test #23:
score: 0
Accepted
time: 6ms
memory: 14712kb
input:
551207 961718
output:
56 1 3 1 0 2 4 0 39 1 2 5 0 38 1 2 6 0 37 1 2 7 0 34 1 1 8 1 1 9 1 2 10 0 32 1 1 11 1 2 12 0 31 1 2 13 0 29 1 1 14 1 2 15 0 28 1 2 16 0 26 1 1 17 1 2 18 0 25 1 2 19 0 22 1 1 20 1 1 21 1 1 2 1 2 23 1 23 0 2 24 1 24 0 2 2 1 2 0 2 22 1 22 0 2 27 1 27 0 2 25 1 25 0 2 26 1 26 0...
result:
ok ok
Test #24:
score: 0
Accepted
time: 14ms
memory: 15868kb
input:
114691 598186
output:
55 4 3 1 32 1 36 1 37 1 0 1 4 1 1 5 1 2 6 0 31 1 2 7 0 30 1 2 8 0 29 1 2 9 0 28 1 2 10 0 27 1 2 11 0 26 1 2 12 0 25 1 2 13 0 24 1 2 14 0 23 1 2 15 0 22 1 2 16 0 21 1 2 17 0 19 1 1 18 1 1 2 1 2 20 1 20 0 2 2 1 2 0 2 19 1 19 0 2 21 1 21 0 2 22 1 22 0 2 23 1 23 0 2 24 1 24 0 2 ...
result:
ok ok
Test #25:
score: 0
Accepted
time: 1ms
memory: 4048kb
input:
234654 253129
output:
46 1 3 1 0 1 4 1 1 5 1 2 6 0 33 1 2 7 0 31 1 1 8 1 2 9 0 29 1 1 10 1 2 11 0 28 1 2 12 0 26 1 1 13 1 2 14 0 25 1 2 15 0 20 1 1 16 1 1 17 1 1 18 1 1 19 1 2 2 0 2 1 2 21 1 21 0 2 22 1 22 0 2 23 1 23 0 2 24 1 24 0 2 2 1 2 0 2 20 1 20 0 2 27 1 27 0 2 25 1 25 0 2 26 1 26 0 2 30...
result:
ok ok
Test #26:
score: 0
Accepted
time: 2ms
memory: 5084kb
input:
554090 608599
output:
52 1 3 1 0 1 4 0 1 5 0 2 6 0 37 1 2 7 0 33 1 1 8 1 1 9 1 1 10 1 2 11 0 31 1 1 12 1 2 13 0 30 1 2 14 0 29 1 2 15 0 26 1 1 16 1 1 17 1 2 18 0 24 1 1 19 1 2 20 0 22 1 1 21 1 2 2 0 2 1 2 23 1 23 0 2 2 1 2 0 2 25 1 25 0 2 22 1 22 0 2 27 1 27 0 2 28 1 28 0 2 24 1 24 0 2 26 1 26...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed