QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #717651 | #9519. Build a Computer | ljljljlj | AC ✓ | 2ms | 3720kb | C++20 | 3.3kb | 2024-11-06 18:36:18 | 2024-11-06 18:36:21 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
#define int long long
using i64 = long long;
typedef pair<int, int> pii;
vector<pii> ans[1001000];
map<pii, int> mp[35];
int cnt = 1;
vector<pii> ceng[60];
void solve()
{
int l, r;
cin >> l >> r;
for (int i = 21; i >= 0; i--)
{
while (l <= r && r >= (1 << i))
{
if (r >= (1 << i) && l < (1 << i))
{
mp[i][{0, r % (1 << i)}] = ++cnt;
r -= r % (1 << i) + 1;
ans[1].push_back({cnt, 1});
}
else if (r >= (1 << i) && l >= (1 << i))
{
mp[i][{(l % (1 << i)), (r % (1 << i))}] = ++cnt;
r = 0;
ans[1].push_back({cnt, 1});
}
}
}
for (int i = 21; i; i--)
{
for (auto [key, val] : mp[i])
{
i64 hi = (1LL << (i - 1));
auto [L, R] = key;
// cout << L << "-" << R << " " << i << endl;
if (R < hi)
{
if (mp[i - 1].count(make_pair(L, R)))
{
ans[val].push_back({mp[i - 1][make_pair(L, R)], 0});
continue;
}
else
{
mp[i - 1][make_pair(L, R)] = ++cnt;
ans[val].push_back({mp[i - 1][make_pair(L, R)], 0});
}
}
else if (L >= hi)
{
if (mp[i - 1].count(make_pair(L - hi, R - hi)))
{
ans[val].push_back({mp[i - 1][make_pair(L - hi, R - hi)], 1});
continue;
}
else
{
mp[i - 1][make_pair(L - hi, R - hi)] = ++cnt;
ans[val].push_back({mp[i - 1][make_pair(L - hi, R - hi)], 1});
}
}
else
{
if (mp[i - 1].count(make_pair(L, hi - 1)))
{
ans[val].push_back({mp[i - 1][make_pair(L, hi - 1)], 0});
}
else
{
mp[i - 1][make_pair(L, hi - 1)] = ++cnt;
ans[val].push_back({mp[i - 1][make_pair(L, hi - 1)], 0});
}
if (mp[i - 1].count(make_pair(0, R - hi)))
{
ans[val].push_back({mp[i - 1][make_pair(0, R - hi)], 1});
}
else
{
mp[i - 1][make_pair(0, R - hi)] = ++cnt;
ans[val].push_back({mp[i - 1][make_pair(0, R - hi)], 1});
}
}
}
}
for (int i = 31; i; i--)
{
for (auto [x, y] : mp[i])
{
// cout << y << '*' << x.first << ' ' << x.second << endl;
}
}
cout << cnt << endl;
for (int i = 1; i <= cnt; i++)
{
cout << ans[i].size() << ' ';
for (auto x : ans[i])
{
cout << x.first << " " << x.second << ' ';
}
cout << "\n";
}
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(0);
int T = 1;
// cin >> T;
while (T--)
solve();
return 0;
}
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3648kb
input:
5 7
output:
5 1 2 1 2 3 0 4 1 1 5 1 2 5 0 5 1 0
result:
ok ok
Test #2:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
10 27
output:
9 2 2 1 3 1 2 4 0 5 1 2 7 0 6 1 2 6 0 6 1 1 6 0 2 8 0 8 1 1 8 1 2 9 0 9 1 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3716kb
input:
5 13
output:
8 2 2 1 3 1 2 4 0 5 1 2 7 0 6 1 2 6 0 6 1 1 6 0 2 8 0 8 1 1 8 1 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 2ms
memory: 3560kb
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 2 3 0 22 1 2 4 0 4 1 2 5 0 5 1 2 6 0 6 1 2 7 0 7 1 2 8 0 8 1 2 9 0 9 1 2 10 0 10 1 2 11 0 11 1 2 12 0 12 1 2 13 0 13 1 2 14 0 14 1 2 15 0 15 1 2 16 0 16 1 2 17 0 17 1 2 18 0 18 1 2 19 0...
result:
ok ok
Test #5:
score: 0
Accepted
time: 2ms
memory: 3688kb
input:
1 1
output:
2 1 2 1 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 2ms
memory: 3568kb
input:
7 9
output:
7 2 2 1 3 1 1 4 0 1 6 1 1 5 0 2 7 0 7 1 1 7 1 0
result:
ok ok
Test #7:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
3 7
output:
5 2 2 1 3 1 2 4 0 4 1 1 5 1 2 5 0 5 1 0
result:
ok ok
Test #8:
score: 0
Accepted
time: 2ms
memory: 3652kb
input:
1 5
output:
4 3 2 1 3 1 4 1 1 3 0 2 4 0 4 1 0
result:
ok ok
Test #9:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
1 4
output:
5 3 2 1 3 1 4 1 1 5 0 2 4 0 4 1 0 1 4 0
result:
ok ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3564kb
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: 2ms
memory: 3564kb
input:
7 51
output:
11 4 2 1 3 1 4 1 5 1 2 3 0 6 1 2 4 0 4 1 2 8 0 8 1 1 10 1 1 7 0 1 8 0 2 9 0 9 1 2 11 0 11 1 1 11 1 0
result:
ok ok
Test #12:
score: 0
Accepted
time: 2ms
memory: 3588kb
input:
51 79
output:
13 2 2 1 3 1 1 4 0 1 6 1 1 5 0 2 7 0 7 1 2 8 0 7 1 2 9 0 9 1 2 10 0 9 1 2 11 0 11 1 1 12 1 2 13 0 13 1 1 13 1 0
result:
ok ok
Test #13:
score: 0
Accepted
time: 2ms
memory: 3688kb
input:
92 99
output:
11 1 2 1 2 3 0 4 1 1 6 1 1 5 0 1 7 0 1 8 1 1 9 0 1 9 1 2 10 0 10 1 2 11 0 11 1 0
result:
ok ok
Test #14:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
27 36
output:
13 2 2 1 3 1 1 4 0 1 6 1 1 5 0 2 7 0 8 1 2 9 0 7 1 2 11 0 11 1 1 10 0 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: 3616kb
input:
55 84
output:
17 2 2 1 3 1 1 4 0 1 7 1 2 5 0 6 1 2 9 0 9 1 1 8 0 2 10 0 9 1 2 11 0 12 1 2 11 0 11 1 1 13 1 2 15 0 15 1 1 14 0 1 16 1 1 17 0 2 17 0 17 1 1 17 1 0
result:
ok ok
Test #16:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
297208 929600
output:
54 2 2 1 3 1 2 4 0 5 1 2 8 0 6 1 2 6 0 6 1 2 6 0 7 1 2 10 0 10 1 1 9 0 2 11 0 10 1 1 12 0 2 13 0 13 1 1 14 1 1 15 0 2 16 0 16 1 2 17 0 16 1 2 18 0 19 1 2 18 0 18 1 2 20 0 18 1 2 22 0 22 1 1 21 0 2 23 0 22 1 2 24 0 25 1 2 24 0 24 1 1 26 1 2 27 0 27 1 2 27 0 28 1 2 29 0 27 1 ...
result:
ok ok
Test #17:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
45728 589156
output:
49 5 2 1 3 1 4 1 5 1 6 1 1 7 0 2 4 0 4 1 2 5 0 5 1 2 10 0 10 1 2 14 0 12 1 1 8 0 1 9 0 2 10 0 11 1 2 12 0 12 1 2 12 0 13 1 2 15 0 15 1 2 15 0 16 1 1 17 1 2 18 0 18 1 2 18 0 19 1 1 20 1 2 21 0 21 1 2 21 0 22 1 2 23 0 21 1 2 24 0 24 1 2 24 0 25 1 2 26 0 24 1 2 28 0 28 1 1 27 0 ...
result:
ok ok
Test #18:
score: 0
Accepted
time: 2ms
memory: 3576kb
input:
129152 138000
output:
40 2 2 1 3 1 1 4 0 1 6 1 1 5 0 1 7 0 1 8 1 1 9 0 1 10 1 2 11 0 12 1 1 13 1 2 14 0 14 1 2 14 0 15 1 1 16 1 2 18 0 18 1 1 17 0 2 19 0 18 1 2 20 0 21 1 2 20 0 20 1 2 22 0 20 1 2 23 0 23 1 2 23 0 24 1 2 25 0 23 1 2 27 0 27 1 1 26 0 1 27 1 1 28 0 2 29 0 29 1 1 30 0 2 31 0 31 1...
result:
ok ok
Test #19:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
245280 654141
output:
50 3 2 1 3 1 4 1 1 5 0 2 7 0 7 1 1 10 1 1 6 0 2 8 0 9 1 2 8 0 8 1 2 11 0 11 1 2 11 0 12 1 1 13 1 2 14 0 14 1 2 14 0 15 1 2 16 0 14 1 2 17 0 17 1 2 17 0 18 1 1 19 1 2 20 0 20 1 2 20 0 21 1 1 22 1 2 23 0 23 1 2 23 0 24 1 1 25 1 2 27 0 27 1 1 26 0 1 28 1 2 29 0 30 1 2 29 0 29 ...
result:
ok ok
Test #20:
score: 0
Accepted
time: 2ms
memory: 3656kb
input:
202985 296000
output:
52 2 2 1 3 1 1 4 0 1 6 1 1 5 0 2 7 0 8 1 2 9 0 7 1 2 11 0 11 1 1 10 0 2 12 0 11 1 1 13 0 2 14 0 14 1 2 15 0 14 1 1 16 0 2 17 0 17 1 1 18 1 1 19 0 2 20 0 20 1 1 21 1 2 22 0 23 1 2 22 0 22 1 2 24 0 22 1 2 26 0 26 1 1 25 0 2 27 0 26 1 1 28 0 2 29 0 29 1 2 30 0 29 1 1 31 0 2 ...
result:
ok ok
Test #21:
score: 0
Accepted
time: 2ms
memory: 3720kb
input:
438671 951305
output:
56 2 2 1 3 1 2 4 0 5 1 1 8 1 2 6 0 6 1 2 6 0 7 1 2 10 0 10 1 1 9 0 2 11 0 10 1 2 12 0 13 1 2 12 0 12 1 1 14 1 2 16 0 16 1 1 15 0 2 17 0 16 1 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 26 0 25 1 2 27 0 28 1 2 27 0 27 1 2 29 0 27 1 2 31 0 31 1 1...
result:
ok ok
Test #22:
score: 0
Accepted
time: 2ms
memory: 3564kb
input:
425249 739633
output:
55 2 2 1 3 1 1 4 0 1 7 1 2 5 0 6 1 2 8 0 8 1 2 8 0 9 1 2 10 0 8 1 2 12 0 12 1 1 11 0 2 13 0 12 1 2 14 0 15 1 2 14 0 14 1 1 16 1 2 18 0 18 1 1 17 0 1 19 1 1 20 0 2 21 0 21 1 1 22 1 2 23 0 24 1 2 23 0 23 1 1 25 1 2 27 0 27 1 1 26 0 1 28 1 1 29 0 2 30 0 30 1 2 31 0 30 1 2 32...
result:
ok ok
Test #23:
score: 0
Accepted
time: 2ms
memory: 3592kb
input:
551207 961718
output:
56 1 2 1 2 3 0 4 1 2 7 0 5 1 2 5 0 6 1 2 9 0 9 1 1 8 0 2 10 0 9 1 2 11 0 12 1 2 11 0 11 1 2 13 0 11 1 2 15 0 15 1 1 14 0 1 16 1 2 17 0 18 1 2 17 0 17 1 1 19 1 2 21 0 21 1 1 20 0 2 22 0 21 1 2 23 0 24 1 2 23 0 23 1 1 25 1 2 26 0 26 1 2 26 0 27 1 2 28 0 26 1 2 30 0 30 1 1 29 ...
result:
ok ok
Test #24:
score: 0
Accepted
time: 2ms
memory: 3696kb
input:
114691 598186
output:
55 4 2 1 3 1 4 1 5 1 1 6 0 2 4 0 4 1 2 8 0 8 1 1 12 1 1 7 0 2 8 0 9 1 2 11 0 11 1 1 10 0 1 13 0 2 14 0 14 1 1 15 1 2 16 0 17 1 2 16 0 16 1 2 18 0 16 1 2 20 0 20 1 1 19 0 2 21 0 20 1 1 22 0 2 23 0 23 1 2 24 0 23 1 1 25 0 2 26 0 26 1 2 27 0 26 1 1 28 0 2 29 0 29 1 2 30 0 29 1...
result:
ok ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
234654 253129
output:
44 1 2 1 1 3 1 1 4 1 2 5 0 6 1 2 8 0 9 1 1 7 0 2 10 0 11 1 1 12 1 2 10 0 10 1 2 13 0 13 1 2 13 0 14 1 2 15 0 13 1 2 16 0 16 1 2 16 0 17 1 1 18 1 2 20 0 20 1 1 19 0 2 21 0 20 1 1 22 0 2 23 0 23 1 2 24 0 23 1 2 25 0 26 1 2 25 0 25 1 1 27 1 2 28 0 28 1 2 28 0 29 1 2 30 0 28 1 ...
result:
ok ok
Test #26:
score: 0
Accepted
time: 2ms
memory: 3596kb
input:
554090 608599
output:
48 1 2 1 1 3 0 1 4 0 2 5 0 6 1 2 8 0 9 1 1 7 0 2 10 0 11 1 1 12 1 2 10 0 10 1 2 14 0 14 1 1 13 0 1 15 1 1 16 0 2 17 0 17 1 1 18 1 2 19 0 20 1 2 19 0 19 1 2 21 0 19 1 2 23 0 23 1 1 22 0 1 24 1 1 25 0 2 26 0 26 1 2 27 0 26 1 2 28 0 29 1 2 28 0 28 1 2 30 0 28 1 2 32 0 32 1 1...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed