QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #723643 | #9519. Build a Computer | RWeakest | AC ✓ | 1ms | 3888kb | C++17 | 7.2kb | 2024-11-07 23:25:00 | 2024-11-07 23:25:00 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 200;
ll L, R, n;
ll num;
struct edge {
int x, y, v;
edge(int X, int Y, int V) {
x = X, y = Y, v = V;
}
};
// 1>R 2L-R 3<L 0,2-end 30,2-st;
int deg[N][5], no[N][5];
vector<edge> a[N][5], st;
void add(int start_x, int start_y, int end_x, int end_y, int value) {
//deg[start_x][start_y]++;
deg[end_x][end_y]++;
a[start_x][start_y].emplace_back(end_x, end_y, value);
}
bool digit(int x, int p) {
return ((x >> (p - 1)) & 1);
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
cin >> L >> R;
int ldig = 1, rdig = 0, lp = 1, rp = 1, resdig = 0, maxdig = 0;
while (lp < L) {
ldig++;
lp = lp << 1;
}
while (rp * 2 - 1 <= R) {
rdig++;
rp = rp << 1;
}
for (int i = 24; i >= 1; i--) {
if (digit(L, i) != digit(R, i)) {
maxdig = i;
break;
}
}
if (ldig - rdig < 2) maxdig = 30;
rp = rp - 1;
//printf("Ldig:%d lp:%d Rdig:%d rp:%d\n", ldig, lp, rdig, rp);
//step0
if (ldig - rdig >= 2) {
if (maxdig >= 1) {
add(maxdig, 2, maxdig - 1, 1, 1);
add(maxdig, 2, maxdig - 1, 3, 0);
}
for (int i = maxdig + 1; i < ldig - 1; i++) {
add(i, 2, i - 1, 2, digit(L, i));
}
add(30, 2, ldig - 2, 2, 1);
}
//step1
if (ldig - rdig < 1) {
for (int i = ldig - 1; i <= rdig - 1; i++)
add(30, 2, i, 2, 1);
for (int i = 1; i <= rdig - 1; i++) {
add(i, 2, i - 1, 2, 0);
add(i, 2, i - 1, 2, 1);
}
}
//step2
if (lp != L) {
if (ldig - rdig < 2)
add(30, 2, ldig - 2, 3, 1);
for (int i = 1; i < min(ldig - 1, maxdig); i++) {
if (digit(L, i)) add(i, 3, i - 1, 3, 1);
else {
resdig = max(resdig, i - 1);
add(i, 3, i - 1, 2, 1);
add(i, 3, i - 1, 3, 0);
}
}
}
//step3
if (rp != R) {
if (ldig - rdig < 2)
add(30, 2, rdig, 1, 1);
for (int i = 1; i <= min(rdig, maxdig - 1); i++) {
if (!digit(R, i)) add(i, 1, i - 1, 1, 0);
else {
resdig = max(resdig, i - 1);
add(i, 1, i - 1, 2, 0);
add(i, 1, i - 1, 1, 1);
}
}
}
//step4
if (ldig > rdig && resdig > 0) {
for (int i = 1; i <= resdig; i++) {
add(i, 2, i - 1, 2, 0);
add(i, 2, i - 1, 2, 1);
}
}
no[30][1] = no[30][2] = no[30][3] = 1;
num = 1;
for (int i = 29; i >= 1; i--) {
for (int j = 1; j <= 3; j++) {
if (deg[i][j] > 0) {
num++;
no[i][j] = num;
}
}
}
num++;
no[0][1] = no[0][2] = no[0][3] = num;
cout << num << "\n";
for (int i = 1; i <= num; i++) {
vector<pair<int, int> > out;
for (int j = 30; j >= 0; j--) {
for (int k = 1; k <= 3; k++) {
if (no[j][k] == i) {
for (auto l: a[j][k]) {
out.emplace_back(no[l.x][l.y], l.v);
}
}
}
}
cout << out.size() << " ";
for (auto j: out) cout << j.first << " " << j.second << " ";
cout << "\n";
}
return 0;
}
/*
#include <bits/stdc++.h>
using namespace std;
const int N = 200;
ll L, R, n;
ll num;
struct edge {
int x, y, v;
edge(int X, int Y, int V) {
x = X, y = Y, v = V;
}
};
// 1>R 2L-R 3<L 0,2-end 30,2-st;
int deg[N][5], no[N][5];
vector<edge> a[N][5], st;
void add(int start_x, int start_y, int end_x, int end_y, int value) {
//deg[start_x][start_y]++;
deg[end_x][end_y]++;
a[start_x][start_y].emplace_back(end_x, end_y, value);
}
bool digit(int x, int p) {
return ((x >> (p - 1)) & 1);
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
cin >> L >> R;
int ldig = 1, rdig = 0, lp = 1, rp = 1, resdig = 0, maxdig = 0;
int llen = 0, rlen = 0, tl = L, tr = R;
while (tl) tl /= 2, llen++;
while (tr) tr /= 2, rlen++;
while (lp < L) {
ldig++;
lp = lp << 1;
}
while (rp * 2 - 1 <= R) {
rdig++;
rp = rp << 1;
}
for (int i = 24; i >= 1; i--) {
if (digit(L, i) != digit(R, i)) {
maxdig = i;
break;
}
}
rp = rp - 1;
printf("Ldig:%d lp:%d Rdig:%d rp:%d\nl_len:%d r_len:%d\n", ldig, lp, rdig, rp, llen, rlen);
//step0
if (llen == rlen) {
if (maxdig >= 1) {
add(maxdig, 2, maxdig - 1, 1, 1);
add(maxdig, 2, maxdig - 1, 3, 0);
}
for (int i = maxdig + 1; i < ldig - 1; i++) {
add(i, 2, i - 1, 2, digit(L, i));
}
add(30, 2, ldig - 2, 2, 1);
}
//step1
if (ldig != rlen) {
for (int i = ldig - 1; i <= rdig - 1; i++)
add(30, 2, i, 2, 1);
for (int i = 1; i <= rdig - 1; i++) {
add(i, 2, i - 1, 2, 0);
add(i, 2, i - 1, 2, 1);
}
}
//step2
if (lp != L) {
if (ldig != rlen)
add(30, 2, ldig - 2, 3, 1);
for (int i = 1; i < min(ldig - 1, maxdig); i++) {
if (digit(L, i)) add(i, 3, i - 1, 3, 1);
else {
resdig = max(resdig, i - 1);
add(i, 3, i - 1, 2, 1);
add(i, 3, i - 1, 3, 0);
}
}
}
//step3
if (rp != R) {
if (ldig - rdig < 2)
add(30, 2, rdig, 1, 1);
for (int i = 1; i <= min(rdig, maxdig - 1); i++) {
if (!digit(R, i)) add(i, 1, i - 1, 1, 0);
else {
resdig = max(resdig, i - 1);
add(i, 1, i - 1, 2, 0);
add(i, 1, i - 1, 1, 1);
}
}
}
//step4
if (ldig > rdig && resdig > 0) {
for (int i = 1; i <= resdig; i++) {
add(i, 2, i - 1, 2, 0);
add(i, 2, i - 1, 2, 1);
}
}
no[30][1] = no[30][2] = no[30][3] = 1;
num = 1;
for (int i = 29; i >= 1; i--) {
for (int j = 1; j <= 3; j++) {
if (deg[i][j] > 0) {
num++;
no[i][j] = num;
}
}
}
num++;
no[0][1] = no[0][2] = no[0][3] = num;
cout << num << "\n";
for (int i = 1; i <= num; i++) {
vector<pair<int, int> > out;
for (int j = 30; j >= 0; j--) {
for (int k = 1; k <= 3; k++) {
if (no[j][k] == i) {
for (auto l: a[j][k]) {
out.emplace_back(no[l.x][l.y], l.v);
}
}
}
}
cout << out.size() << " ";
for (auto j: out) cout << j.first << " " << j.second << " ";
cout << "\n";
}
return 0;
}
*/
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3684kb
input:
5 7
output:
5 1 2 1 2 3 1 4 0 2 5 0 5 1 1 5 1 0
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
10 27
output:
12 2 5 1 2 1 2 4 0 3 1 1 6 0 2 7 0 7 1 2 7 1 8 0 2 10 0 9 1 2 10 0 10 1 1 11 1 2 12 0 12 1 2 12 0 12 1 2 12 1 12 0 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
5 13
output:
9 2 5 1 2 1 2 4 0 3 1 1 6 0 2 7 0 7 1 2 7 1 8 0 2 9 0 9 1 2 9 0 9 1 1 9 1 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
1 1000000
output:
39 20 39 1 38 1 36 1 34 1 32 1 30 1 28 1 26 1 24 1 22 1 20 1 18 1 16 1 14 1 12 1 10 1 8 1 6 1 4 1 2 1 2 4 0 3 1 2 6 0 5 1 2 6 0 6 1 2 8 0 7 1 2 8 0 8 1 1 9 0 2 10 0 10 1 2 12 0 11 1 2 12 0 12 1 1 13 0 2 14 0 14 1 1 15 0 2 16 0 16 1 1 17 0 2 18 0 18 1 1 19 0 2 20 0 20 1 2 22 0 21 1 ...
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 1
output:
2 1 2 1 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
7 9
output:
7 2 4 1 2 1 1 3 0 1 5 0 1 6 1 2 7 0 7 1 1 7 1 0
result:
ok ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
3 7
output:
5 2 2 1 4 1 2 3 0 3 1 2 5 0 5 1 1 5 1 0
result:
ok ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 5
output:
5 3 5 1 4 1 2 1 1 3 0 2 5 0 5 1 2 5 0 5 1 0
result:
ok ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1 4
output:
5 3 5 1 4 1 2 1 1 3 0 1 5 0 2 5 0 5 1 0
result:
ok ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
8 9
output:
5 1 2 1 1 3 0 1 4 0 2 5 0 5 1 0
result:
ok ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
7 51
output:
13 4 6 1 4 1 9 1 2 1 2 4 0 3 1 1 5 0 2 6 0 6 1 1 7 0 2 8 0 8 1 2 11 0 10 1 2 11 0 11 1 1 12 1 2 13 0 13 1 2 13 0 13 1 1 13 1 0
result:
ok ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
51 79
output:
16 2 4 1 2 1 1 3 0 1 5 0 1 6 1 2 8 0 7 1 2 8 1 9 0 2 11 0 10 1 2 11 0 11 1 2 11 1 12 0 2 14 0 13 1 2 14 0 14 1 1 15 1 2 16 0 16 1 2 16 0 16 1 1 16 1 0
result:
ok ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
92 99
output:
14 1 2 1 2 3 1 4 0 1 5 0 1 6 1 1 7 0 1 8 1 1 9 0 1 10 1 2 12 0 11 1 2 12 1 13 0 2 14 0 14 1 2 14 0 14 1 2 14 1 14 0 0
result:
ok ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
27 36
output:
13 2 4 1 2 1 1 3 0 1 5 0 1 6 1 2 8 0 7 1 2 8 1 9 0 1 10 0 2 11 0 11 1 1 12 1 1 13 0 2 13 0 13 1 1 13 1 0
result:
ok ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
55 84
output:
17 2 4 1 2 1 1 3 0 2 6 0 5 1 1 7 1 1 8 0 2 9 0 9 1 2 9 1 10 0 2 12 0 11 1 2 12 0 12 1 1 13 1 1 14 0 2 15 0 15 1 1 16 1 1 17 0 2 17 0 17 1 1 17 1 0
result:
ok ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
297208 929600
output:
57 2 5 1 2 1 2 4 0 3 1 2 7 0 6 1 2 7 0 7 1 2 7 1 8 0 1 9 0 2 10 0 10 1 2 10 1 11 0 1 12 0 2 13 0 13 1 1 14 1 1 15 0 2 16 0 16 1 2 16 1 17 0 2 19 0 18 1 2 19 0 19 1 2 19 1 20 0 1 21 0 2 22 0 22 1 2 22 1 23 0 2 25 0 24 1 2 25 0 25 1 1 26 1 2 28 0 27 1 2 28 0 28 1 2 28 1 29 0 ...
result:
ok ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
45728 589156
output:
54 5 8 1 6 1 4 1 11 1 2 1 1 3 0 1 5 0 2 6 0 6 1 1 7 0 2 8 0 8 1 2 10 0 9 1 2 10 0 10 1 2 13 0 12 1 2 13 0 13 1 2 13 1 14 0 2 16 0 15 1 2 16 0 16 1 1 17 1 2 19 0 18 1 2 19 0 19 1 1 20 1 2 22 0 21 1 2 22 0 22 1 2 22 1 23 0 2 25 0 24 1 2 25 0 25 1 2 25 1 26 0 1 27 0 2 28 0 28 1 ...
result:
ok ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
129152 138000
output:
47 2 4 1 2 1 1 3 0 1 5 0 1 6 1 1 7 0 1 8 1 1 9 0 1 10 1 2 12 0 11 1 1 13 1 2 15 0 14 1 2 15 0 15 1 1 16 1 1 17 0 2 18 0 18 1 2 18 1 19 0 2 21 0 20 1 2 21 0 21 1 2 21 1 22 0 2 24 0 23 1 2 24 0 24 1 2 24 1 25 0 1 26 0 2 27 0 27 1 1 28 1 1 29 0 2 30 0 30 1 2 30 1 31 0 1 32 0...
result:
ok ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
245280 654141
output:
56 3 4 1 7 1 2 1 1 3 0 1 5 0 2 6 0 6 1 2 9 0 8 1 2 9 0 9 1 1 10 1 2 12 0 11 1 2 12 0 12 1 1 13 1 2 15 0 14 1 2 15 0 15 1 2 15 1 16 0 2 18 0 17 1 2 18 0 18 1 1 19 1 2 21 0 20 1 2 21 0 21 1 1 22 1 2 24 0 23 1 2 24 0 24 1 1 25 1 1 26 0 2 27 0 27 1 1 28 1 2 30 0 29 1 2 30 0 30 ...
result:
ok ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
202985 296000
output:
52 2 4 1 2 1 1 3 0 1 5 0 1 6 1 2 8 0 7 1 2 8 1 9 0 1 10 0 2 11 0 11 1 2 11 1 12 0 1 13 0 2 14 0 14 1 2 14 1 15 0 1 16 0 2 17 0 17 1 1 18 1 1 19 0 2 20 0 20 1 1 21 1 2 23 0 22 1 2 23 0 23 1 2 23 1 24 0 1 25 0 2 26 0 26 1 2 26 1 27 0 1 28 0 2 29 0 29 1 2 29 1 30 0 1 31 0 2 ...
result:
ok ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
438671 951305
output:
57 2 5 1 2 1 2 4 0 3 1 2 7 0 6 1 2 7 0 7 1 1 8 1 1 9 0 2 10 0 10 1 2 10 1 11 0 2 13 0 12 1 2 13 0 13 1 1 14 1 1 15 0 2 16 0 16 1 2 16 1 17 0 1 18 0 2 19 0 19 1 1 20 1 1 21 0 2 22 0 22 1 1 23 1 1 24 0 2 25 0 25 1 2 25 1 26 0 2 28 0 27 1 2 28 0 28 1 2 28 1 29 0 1 30 0 2 31 0...
result:
ok ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
425249 739633
output:
56 2 4 1 2 1 1 3 0 2 6 0 5 1 1 7 1 2 9 0 8 1 2 9 0 9 1 2 9 1 10 0 1 11 0 2 12 0 12 1 2 12 1 13 0 2 15 0 14 1 2 15 0 15 1 1 16 1 1 17 0 2 18 0 18 1 1 19 1 1 20 0 2 21 0 21 1 1 22 1 2 24 0 23 1 2 24 0 24 1 1 25 1 1 26 0 2 27 0 27 1 1 28 1 1 29 0 2 30 0 30 1 2 30 1 31 0 2 33...
result:
ok ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
551207 961718
output:
56 1 2 1 2 3 1 4 0 2 6 0 5 1 2 6 1 7 0 1 8 0 2 9 0 9 1 2 9 1 10 0 2 12 0 11 1 2 12 0 12 1 2 12 1 13 0 1 14 0 2 15 0 15 1 1 16 1 2 18 0 17 1 2 18 0 18 1 1 19 1 1 20 0 2 21 0 21 1 2 21 1 22 0 2 24 0 23 1 2 24 0 24 1 1 25 1 2 27 0 26 1 2 27 0 27 1 2 27 1 28 0 1 29 0 2 30 0 30 ...
result:
ok ok
Test #24:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
114691 598186
output:
55 4 6 1 4 1 9 1 2 1 1 3 0 1 5 0 2 6 0 6 1 2 8 0 7 1 2 8 0 8 1 1 10 0 2 11 0 11 1 1 12 1 1 13 0 2 14 0 14 1 1 15 1 2 17 0 16 1 2 17 0 17 1 2 17 1 18 0 1 19 0 2 20 0 20 1 2 20 1 21 0 1 22 0 2 23 0 23 1 2 23 1 24 0 1 25 0 2 26 0 26 1 2 26 1 27 0 1 28 0 2 29 0 29 1 2 29 1 30 0...
result:
ok ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
234654 253129
output:
46 1 2 1 1 3 1 1 4 1 2 5 1 6 0 1 7 0 2 8 1 9 0 2 11 0 10 1 2 11 0 11 1 1 12 1 2 14 0 13 1 2 14 0 14 1 2 14 1 15 0 2 17 0 16 1 2 17 0 17 1 1 18 1 1 19 0 2 20 0 20 1 2 20 1 21 0 1 22 0 2 23 0 23 1 2 23 1 24 0 2 26 0 25 1 2 26 0 26 1 1 27 1 2 29 0 28 1 2 29 0 29 1 2 29 1 30 0 ...
result:
ok ok
Test #26:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
554090 608599
output:
52 1 2 1 1 3 0 1 4 0 2 5 1 6 0 1 7 0 2 8 1 9 0 2 11 0 10 1 2 11 0 11 1 1 12 1 1 13 0 2 14 0 14 1 1 15 1 1 16 0 2 17 0 17 1 1 18 1 2 20 0 19 1 2 20 0 20 1 2 20 1 21 0 1 22 0 2 23 0 23 1 1 24 1 1 25 0 2 26 0 26 1 2 26 1 27 0 2 29 0 28 1 2 29 0 29 1 2 29 1 30 0 1 31 0 2 32 0...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed