QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#462609#8726. Magic Showhhoppitree0 0ms1868kbC++17958b2024-07-03 22:08:232024-07-03 22:08:24

Judging History

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

  • [2024-07-03 22:08:24]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:1868kb
  • [2024-07-03 22:08:23]
  • 提交

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;
}

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, --k;
        if (!~K) {
            K = k, B = b;
            continue;
        }
        long long x, y, 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;
    }
    printf("%lld\n", B);
    return B;
}

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1864kb,1804kb

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 2742
1 4
1 6
1 10
1 16
1 90
1 268
1 446
1 802
1 1336
1 4006
2 5
2 14
2 15
2 27
2 29
2 144
2 2003
3 4004
4 24
4 47
4 70
4 88
4 175
4 668
4 1335
4 2002
4 4003
6 11
6 17
6 21
6 26
6 33
6 41
6 101
6 201
6 401
6 801
7 44
7 94
7 1334
8 3999
9 572
10 37
10 55
10 109
10 112
10 149
10 445
10 1333
10 3...

input:

2
5000 2742
1 4
1 6
1 10
1 16
1 90
1 268
1 446
1 802
1 1336
1 4006
2 5
2 14
2 15
2 27
2 29
2 144
2 2003
3 4004
4 24
4 47
4 70
4 88
4 175
4 668
4 1335
4 2002
4 4003
6 11
6 17
6 21
6 26
6 33
6 41
6 101
6 201
6 401
6 801
7 44
7 94
7 1334
8 3999
9 572
10 37
10 55
10 109
10 112
10 149
10 445
10 1333
10 3...

output:

4005
08e2277017156c65e2df558ef1d27eae814767ea6a771d5be687d4040371b97399dd6bd28d5207cce21e4e205ea711c730f7ccf85a21af8c41bab7c037b89e9e
4005

Subtask #2:

score: 0
Wrong Answer

Test #13:

score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1864kb,1812kb

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 2742
1 5
2 4
2 108
5 6
5 10
5 11
5 15
5 16
5 20
5 21
5 22
5 26
5 29
5 36
5 37
5 39
5 41
5 43
5 57
5 58
5 64
5 77
5 85
5 91
5 101
5 106
5 121
5 134
5 141
5 151
5 191
5 201
5 220
5 226
5 253
5 267
5 281
5 286
5 293
5 316
5 343
5 366
5 400
5 421
5 439
5 451
5 457
5 476
5 526
5 631
5 666
5 685
5 ...

input:

2
5000 2742
1 5
2 4
2 108
5 6
5 10
5 11
5 15
5 16
5 20
5 21
5 22
5 26
5 29
5 36
5 37
5 39
5 41
5 43
5 57
5 58
5 64
5 77
5 85
5 91
5 101
5 106
5 121
5 134
5 141
5 151
5 191
5 201
5 220
5 226
5 253
5 267
5 281
5 286
5 293
5 316
5 343
5 366
5 400
5 421
5 439
5 451
5 457
5 476
5 526
5 631
5 666
5 685
5 ...

output:

17476204
08e2277017156c65e2df558ef1d27eae814767ea6a771d5be687d4040371b97399dd6bd28d5207cce21e4e205ea711c730f7ccf85a21af8c41bab7c037b89e9e
17476204

Subtask #3:

score: 0
Wrong Answer

Test #25:

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

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 2742
1 4
1 22
1 1138
1 2654
3 258
4 5
4 6
4 10
4 11
4 16
4 21
4 34
4 37
4 41
4 56
4 67
4 91
4 100
4 121
4 166
4 199
4 221
4 265
4 331
4 441
4 567
4 793
4 850
4 1981
4 2265
4 2548
4 4246
6 14
6 27
6 54
6 1379
7 94
8 15
8 29
10 24
10 47
10 70
10 112
10 250
10 852
10 1703
10 3072
12 17
12 33
15 ...

input:

2
5000 2742
1 4
1 22
1 1138
1 2654
3 258
4 5
4 6
4 10
4 11
4 16
4 21
4 34
4 37
4 41
4 56
4 67
4 91
4 100
4 121
4 166
4 199
4 221
4 265
4 331
4 441
4 567
4 793
4 850
4 1981
4 2265
4 2548
4 4246
6 14
6 27
6 54
6 1379
7 94
8 15
8 29
10 24
10 47
10 70
10 112
10 250
10 852
10 1703
10 3072
12 17
12 33
15 ...

output:

5091560833248418675
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4
Incorrect answer.