Submission #1047821

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1047821	2024-08-07T16:17:22 Z	Arturgo	Magic Show (APIO24_show)	C++17	100 / 100	2 ms	1072 KB

Alice

#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;

vector<pair<int,int>> Alice() {
    int N = 5000;
    long long X = setN(N);

    vector<pair<int, int>> arbre;
    for(int i = 2;i <= N;i++) {
        arbre.push_back({1 + X % (i - 1), i});
    }

    return arbre;
}

Bob

#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;

long long Bob(vector<pair<int, int>> aretes){
	__int128 X = 0;
    __int128 N = 1;

    for(pair<int, int>& arete : aretes) {
        __int128 modX = arete.first - 1, p = arete.second - 1; 

        while(X % p != modX) {
            X += N;
        }

        N = (N * p) / __gcd(N, p);

        if(N > 1e18) break;
    }

    return X;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

30.0 / 30.0

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

Subtask #3

65.0 / 65.0

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