2018-2019 XIX Open Cup, Grand Prix of Korea解题报告(有待更新

H(模拟):

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

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e6+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
int gcd(int x,int y){ return y?gcd(y,x%y):x;}
ll a,b,c,d;
pii tmp[maxn];
int cnt=0;
ll solve(ll x,ll y){
    ll ans=0;
    rep(i,0,cnt){
        int p=tmp[i].fi,q=tmp[i].se;
        ans+=min(x/p,y/q);
        ans+=min(x/q,y/p);
    }
    ans+=min(x,y);
    return