結果
問題 | No.886 Direct |
ユーザー | rniya |
提出日時 | 2021-10-03 16:55:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 305 ms / 4,000 ms |
コード長 | 9,716 bytes |
コンパイル時間 | 2,548 ms |
コンパイル使用メモリ | 207,160 KB |
実行使用メモリ | 50,432 KB |
最終ジャッジ日時 | 2024-07-21 11:12:41 |
合計ジャッジ時間 | 13,932 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 266 ms
50,432 KB |
testcase_01 | AC | 235 ms
50,304 KB |
testcase_02 | AC | 235 ms
50,432 KB |
testcase_03 | AC | 242 ms
50,432 KB |
testcase_04 | AC | 246 ms
50,304 KB |
testcase_05 | AC | 264 ms
50,304 KB |
testcase_06 | AC | 272 ms
50,432 KB |
testcase_07 | AC | 277 ms
50,304 KB |
testcase_08 | AC | 271 ms
50,432 KB |
testcase_09 | AC | 268 ms
50,432 KB |
testcase_10 | AC | 253 ms
50,304 KB |
testcase_11 | AC | 279 ms
50,304 KB |
testcase_12 | AC | 262 ms
50,432 KB |
testcase_13 | AC | 269 ms
50,432 KB |
testcase_14 | AC | 266 ms
50,304 KB |
testcase_15 | AC | 273 ms
50,304 KB |
testcase_16 | AC | 260 ms
50,432 KB |
testcase_17 | AC | 261 ms
50,356 KB |
testcase_18 | AC | 237 ms
50,304 KB |
testcase_19 | AC | 241 ms
50,432 KB |
testcase_20 | AC | 238 ms
50,304 KB |
testcase_21 | AC | 271 ms
50,304 KB |
testcase_22 | AC | 262 ms
50,432 KB |
testcase_23 | AC | 287 ms
50,304 KB |
testcase_24 | AC | 283 ms
50,304 KB |
testcase_25 | AC | 277 ms
50,304 KB |
testcase_26 | AC | 281 ms
50,304 KB |
testcase_27 | AC | 305 ms
50,316 KB |
testcase_28 | AC | 300 ms
50,432 KB |
testcase_29 | AC | 261 ms
50,304 KB |
testcase_30 | AC | 266 ms
50,432 KB |
testcase_31 | AC | 295 ms
50,304 KB |
testcase_32 | AC | 295 ms
50,432 KB |
testcase_33 | AC | 291 ms
50,432 KB |
testcase_34 | AC | 298 ms
50,304 KB |
testcase_35 | AC | 291 ms
50,304 KB |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <int i, typename T> void print_tuple(ostream&, const T&) {} template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) { if (i) os << ','; os << get<i>(t); print_tuple<i + 1, T, Args...>(os, t); } template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) { os << '{'; print_tuple<0, tuple<Args...>, Args...>(os, t); return os << '}'; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(signed t) { return __builtin_popcount(t); } int popcount(long long t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } template <class T> T ceil(T x, T y) { assert(y >= 1); return (x > 0 ? (x + y - 1) / y : x / y); } template <class T> T floor(T x, T y) { assert(y >= 1); return (x > 0 ? x / y : (x - y + 1) / y); } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion #include <cassert> #include <cstdint> #include <iostream> template <uint64_t Modulus> class modint { using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; static_assert(Modulus < static_cast<uint32_t>(1) << 31, "Modulus must be less than 2**31"); static constexpr u32 mod = Modulus; u32 v; public: constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {} constexpr u32& val() noexcept { return v; } constexpr const u32& val() const noexcept { return v; } constexpr modint operator+(const modint& rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint& rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint& rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint& rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint& operator+=(const modint& rhs) noexcept { v += rhs.v; if (v >= mod) v -= mod; return *this; } constexpr modint& operator-=(const modint& rhs) noexcept { if (v < rhs.v) v += mod; v -= rhs.v; return *this; } constexpr modint& operator*=(const modint& rhs) noexcept { v = (u64)v * rhs.v % mod; return *this; } constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); } constexpr modint pow(long long n) const noexcept { assert(0 <= n); modint self(*this), res(1); while (n > 0) { if (n & 1) res *= self; self *= self; n >>= 1; } return res; } constexpr modint inv() const noexcept { assert(*this != 0); return pow(mod - 2); } constexpr modint& operator++() noexcept { if (++v == mod) v = 0; return *this; } constexpr modint& operator--() noexcept { if (v == 0) v = mod; return --v, *this; } constexpr modint operator++(int) noexcept { modint t = *this; return ++*this, t; } constexpr modint operator--(int) noexcept { modint t = *this; return --*this, t; } constexpr modint operator-() const noexcept { return modint(mod - v); } template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; } template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; } template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; } template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; } constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; } constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; } constexpr bool operator!() const noexcept { return !v; } friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept { i64 v; rhs = modint{(s >> v, v)}; return s; } friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; } }; /** * @brief modint * @docs docs/modulo/modint.md */ #include <cassert> #include <vector> namespace gcd_convolution { // f(k) <- \sum_{k | i} f(i) template <typename T> void divisor_transform(std::vector<T>& f) { int n = f.size(); std::vector<bool> sieve(n, true); for (int p = 2; p < n; p++) { if (sieve[p]) { for (int k = (n - 1) / p; k > 0; k--) { sieve[k * p] = false; f[k] += f[k * p]; } } } for (int i = 1; i < n; i++) f[i] += f[0]; } // inverse of divisor transform template <typename T> void inverse_divisor_transform(std::vector<T>& f) { int n = f.size(); std::vector<bool> sieve(n, true); for (int i = 1; i < n; i++) f[i] -= f[0]; for (int p = 2; p < n; p++) { if (sieve[p]) { for (int k = 1 / p; k * p < n; k++) { sieve[k * p] = false; f[k] -= f[k * p]; } } } } template <typename T> std::vector<T> gcd_convolution(std::vector<T> f, std::vector<T> g) { assert(f.size() == g.size()); divisor_transform(f); divisor_transform(g); for (size_t i = 0; i < f.size(); i++) f[i] *= g[i]; inverse_divisor_transform(f); return f; } } // namespace gcd_convolution /** * @brief $\gcd$ convolution (添字 $\gcd$ 畳み込み) * @docs docs/convolution/gcd_convolution.md */ const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; using mint = modint<1000000007>; const int MAX_H = 3000010; int main() { cin.tie(0); ios::sync_with_stdio(false); int H, W; cin >> H >> W; vector<mint> a(MAX_H, 0), b(MAX_H, 0); for (int i = 0; i < H; i++) a[i] = (H - i) * (i > 0 ? 2 : 1); for (int i = 0; i < W; i++) b[i] = (W - i) * (i > 0 ? 2 : 1); auto c = gcd_convolution::gcd_convolution(a, b); mint ans = c[1] / 2; cout << ans << '\n'; return 0; }