oj.uz

Submission #992758

# Submission time Handle Problem Language Result Execution time Memory
992758 2024-06-05T06:56:47 Z Programmer123 Magic Show (APIO24_show) C++17
100 / 100
 3 ms 1324 KB 
#include <bits/stdc++.h>
#include "Alice.h"

std::vector<std::pair<int, int>> Alice() {
    long long x = setN(5000);
    std::vector<std::pair<int, int>> result;
    for (int i = 2; i <= 5000; ++i) {
        result.emplace_back(i, (x % (i - 1)) + 1);
    }
    return result;
}

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

long long gcd(long long a, long long b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

long long Bob(std::vector<std::pair<int, int>> V) {
    long long base = std::max(V[0].first, V[0].second) - 1;
    long long res = std::min(V[0].first, V[0].second) - 1;
    for (auto [b, e]: V) {
        if (b < e) std::swap(b, e);
        b--;
        e--;
        if (gcd(b, base) == 1) {
            for (long long i = 0;; ++i) {
                if ((base * i + res) % b == e) {
                    long long nb = base * b;
                    long long nr = (base * i + res) % nb;
                    std::tie(base, res) = {nb, nr};
                    if (base >= 1000000000000000001ll) return res;
                    break;
                }
            }
        }
    }
    return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 832 KB Correct.
3 Correct 2 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 936 KB Correct.
7 Correct 1 ms 820 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 1 ms 820 KB Correct.
11 Correct 2 ms 820 KB Correct.
12 Correct 2 ms 824 KB Correct.

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 832 KB Correct.
3 Correct 2 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 936 KB Correct.
7 Correct 1 ms 820 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 1 ms 820 KB Correct.
11 Correct 2 ms 820 KB Correct.
12 Correct 2 ms 824 KB Correct.
13 Correct 1 ms 820 KB Correct.
14 Correct 1 ms 816 KB Correct.
15 Correct 2 ms 820 KB Correct.
16 Correct 1 ms 832 KB Correct.
17 Correct 1 ms 820 KB Correct.
18 Correct 1 ms 832 KB Correct.
19 Correct 1 ms 824 KB Correct.
20 Correct 2 ms 820 KB Correct.
21 Correct 1 ms 832 KB Correct.
22 Correct 1 ms 1324 KB Correct.
23 Correct 2 ms 820 KB Correct.
24 Correct 1 ms 832 KB Correct.

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 832 KB Correct.
3 Correct 2 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 1 ms 816 KB Correct.
6 Correct 2 ms 936 KB Correct.
7 Correct 1 ms 820 KB Correct.
8 Correct 1 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 1 ms 820 KB Correct.
11 Correct 2 ms 820 KB Correct.
12 Correct 2 ms 824 KB Correct.
13 Correct 1 ms 820 KB Correct.
14 Correct 1 ms 816 KB Correct.
15 Correct 2 ms 820 KB Correct.
16 Correct 1 ms 832 KB Correct.
17 Correct 1 ms 820 KB Correct.
18 Correct 1 ms 832 KB Correct.
19 Correct 1 ms 824 KB Correct.
20 Correct 2 ms 820 KB Correct.
21 Correct 1 ms 832 KB Correct.
22 Correct 1 ms 1324 KB Correct.
23 Correct 2 ms 820 KB Correct.
24 Correct 1 ms 832 KB Correct.
25 Correct 2 ms 828 KB Correct.
26 Correct 2 ms 820 KB Correct.
27 Correct 2 ms 828 KB Correct.
28 Correct 2 ms 820 KB Correct.
29 Correct 2 ms 824 KB Correct.
30 Correct 2 ms 820 KB Correct.
31 Correct 1 ms 820 KB Correct.
32 Correct 1 ms 820 KB Correct.
33 Correct 2 ms 1080 KB Correct.
34 Correct 1 ms 820 KB Correct.
35 Correct 1 ms 820 KB Correct.
36 Correct 1 ms 828 KB Correct.
37 Correct 1 ms 820 KB Correct.
38 Correct 1 ms 832 KB Correct.
39 Correct 1 ms 820 KB Correct.
40 Correct 3 ms 820 KB Correct.
41 Correct 2 ms 820 KB Correct.
42 Correct 2 ms 820 KB Correct.
43 Correct 2 ms 820 KB Correct.
44 Correct 2 ms 820 KB Correct.