Submission #1361524

#TimeUsernameProblemLanguageResultExecution timeMemory
1361524silence25Magic Show (APIO24_show)C++20
0 / 100
1097 ms580 KiB
#include "Alice.h"
#include "bits/stdc++.h"
#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define wr cout << "------------------------" << endl
using namespace std;

vector<pair<int,int>> Alice(){
    int n = 5000;
    int x = setN(n);
    vector<pair<int, int>> edges;
    for (int i = 1;i<n;++i)  edges.pb({x % i + 1, i + 1});
    return edges;
}
#include "Bob.h"
#include "bits/stdc++.h"
#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define wr cout << "------------------------" << endl
using namespace std;

long long Bob(vector<pair<int,int>> edges){
    ll ans = 0, lc = 1;
    for (auto [u, v] : edges) {
        while (ans % v != u) ans += lc;
        lc *= v / __gcd((ll)v, lc);
    }
    return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...