#571529 (C++17) No.886 Direct

提出ソース

結果

問題	No.886 Direct
ユーザー	cn_449
提出日時	2020-10-25 18:15:50
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,113 ms / 4,000 ms
コード長	5,173 bytes
コンパイル時間	1,435 ms
コンパイル使用メモリ	136,776 KB
実行使用メモリ	15,072 KB
最終ジャッジ日時	2024-07-21 20:54:12
合計ジャッジ時間	13,520 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 14,976 KB
testcase_01	AC	49 ms 14,940 KB
testcase_02	AC	57 ms 14,848 KB
testcase_03	AC	54 ms 15,000 KB
testcase_04	AC	49 ms 14,848 KB
testcase_05	AC	48 ms 14,976 KB
testcase_06	AC	49 ms 14,848 KB
testcase_07	AC	49 ms 14,932 KB
testcase_08	AC	49 ms 14,956 KB
testcase_09	AC	50 ms 14,896 KB
testcase_10	AC	54 ms 15,072 KB
testcase_11	AC	48 ms 14,972 KB
testcase_12	AC	48 ms 14,976 KB
testcase_13	AC	48 ms 14,896 KB
testcase_14	AC	48 ms 14,832 KB
testcase_15	AC	49 ms 14,912 KB
testcase_16	AC	50 ms 14,948 KB
testcase_17	AC	49 ms 14,976 KB
testcase_18	AC	53 ms 14,976 KB
testcase_19	AC	53 ms 14,932 KB
testcase_20	AC	58 ms 14,848 KB
testcase_21	AC	50 ms 14,940 KB
testcase_22	AC	55 ms 14,956 KB
testcase_23	AC	507 ms 14,940 KB
testcase_24	AC	370 ms 14,932 KB
testcase_25	AC	168 ms 14,888 KB
testcase_26	AC	456 ms 14,960 KB
testcase_27	AC	588 ms 14,920 KB
testcase_28	AC	942 ms 14,848 KB
testcase_29	AC	1,060 ms 14,828 KB
testcase_30	AC	55 ms 14,848 KB
testcase_31	AC	1,062 ms 14,904 KB
testcase_32	AC	1,057 ms 14,932 KB
testcase_33	AC	1,061 ms 14,976 KB
testcase_34	AC	1,059 ms 14,976 KB
testcase_35	AC	1,113 ms 14,760 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
template<class T> using prique = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 };
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }
template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

constexpr ll mod = mod1e9;
template <int mod> class modint {
public:
	int n;
	modint() : n(0) {};
	modint(ll n_) {
		n = n_ % mod;
		if (n < 0) n += mod;
	}
	modint operator -() const { return n > 0 ? mod - n : -n; }
	bool operator == (const modint &m) const { return n == m.n; }
	bool operator != (const modint &m) const { return n != m.n; }
	modint &operator += (const modint &m) { n += m.n; if (n >= mod) n -= mod; return *this; }
	modint &operator -= (const modint &m) { n -= m.n; if (n < 0) n += mod; return *this; }
	modint &operator *= (const modint &m) { n = ll(n) * m.n % mod; return *this; }
	modint &operator /= (const modint &m) { n = ll(n) * modinv(m).n % mod; return *this; }
	modint operator +(modint m) const { return modint(*this) += m; }
	modint operator -(modint m) const { return modint(*this) -= m; }
	modint operator *(modint m) const { return modint(*this) *= m; }
	modint operator /(modint m) const { return modint(*this) /= m; }
	modint &operator ++ () { *this += 1; return *this; }
	modint operator ++ (int) { *this += 1; return *this - 1; }
	modint &operator -- () { *this -= 1; return *this; }
	modint operator -- (int) { *this -= 1; return *this + 1; }
	modint pow(ll b) const {
		modint res = 1, a = modint(*this);
		while (b) {
			if (b & 1) res *= a;
			a *= a;
			b >>= 1;
		}
		return res;
	}
	friend istream &operator >> (istream &s, modint<mod> &a) { s >> a.n; return s; }
	friend ostream &operator << (ostream &s, modint<mod> &a) { s << a.n; return s; }
};

using mint = modint<mod>;
vector<mint> fac, inv, facinv;

mint modinv(mint x) {
	ll a = x.n;
	if (a == 0) abort();
	if (a < (ll)inv.size()) return inv[a];
	ll b = mod, u = 1, v = 0;
	while (b) {
		ll t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	mint res = u;
	return res;
}

void modcalc(int n) {
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = -inv[mod % i] * (mod / i);
		facinv[i] = facinv[i - 1] * inv[i];
	}
}

mint comb(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[k] * facinv[n - k];
}

mint perm(ll n, ll k) {
	if (n < 0 || k < 0 || n < k) return 0;
	return fac[n] * facinv[n - k];
}

mint hom(ll n, ll k) {
	if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}

const int N = 3 * ten(6) + 10;
vector<int> prime(N);

void init() {
	for (int i = 2; i < N; i++) {
		if (prime[i] == 0) {
			for (int j = i; j < N; j += i) {
				prime[j] = i;
			}
		}
	}
}

int main() {
	init();
	ll h, w;
	cin >> h >> w;
	mint ans = h * (w - 1) + w * (h - 1);
	for (ll i = 1; i < h; i++) {
		vector<int> f;
		int tmp = i;
		while (prime[tmp] != 0) {
			int p = prime[tmp];
			f.pb(p);
			while (tmp % p == 0) tmp /= p;
		}
		int sz = f.size();
		rep(j, 1 << sz) {
			int b = 1;
			int pcnt = 0;
			rep(k, sz) {
				if (j >> k & 1) {
					b *= f[k];
					pcnt ^= 1;
				}
			}
			ll cnt = w / b;
			ll tsum = w * cnt - cnt * (cnt + 1) / 2 * b;
			mint sum = tsum * 2;
			sum *= (h - i);
			if (pcnt & 1) ans -= sum;
			else ans += sum;
		}
	}
	cout << ans << '\n';
}

yukicoder

結果

テストケース

ソースコード