結果
問題 | No.1201 お菓子配り-4 |
ユーザー | tokusakurai |
提出日時 | 2020-08-28 22:43:31 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 461 ms / 4,000 ms |
コード長 | 3,154 bytes |
コンパイル時間 | 2,074 ms |
コンパイル使用メモリ | 199,988 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-08 21:19:37 |
合計ジャッジ時間 | 8,370 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
4,380 KB |
testcase_01 | AC | 222 ms
4,380 KB |
testcase_02 | AC | 318 ms
4,380 KB |
testcase_03 | AC | 156 ms
4,380 KB |
testcase_04 | AC | 77 ms
4,384 KB |
testcase_05 | AC | 190 ms
4,380 KB |
testcase_06 | AC | 30 ms
4,376 KB |
testcase_07 | AC | 86 ms
4,376 KB |
testcase_08 | AC | 236 ms
4,380 KB |
testcase_09 | AC | 175 ms
4,380 KB |
testcase_10 | AC | 4 ms
4,380 KB |
testcase_11 | AC | 47 ms
4,376 KB |
testcase_12 | AC | 363 ms
4,376 KB |
testcase_13 | AC | 12 ms
4,380 KB |
testcase_14 | AC | 7 ms
4,384 KB |
testcase_15 | AC | 285 ms
4,376 KB |
testcase_16 | AC | 88 ms
4,380 KB |
testcase_17 | AC | 113 ms
4,376 KB |
testcase_18 | AC | 20 ms
4,376 KB |
testcase_19 | AC | 19 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,376 KB |
testcase_26 | AC | 2 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,384 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 458 ms
4,380 KB |
testcase_31 | AC | 459 ms
4,376 KB |
testcase_32 | AC | 461 ms
4,380 KB |
testcase_33 | AC | 461 ms
4,380 KB |
testcase_34 | AC | 458 ms
4,380 KB |
testcase_35 | AC | 146 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp(x) fixed << setprecision(x) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const ll MOD = 1000000007; //const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const double pi = acos(-1.0); const double EPS = 1e-10; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; template<ll mod> struct Mod_Int{ ll x; Mod_Int() {} Mod_Int(ll y) : x (y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ x = (x + p.x) % mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ x = (x + mod - p.x) % mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (x * p.x) % mod; return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod-2); } Mod_Int pow(ll k) const{ Mod_Int now = *this, ret = 1; while(k){ if(k&1) ret *= now; now *= now, k >>= 1; } return ret; } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ ll a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; int main(){ int N, M; cin >> N >> M; ll A[N], B[M]; rep(i, N) cin >> A[i]; rep(i, M) cin >> B[i]; ll ans = 0; rep(i, N){ rep(j, M){ ll g = gcd(A[i], B[j]); ans += (2*A[i]-2)*((B[j]+1)/2)+2*((g+1)/2); if(B[j]%2 == 0) ans += 2*(A[i]/2); ans %= MOD; } } cout << ans << endl; }