제출 #1291495

#제출 시각아이디문제언어결과실행 시간메모리
1291495dostsMagic Show (APIO24_show)C++20
100 / 100
4 ms1088 KiB
#include "Alice.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

std::vector<std::pair<signed,signed>> Alice(){
    vector<pair<signed,signed>> ret;
    int X = setN(5000);
    for (int i = 1;i<=4999;i++) {
        ret.push_back({i+1,X%i+1});
    }
    return ret;
}
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
#include "Bob.h"

long long Bob(std::vector<std::pair<signed,signed>> V){
    __int128_t cur = 1;
    int ans = 0;
    for (auto [p,r] : V) {
        if (p < r) swap(p,r);
        p--;
        r--;
        while (ans%p != r) ans+=cur;
        cur = p/gcd(p,cur)*cur;
    }   
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...