結果
問題 | No.2008 Super Worker |
ユーザー |
![]() |
提出日時 | 2022-07-15 21:28:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,272 bytes |
コンパイル時間 | 1,147 ms |
コンパイル使用メモリ | 123,524 KB |
最終ジャッジ日時 | 2025-01-30 07:28:23 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 WA * 11 |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v < 0) _v = (_v%MOD)+MOD; if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } ModInt &operator+=(ll n){ v = (v+n)%MOD; return *this; } ModInt &operator-=(ll n){ v = (v-n+MOD)%MOD; return *this; } ModInt &operator*=(ll n){ v = (v*n+MOD)%MOD; return *this; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } ModInt &operator+=(ModInt n){ v = (v+n.v)%MOD; return *this; } ModInt &operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; return *this; } ModInt &operator*=(ModInt n){ v = (v*n.v)%MOD; return *this; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } ModInt &operator=(ll n){ v = n%MOD; return *this; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt pow(ModInt a, ll n) { assert(n >= 0); ModInt ans = 1; while (n > 0) { if (n&1) ans = ans*a; a = a*a; n >>= 1; } return ans; } template <typename T> class frac{ public: T n, d; frac(T _n, T _d){ T g = gcd(_n, _d); n = _n/g; d = _d/g; if(d < 0) { d *= -1; n *= -1; } } frac operator+(frac f){ return frac(n*f.d+d*f.n, f.d*d); } frac operator-(frac f){ return frac(n*f.d-d*f.n, f.d*d); } frac operator*(frac f){ return frac(f.n*n, f.d*d); } frac inv(){ return frac(d, n); } bool operator<(frac f){ if(d*f.d < 0) return n*f.d-d*f.n > 0; else return n*f.d-d*f.n < 0; } bool operator>(frac f){ if(d*f.d < 0) return n*f.d-d*f.n < 0; else return n*f.d-d*f.n > 0; } bool operator==(frac f){ return n*f.d-d*f.n == 0; } void operator+=(frac f){ n = n*f.d+d*f.n, d = f.d*d; reduction(); } void operator-=(frac f){ n = n*f.d-d*f.n, d = f.d*d; reduction(); } void reduction(){ T g = gcd(n, d); n /= g, d /= g; } }; template <typename T> bool operator<(const frac<T> f1, const frac<T> f2){ if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0; else return f1.n*f2.d-f1.d*f2.n < 0; } template <typename T> bool operator>(const frac<T> f1, const frac<T> f2){ if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0; else return f1.n*f2.d-f1.d*f2.n > 0; } template <typename T> bool operator==(const frac<T> f1, const frac<T> f2){ return f1.n*f2.d-f1.d*f2.n == 0; } using mint = ModInt; using F = frac<int>; using P = pair<F, int>; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n; cin >> n; vector<int> a(n), b(n); for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < n; i++) cin >> b[i]; vector<P> vp; for(int i = 0; i < n; i++) vp.push_back(P(F(b[i]-1, a[i]), i)); sort(vp.begin(), vp.end(), greater<P>()); mint x = 1; mint ans = 0; for(auto [f, i]: vp){ ans += x*a[i]; x *= b[i]; } cout << ans << endl; }