Submission #1184805

#TimeUsernameProblemLanguageResultExecution timeMemory
1184805duyngadoctonMagic Show (APIO24_show)C++20
100 / 100
2 ms380 KiB
#include<bits/stdc++.h>
#include "Alice.h"

using namespace std;

#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back

vector<ii> Alice(){
    int N = 5000;
    long long x = setN(N);
    vector<ii> adj;
    for(int i = 1; i < N; ++i) {
        int j = x % i;
        adj.push_back(ii(j + 1, i + 1));
    }
    return adj;
}
#include<bits/stdc++.h>
#include "Bob.h"

using namespace std;

#define ii pair<int,int>
#define fi first
#define se second
#define ll long long

long long Bob(vector<ii> V){
    ll ans = 0;
    int N = V.size() - 1;
    ll lcm = 1;
    ans = V[0].fi - 1;
    lcm = V[0].se - 1;
    for(int i = 1; i <= N; ++i) {
        int u = V[i].fi - 1, v = V[i].se - 1;
        while(ans % v != u) {
            ans += lcm;
        }
        ll x = __gcd(lcm, 1LL * v);
        lcm /= x;
        if (1e18 / lcm < v) break;
        lcm *= v;
    }
    return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...