QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#521053#8726. Magic ShowMisty70 0ms0kbC++14806b2024-08-15 20:30:562024-08-15 20:30:57

Judging History

你现在查看的是最新测评结果

  • [2024-08-15 20:30:57]
  • 评测
  • 测评结果：0
  • 用时：0ms
  • 内存：0kb
查看
  • [2024-08-15 20:30:56]
  • 提交

Alice

#include <bits/stdc++.h>
#include "Alice.h"

using i64 = long long;

constexpr int N = 5000;

std::vector<std::pair<int, int>> Alice () {
    i64 n = setN(N);
    std::vector<std::pair<int, int>> edges;
    for (int i = 1; i < N; i++) {
        edges.emplace_back(n % i + 1, i + 1);
    }
    return edges;
}
Source code, Language: C++14

Bob

#include <bits/stdc++.h>
#include "Bob.h"

using i64 = long long;

constexpr i64 limit = 1E15;

i64 lcm (i64 a, i64 b) {
    return a / std::__gcd(a, b) * b;
}

i64 Bob (std::vector<std::pair<int, int>> edges) {
    i64 ans = 0, per = 0;
    for (auto [x, y] : edges) {
        x--, y--;
        while (ans % x != y) {
            ans += per;
        }
        per = lcm(per, y);
        if (per >= limit) {
            break;
        }
    }
    return ans;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Time Limit Exceeded

Test #1:

score: 0
Time Limit Exceeded

input:

1
4005

output:

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

input:

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

output:

2
5000 4093
1 2
1 6
1 10
1 16
1 46
1 268
1 446
1 802
1 1336
1 4006
2 3
2 5
2 8
2 12
2 15
2 23
2 27
2 29
2 78
2 92
2 144
2 155
2 183
2 309
2 365
2 573
2 1002
2 4005
3 4004
4 7
4 24
4 59
4 70
4 88
4 139
4 175
4 1335
4 4003
5 4002
6 9
6 11
6 17
6 33
6 41
6 81
6 101
6 126
6 201
6 251
6 401
6 501
6 801
6...

input:

2
5000 4093
1 2
1 6
1 10
1 16
1 46
1 268
1 446
1 802
1 1336
1 4006
2 3
2 5
2 8
2 12
2 15
2 23
2 27
2 29
2 78
2 92
2 144
2 155
2 183
2 309
2 365
2 573
2 1002
2 4005
3 4004
4 7
4 24
4 59
4 70
4 88
4 139
4 175
4 1335
4 4003
5 4002
6 9
6 11
6 17
6 33
6 41
6 81
6 101
6 126
6 201
6 251
6 401
6 501
6 801
6...

output:

Subtask #2:

score: 0
Time Limit Exceeded

Test #13:

score: 0
Time Limit Exceeded

input:

1
17476204

output:

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

input:

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

output:

2
5000 4109
1 5
1 18
1 35
2 4
2 108
2 322
4 1188
5 6
5 7
5 8
5 9
5 10
5 11
5 13
5 16
5 20
5 21
5 22
5 25
5 26
5 29
5 31
5 36
5 39
5 41
5 43
5 46
5 57
5 58
5 61
5 64
5 71
5 73
5 74
5 76
5 77
5 85
5 96
5 101
5 115
5 121
5 127
5 134
5 141
5 147
5 151
5 153
5 169
5 172
5 181
5 191
5 201
5 211
5 220
5 22...

input:

2
5000 4109
1 5
1 18
1 35
2 4
2 108
2 322
4 1188
5 6
5 7
5 8
5 9
5 10
5 11
5 13
5 16
5 20
5 21
5 22
5 25
5 26
5 29
5 31
5 36
5 39
5 41
5 43
5 46
5 57
5 58
5 61
5 64
5 71
5 73
5 74
5 76
5 77
5 85
5 96
5 101
5 115
5 121
5 127
5 134
5 141
5 147
5 151
5 153
5 169
5 172
5 181
5 191
5 201
5 211
5 220
5 22...

output:

Subtask #3:

score: 0
Time Limit Exceeded

Test #25:

score: 0
Time Limit Exceeded

input:

1
355365355024496523

output:

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

input:

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

output:

2
5000 3270
1 2
1 8
1 22
1 1138
1 2654
2 3
4 6
4 9
4 13
4 16
4 19
4 21
4 23
4 25
4 34
4 37
4 46
4 56
4 61
4 89
4 100
4 111
4 133
4 166
4 181
4 199
4 221
4 265
4 331
4 397
4 441
4 496
4 661
4 793
4 850
4 1321
4 1416
4 1699
4 2265
4 3397
6 14
6 54
6 107
6 1379
7 32
10 24
10 38
10 47
10 70
10 75
10 84
...

input:

2
5000 3270
1 2
1 8
1 22
1 1138
1 2654
2 3
4 6
4 9
4 13
4 16
4 19
4 21
4 23
4 25
4 34
4 37
4 46
4 56
4 61
4 89
4 100
4 111
4 133
4 166
4 181
4 199
4 221
4 265
4 331
4 397
4 441
4 496
4 661
4 793
4 850
4 1321
4 1416
4 1699
4 2265
4 3397
6 14
6 54
6 107
6 1379
7 32
10 24
10 38
10 47
10 70
10 75
10 84
...

output:
English 繁體中文 简体中文

Server Time: 2024-12-05 05:12:38 | OpenSource Project