oj.uz

Submission #1011023

# Submission time Handle Problem Language Result Execution time Memory
1011023 2024-06-29T17:05:29 Z ttamx Magic Show (APIO24_show) C++17
100 / 100
 1 ms 784 KB 
#include <bits/stdc++.h>
#include "Alice.h"

using namespace std;

vector<pair<int,int>> Alice(){
    int n=105;
    long long x=setN(n);
    vector<pair<int,int>> res;
    for(int i=1;i<n;i++)res.emplace_back(x%i+1,i+1);
    return res;
}
#include <bits/stdc++.h>
#include "Bob.h"

using namespace std;

using i128 = __int128_t;

long long Bob(vector<pair<int,int>> e){
    const i128 LIM=1e18;
    auto extgcd=[&](i128 a,i128 b){
        i128 u=1,v=0,q;
        while(b){
            q=a/b;
            a-=q*b,u-=q*v;
            swap(a,b),swap(u,v);
        }
        return make_tuple(a,u,v);
    };
    i128 a=0,m=0;
    for(auto [u,v]:e){
        if(m>LIM)break;
        u--,v--;
        if(u>v)swap(u,v);
        if(m==0){
            a=u,m=v;
            continue;
        }
        auto [g,x,y]=extgcd(m,v);
        a=a+x*(u-a)/g%(v/g)*m;
        m=m/g*v;
        a%=m;
        if(a<0)a+=m;
    }
    return a;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 776 KB Correct.
2 Correct 0 ms 784 KB Correct.
3 Correct 0 ms 776 KB Correct.
4 Correct 0 ms 776 KB Correct.
5 Correct 0 ms 784 KB Correct.
6 Correct 0 ms 776 KB Correct.
7 Correct 0 ms 776 KB Correct.
8 Correct 1 ms 776 KB Correct.
9 Correct 0 ms 776 KB Correct.
10 Correct 0 ms 776 KB Correct.
11 Correct 0 ms 784 KB Correct.
12 Correct 0 ms 780 KB Correct.

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 776 KB Correct.
2 Correct 0 ms 784 KB Correct.
3 Correct 0 ms 776 KB Correct.
4 Correct 0 ms 776 KB Correct.
5 Correct 0 ms 784 KB Correct.
6 Correct 0 ms 776 KB Correct.
7 Correct 0 ms 776 KB Correct.
8 Correct 1 ms 776 KB Correct.
9 Correct 0 ms 776 KB Correct.
10 Correct 0 ms 776 KB Correct.
11 Correct 0 ms 784 KB Correct.
12 Correct 0 ms 780 KB Correct.
13 Correct 0 ms 776 KB Correct.
14 Correct 0 ms 780 KB Correct.
15 Correct 0 ms 780 KB Correct.
16 Correct 0 ms 784 KB Correct.
17 Correct 0 ms 784 KB Correct.
18 Correct 1 ms 784 KB Correct.
19 Correct 0 ms 784 KB Correct.
20 Correct 0 ms 776 KB Correct.
21 Correct 1 ms 776 KB Correct.
22 Correct 0 ms 776 KB Correct.
23 Correct 0 ms 776 KB Correct.
24 Correct 0 ms 776 KB Correct.

Subtask #3
65.0 / 65.0

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