QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#462601#8726. Magic Showhhoppitree0 0ms1868kbC++17946b2024-07-03 21:59:042024-07-03 21:59:04

Judging History

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

  • [2024-07-03 21:59:04]
  • 评测
  • 测评结果：0
  • 用时：0ms
  • 内存：1868kb
查看
  • [2024-07-03 21:59:04]
  • 提交

Alice

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

using namespace std;

vector< pair<int, int> > Alice() {
    long long x = setN(5000);
    vector< pair<int, int> > E;
    for (int i = 2; i <= 5000; ++i) E.push_back({x % (i - 1) + 1, i});
    return E;
}
Source code, Language: C++17

Bob

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

using namespace std;

long long exgcd(long long a, long long b, long long &x, long long &y) {
    if (!b) {x = 1, y = 0; return a;}
    long long d = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}

long long Bob(vector< pair<int, int> > E) {
    __int128 K = -1, B = -1;
    for (auto [b, k] : E) {
        --b;
        if (!~K) {
            K = k, B = b;
            continue;
        }
        long long x, y;
        long long d = exgcd(K, -k, x, y);
        __int128 tK = K * k / d;
        B = (B + x * (b - B) / d * K % tK + tK) % tK, K = tK;
        if (K + B > 1e18) break;
    }
    return B;
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1840kb

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 4829
1 2
1 4
1 6
1 10
1 16
1 46
1 90
1 268
1 446
1 802
1 1336
1 4006
2 3
2 5
2 8
2 12
2 14
2 15
2 23
2 27
2 29
2 45
2 53
2 78
2 92
2 144
2 155
2 183
2 287
2 309
2 365
2 573
2 1002
2 2003
2 4005
3 4004
4 7
4 24
4 30
4 47
4 59
4 70
4 88
4 139
4 175
4 668
4 1335
4 2002
4 4003
5 4002
6 9
6 11
6 1...

input:

2
5000 4829
1 2
1 4
1 6
1 10
1 16
1 46
1 90
1 268
1 446
1 802
1 1336
1 4006
2 3
2 5
2 8
2 12
2 14
2 15
2 23
2 27
2 29
2 45
2 53
2 78
2 92
2 144
2 155
2 183
2 287
2 309
2 365
2 573
2 1002
2 2003
2 4005
3 4004
4 7
4 24
4 30
4 47
4 59
4 70
4 88
4 139
4 175
4 668
4 1335
4 2002
4 4003
5 4002
6 9
6 11
6 1...

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Incorrect answer.

Subtask #2:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1844kb

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 4829
1 2
1 3
1 5
1 18
1 35
1 69
2 4
2 108
2 322
4 1188
5 6
5 7
5 8
5 9
5 10
5 11
5 13
5 15
5 16
5 19
5 21
5 22
5 25
5 26
5 29
5 31
5 36
5 37
5 39
5 41
5 43
5 46
5 51
5 57
5 58
5 61
5 64
5 71
5 73
5 74
5 76
5 77
5 85
5 91
5 96
5 101
5 106
5 115
5 121
5 127
5 134
5 141
5 147
5 151
5 153
5 169
5...

input:

2
5000 4829
1 2
1 3
1 5
1 18
1 35
1 69
2 4
2 108
2 322
4 1188
5 6
5 7
5 8
5 9
5 10
5 11
5 13
5 15
5 16
5 19
5 21
5 22
5 25
5 26
5 29
5 31
5 36
5 37
5 39
5 41
5 43
5 46
5 51
5 57
5 58
5 61
5 64
5 71
5 73
5 74
5 76
5 77
5 85
5 91
5 96
5 101
5 106
5 115
5 121
5 127
5 134
5 141
5 147
5 151
5 153
5 169
5...

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Incorrect answer.

Subtask #3:

score: 0
Wrong Answer

Test #25:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1840kb

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 4829
1 2
1 4
1 8
1 22
1 380
1 1138
1 2654
2 3
3 258
4 5
4 6
4 7
4 9
4 10
4 11
4 12
4 13
4 16
4 19
4 21
4 23
4 25
4 31
4 34
4 37
4 41
4 45
4 46
4 56
4 61
4 67
4 73
4 89
4 91
4 100
4 111
4 121
4 133
4 166
4 181
4 199
4 221
4 265
4 284
4 331
4 361
4 397
4 441
4 496
4 567
4 661
4 793
4 850
4 991
...

input:

2
5000 4829
1 2
1 4
1 8
1 22
1 380
1 1138
1 2654
2 3
3 258
4 5
4 6
4 7
4 9
4 10
4 11
4 12
4 13
4 16
4 19
4 21
4 23
4 25
4 31
4 34
4 37
4 41
4 45
4 46
4 56
4 61
4 67
4 73
4 89
4 91
4 100
4 111
4 121
4 133
4 166
4 181
4 199
4 221
4 265
4 284
4 331
4 361
4 397
4 441
4 496
4 567
4 661
4 793
4 850
4 991
...

output:

9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Incorrect answer.
English 繁體中文 简体中文

Server Time: 2024-12-13 04:45:21 | OpenSource Project