結果

問題 No.2008 Super Worker
ユーザー woodywoodywoodywoody
提出日時 2022-07-15 22:36:37
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,656 ms / 2,000 ms
コード長 7,161 bytes
コンパイル時間 7,501 ms
コンパイル使用メモリ 303,532 KB
実行使用メモリ 11,392 KB
最終ジャッジ日時 2024-06-27 19:26:59
合計ジャッジ時間 28,529 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 7 ms
5,376 KB
testcase_14 AC 9 ms
5,376 KB
testcase_15 AC 7 ms
5,376 KB
testcase_16 AC 8 ms
5,376 KB
testcase_17 AC 9 ms
5,376 KB
testcase_18 AC 12 ms
5,376 KB
testcase_19 AC 7 ms
5,376 KB
testcase_20 AC 8 ms
5,376 KB
testcase_21 AC 8 ms
5,376 KB
testcase_22 AC 7 ms
5,376 KB
testcase_23 AC 1,533 ms
11,136 KB
testcase_24 AC 1,545 ms
11,128 KB
testcase_25 AC 1,537 ms
11,392 KB
testcase_26 AC 1,560 ms
11,144 KB
testcase_27 AC 1,542 ms
11,212 KB
testcase_28 AC 1,622 ms
11,308 KB
testcase_29 AC 1,620 ms
11,172 KB
testcase_30 AC 1,622 ms
11,104 KB
testcase_31 AC 1,606 ms
11,148 KB
testcase_32 AC 1,656 ms
11,124 KB
testcase_33 AC 1,461 ms
11,136 KB
testcase_34 AC 1,590 ms
11,264 KB
testcase_35 AC 1,342 ms
11,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

struct rational{
    ll num,den;
 
    rational(ll num_=0,ll den_=0){
        if (num_ == 0){
            num = 0;
            den = 1;
        }else if(den_ == 0){
            num = 1;
            den = 0;
        }else{
            ll d = gcd(abs(num_),abs(den_));
            num = abs(num_)/d;
            den = abs(den_)/d;
 
            if((num_ < 0 && den_ > 0) || (num_ > 0 && den_ < 0)) num *= -1;
        }
    }
 
    rational operator+(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        assert(abs(other.num) < LLONG_MAX/den);
        assert(abs(num) < LLONG_MAX/other.den);
        ll p,q;
        p = num*other.den + den*other.num;
        q = den*other.den;
        return rational(p,q);
    }
 
    rational operator-(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        assert(abs(other.num) < LLONG_MAX/den);
        assert(abs(num) < LLONG_MAX/other.den);
        ll p,q;
        p = num*other.den - den*other.num;
        q = den*other.den;
        return rational(p,q);
    }
 
    rational operator*(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        if (other.num == 0) return rational(num,den);
        assert(abs(num) < LLONG_MAX/abs(other.num));
        assert(other.den < LLONG_MAX/den);
        ll p,q;
        p = num*other.num;
        q = den*other.den;
        return rational(p,q);
    }
 
    rational operator/(rational const other) const{
        rational r(other.den , other.num);
        return *this * r;
    }
 
    rational operator+=(rational const other){
        *this = *this + other;
        return *this;
    }
 
    rational operator-=(rational const other){
        *this = *this - other;
        return *this;
    }
 
    rational operator*=(rational const other){
        *this = *this * other;
        return *this;
    }
 
    rational operator/=(rational const other){
        *this = *this / other;
        return *this;
    }
 
    bool operator>(rational const other) const{
        if (den == 0){
            if (other.den == 0) return false;
            else return true;
        }else if(other.den == 0){
            return false;
        }
        assert(abs(num) < LLONG_MAX/other.den);
        assert(abs(other.num) < LLONG_MAX/den);
        return num*other.den > den*other.num;
    }
 
    bool operator<(rational const other) const{
        if (den == 0){
            if (other.den == 0) return false;
            else return false;
        }else if(other.den == 0){
            return true;
        }
        assert(abs(num) < LLONG_MAX/other.den);
        assert(abs(other.num) < LLONG_MAX/den);
        return num*other.den < den*other.num;
    }
 
    bool operator>=(rational const other) const{
        if (den == 0){
            if (other.den == 0) return true;
            else return true;
        }else if(other.den == 0){
            return false;
        }
        assert(abs(num) < LLONG_MAX/other.den);
        assert(abs(other.num) < LLONG_MAX/den);
        return num*other.den >= den*other.num;
    }
 
    bool operator<=(rational const other) const{
        if (den == 0){
            if (other.den == 0) return true;
            else return false;
        }else if(other.den == 0){
            return true;
        }
        assert(abs(num) < LLONG_MAX/other.den);
        assert(abs(other.num) < LLONG_MAX/den);
        return num*other.den <= den*other.num;
    }
 
    bool operator==(rational const other) const{
        return (num == other.num) && (den == other.den);
    }
 
    bool operator!=(rational const other) const{
        return (num != other.num) || (den != other.den);
    }
};
 
// rational(a,b) でa/bを既約分数の状態で管理。a,bは共に64bit型整数であるが、四足演算にてa*b >= LLONG_MAX となる場合には警告が出る。
// a*b < 0の時、a<0 , b>0で管理。
// a == 0 の時　(0,1)、b == 0 の時 (1,0)で管理。

int main(){

    int n; cin>>n;

    vector<pair<rational,ll>> v(n);

    vl a(n),b(n);
    rep(i,n) cin>>a[i];
    rep(i,n) cin>>b[i],b[i]--;

    rep(i,n){
        ll d = gcd(a[i],b[i]);
        v[i] = {rational(b[i] ,a[i]) , d};
    }

    sort(rrng(v));

    mint ans = 0;
    mint now = 1;

    rep(i,n){
        ans += now * v[i].fi.den * v[i].se;
        now *= (v[i].fi.num * v[i].se+1);

        // cout << ans.val() << " " << now.val() << endl;
    }

    cout << ans.val() << endl;


    

    return 0;
// 消せ！！！！！！　#define _GLIBCXX_DEBUG
}
0