QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#733438#9519. Build a ComputerwinsunAC ✓0ms3900kbC++142.0kb2024-11-10 18:58:292024-11-10 18:58:31

Judging History

This is the latest submission verdict.

  • [2024-11-10 18:58:31]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3900kb
  • [2024-11-10 18:58:29]
  • Submitted

answer

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <utility>
#define fi first
#define se second

using namespace std;
typedef long long LL;

template <typename Tp> inline void read(Tp& x) {
    char ch; bool op = 0; x = 0;
    do ch = getchar(), op |= ch == '-'; while (ch < '0' || ch > '9');
    do x = (x<<3)+(x<<1)+(ch&15), ch = getchar(); while (ch >= '0' && ch <= '9');
    if (op) x = -x;
}

bool Mst;
vector<pair<int, int>> graph[105];
int cnt;
void add(int x, int y, int z) {
    graph[x].emplace_back(y, z);
}

struct Node {
    int l, r, d;
    Node(int a, int b, int c): l(a), r(b), d(c) {}
    bool operator<(const Node& x) const {
        if (l != x.l) return l < x.l;
        if (r != x.r) return r < x.r;
        return d < x.d;
    }
};

map<Node, int> mp;

int solve(int l, int r, int d) {
    // return current node.
    Node nd(l, r, d);
    if (mp.count(nd)) return mp[nd];
    int cur = ++cnt;
    int lx = l >> d & 1, rx = r >> d & 1;
    int msk = (1 << d) - 1;
    if (!lx && rx) {
        add(cur, solve(l, msk, d-1), 0);
        add(cur, solve(0, r&msk, d-1), 1);
    } else {
        add(cur, solve(l&msk, r&msk, d-1), lx);
    }
    return mp[nd] = cur;
}

bool Med;

int main() {
    #ifndef ONLINE_JUDGE
    freopen("qoj9519.in", "r", stdin);
    freopen("qoj9519.out", "w", stdout);
    fprintf(stderr, "%.3lfMB\n", (&Mst - &Med) / 1048576.0);
    #endif
    int st = 1;
    mp[Node(0, 0, -1)] = 2;
    cnt = 2;
    int L, R; read(L), read(R);
    for (int d = 0; d <= 20; ++d) {
        int msk = (1<<d)-1;
        int l = max(1<<d, L), r = min((1<<(d+1))-1, R);
        if (l > r) continue;
        add(st, solve(l&msk, r&msk, d-1), 1);
    }
    printf("%d\n", cnt);
    for (int i = 1; i <= cnt; ++i) {
        printf("%lld ", graph[i].size());
        for (auto x : graph[i]) printf("%d %d ", x.fi, x.se);
        puts("");
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3760kb

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: 3848kb

input:

10 27

output:

9
2 3 1 7 1 
0 
2 4 0 6 1 
1 5 1 
2 2 0 2 1 
2 5 0 5 1 
2 8 0 9 1 
2 6 0 6 1 
1 6 0 

result:

ok ok

Test #3:

score: 0
Accepted
time: 0ms
memory: 3764kb

input:

5 13

output:

8
2 3 1 6 1 
0 
2 4 0 5 1 
1 2 1 
2 2 0 2 1 
2 7 0 8 1 
2 5 0 5 1 
1 5 0 

result:

ok ok

Test #4:

score: 0
Accepted
time: 0ms
memory: 3784kb

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 0 2 1 
2 3 0 3 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...

result:

ok ok

Test #5:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

1 1

output:

2
1 2 1 
0 

result:

ok ok

Test #6:

score: 0
Accepted
time: 0ms
memory: 3768kb

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: 3824kb

input:

3 7

output:

5
2 3 1 4 1 
0 
1 2 1 
2 5 0 5 1 
2 2 0 2 1 

result:

ok ok

Test #8:

score: 0
Accepted
time: 0ms
memory: 3832kb

input:

1 5

output:

4
3 2 1 3 1 4 1 
0 
2 2 0 2 1 
1 3 0 

result:

ok ok

Test #9:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

1 4

output:

5
3 2 1 3 1 4 1 
0 
2 2 0 2 1 
1 5 0 
1 2 0 

result:

ok ok

Test #10:

score: 0
Accepted
time: 0ms
memory: 3772kb

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: 3784kb

input:

7 51

output:

11
4 3 1 5 1 8 1 9 1 
0 
1 4 1 
1 2 1 
2 6 0 6 1 
2 7 0 7 1 
2 2 0 2 1 
2 5 0 5 1 
2 8 0 10 1 
1 11 0 
1 6 0 

result:

ok ok

Test #12:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

51 79

output:

13
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 0 9 1 
2 2 0 2 1 
2 8 0 8 1 
1 12 0 
1 13 0 
2 10 0 10 1 

result:

ok ok

Test #13:

score: 0
Accepted
time: 0ms
memory: 3772kb

input:

92 99

output:

11
1 3 1 
0 
2 4 0 9 1 
1 5 1 
1 6 1 
1 7 1 
2 8 0 8 1 
2 2 0 2 1 
1 10 0 
1 11 0 
1 7 0 

result:

ok ok

Test #14:

score: 0
Accepted
time: 0ms
memory: 3844kb

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 0 8 1 
2 2 0 2 1 
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: 3768kb

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 0 9 1 
2 10 0 10 1 
2 2 0 2 1 
1 12 0 
2 13 0 14 1 
2 8 0 8 1 
1 15 0 
2 9 0 16 1 
1 17 0 
1 2 0 

result:

ok ok

Test #16:

score: 0
Accepted
time: 0ms
memory: 3900kb

input:

297208 929600

output:

54
2 3 1 35 1 
0 
2 4 0 34 1 
2 5 0 32 1 
1 6 1 
2 7 0 31 1 
2 8 0 30 1 
2 9 0 28 1 
1 10 1 
2 11 0 27 1 
2 12 0 26 1 
2 13 0 21 1 
1 14 1 
1 15 1 
1 16 1 
1 17 1 
1 18 1 
2 19 0 19 1 
2 20 0 20 1 
2 2 0 2 1 
2 22 0 22 1 
2 23 0 23 1 
2 24 0 24 1 
2 25 0 25 1 
2 18 0 18 1 
2 21 0 21 1 
2 26 0 26 1 
...

result:

ok ok

Test #17:

score: 0
Accepted
time: 0ms
memory: 3856kb

input:

45728 589156

output:

49
5 3 1 27 1 29 1 30 1 31 1 
0 
2 4 0 24 1 
1 5 1 
1 6 1 
2 7 0 23 1 
2 8 0 21 1 
1 9 1 
2 10 0 19 1 
1 11 1 
2 12 0 18 1 
1 13 1 
2 14 0 14 1 
2 15 0 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 2 0 2 1 
2 13 0 13 1 
2 20 0 20 1 
2 18 0 18 1 
2 22 0 22 1 
2 19 0 19 1 
2 21 0 21 1 
2 25 0 25 1 
2 26 0 26 1 
2...

result:

ok ok

Test #18:

score: 0
Accepted
time: 0ms
memory: 3812kb

input:

129152 138000

output:

40
2 3 1 22 1 
0 
1 4 1 
1 5 1 
1 6 1 
1 7 1 
1 8 1 
2 9 0 21 1 
2 10 0 20 1 
2 11 0 19 1 
1 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 2 0 2 1 
2 12 0 12 1 
2 19 0 19 1 
2 20 0 20 1 
1 23 0 
1 24 0 
1 25 0 
1 26 0 
2 27 0 29 1 
2 28 0 28 1 
2 21 0 21 1 
2 ...

result:

ok ok

Test #19:

score: 0
Accepted
time: 0ms
memory: 3792kb

input:

245280 654141

output:

50
3 3 1 29 1 33 1 
0 
1 4 1 
1 5 1 
2 6 0 23 1 
1 7 1 
1 8 1 
1 9 1 
1 10 1 
1 11 1 
2 12 0 22 1 
2 13 0 21 1 
2 14 0 20 1 
1 15 1 
2 16 0 16 1 
2 17 0 17 1 
2 18 0 18 1 
2 19 0 19 1 
2 2 0 2 1 
2 15 0 15 1 
2 20 0 20 1 
2 21 0 21 1 
2 24 0 24 1 
2 25 0 25 1 
2 26 0 26 1 
2 27 0 27 1 
2 28 0 28 1 
...

result:

ok ok

Test #20:

score: 0
Accepted
time: 0ms
memory: 3828kb

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 0 2 1 
2 20 0 20 1 
2 23 0 23 1 
2 21 0 21 1 
2 25 0 25 1 
2 26 0 26 1 
2 27 0 27 1 
2 22 0 22 1 
2 24 0...

result:

ok ok

Test #21:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

438671 951305

output:

56
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 0 22 1 
2 23 0 23 1 
2 24 0 24 1 
2 2 0 2 1 
2 21 0 21 1 
2 25 0 25 1 
2 28 0 28 1 
2 29 0 29 1 
2 2...

result:

ok ok

Test #22:

score: 0
Accepted
time: 0ms
memory: 3768kb

input:

425249 739633

output:

55
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 0 2 1 
2 21 0 21 1 
2 22 0 22 1 
2 23 0 23 1 
2 26 0 26 1 
2 24 0 24 1 
2 25 0 25 1 
2 29 0 29 1...

result:

ok ok

Test #23:

score: 0
Accepted
time: 0ms
memory: 3888kb

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 0 23 1 
2 24 0 24 1 
2 2 0 2 1 
2 22 0 22 1 
2 27 0 27 1 
2 25 0 25 1 
2 26 0 26 1...

result:

ok ok

Test #24:

score: 0
Accepted
time: 0ms
memory: 3764kb

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 0 20 1 
2 2 0 2 1 
2 19 0 19 1 
2 21 0 21 1 
2 22 0 22 1 
2 23 0 23 1 
2 24 0 24 1 
2 ...

result:

ok ok

Test #25:

score: 0
Accepted
time: 0ms
memory: 3768kb

input:

234654 253129

output:

44
1 3 1 
0 
1 4 1 
1 5 1 
2 6 0 32 1 
2 7 0 30 1 
1 8 1 
2 9 0 28 1 
1 10 1 
2 11 0 27 1 
2 12 0 25 1 
1 13 1 
2 14 0 24 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 0 21 1 
2 22 0 22 1 
2 23 0 23 1 
2 19 0 19 1 
2 20 0 20 1 
2 26 0 26 1 
2 24 0 24 1 
2 25 0 25 1 
2 29 0 29 1 
2 ...

result:

ok ok

Test #26:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

554090 608599

output:

48
1 3 1 
0 
1 4 0 
1 5 0 
2 6 0 36 1 
2 7 0 32 1 
1 8 1 
1 9 1 
1 10 1 
2 11 0 30 1 
1 12 1 
2 13 0 29 1 
2 14 0 28 1 
2 15 0 25 1 
1 16 1 
1 17 1 
2 18 0 23 1 
1 19 1 
2 20 0 22 1 
1 21 1 
2 2 0 2 1 
2 21 0 21 1 
2 24 0 24 1 
2 22 0 22 1 
2 26 0 26 1 
2 27 0 27 1 
2 23 0 23 1 
2 25 0 25 1 
2 28 0 ...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed