結果
| 問題 | No.1261 数字集め |
| ユーザー |
 emthrm
|
| 提出日時 | 2020-10-18 17:56:46 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,872 ms / 8,000 ms |
| コード長 | 5,586 bytes |
| コンパイル時間 | 5,429 ms |
| コンパイル使用メモリ | 208,280 KB |
| 最終ジャッジ日時 | 2025-01-15 11:38:33 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 94 |
ソースコード
#define _USE_MATH_DEFINES#include <bits/stdc++.h>using namespace std;#define FOR(i,m,n) for(int i=(m);i<(n);++i)#define REP(i,n) FOR(i,0,n)#define ALL(v) (v).begin(),(v).end()using ll = long long;constexpr int INF = 0x3f3f3f3f;constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;constexpr double EPS = 1e-8;constexpr int MOD = 1000000007;// constexpr int MOD = 998244353;constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }struct IOSetup {IOSetup() {cin.tie(nullptr);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} iosetup;template <int MOD>struct MInt {unsigned val;MInt(): val(0) {}MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}static int get_mod() { return MOD; }static void set_mod(int divisor) { assert(divisor == MOD); }MInt pow(long long exponent) const {MInt tmp = *this, res = 1;while (exponent > 0) {if (exponent & 1) res *= tmp;tmp *= tmp;exponent >>= 1;}return res;}MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }MInt &operator/=(const MInt &x) {// assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);unsigned a = x.val, b = MOD; int u = 1, v = 0;while (b) {unsigned tmp = a / b;std::swap(a -= tmp * b, b);std::swap(u -= tmp * v, v);}return *this *= u;}bool operator==(const MInt &x) const { return val == x.val; }bool operator!=(const MInt &x) const { return val != x.val; }bool operator<(const MInt &x) const { return val < x.val; }bool operator<=(const MInt &x) const { return val <= x.val; }bool operator>(const MInt &x) const { return val > x.val; }bool operator>=(const MInt &x) const { return val >= x.val; }MInt &operator++() { if (++val == MOD) val = 0; return *this; }MInt operator++(int) { MInt res = *this; ++*this; return res; }MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }MInt operator--(int) { MInt res = *this; --*this; return res; }MInt operator+() const { return *this; }MInt operator-() const { return MInt(val ? MOD - val : 0); }MInt operator+(const MInt &x) const { return MInt(*this) += x; }MInt operator-(const MInt &x) const { return MInt(*this) -= x; }MInt operator*(const MInt &x) const { return MInt(*this) *= x; }MInt operator/(const MInt &x) const { return MInt(*this) /= x; }friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }};namespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }template <int MOD>struct Combinatorics {using ModInt = MInt<MOD>;int val; // "val!" and "mod" must be disjoint.std::vector<ModInt> fact, fact_inv, inv;Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {fact[0] = 1;for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;fact_inv[val] = ModInt(1) / fact[val];for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];}ModInt nCk(int n, int k) const {if (n < 0 || n < k || k < 0) return 0;assert(n <= val && k <= val);return fact[n] * fact_inv[k] * fact_inv[n - k];}ModInt nPk(int n, int k) const {if (n < 0 || n < k || k < 0) return 0;assert(n <= val);return fact[n] * fact_inv[n - k];}ModInt nHk(int n, int k) const {if (n < 0 || k < 0) return 0;return k == 0 ? 1 : nCk(n + k - 1, k);}};using ModInt = MInt<MOD>;ModInt solve(int a, int b, int c, int m) {vector<int> d{a, b, c};sort(ALL(d));int x = d[0], y = d[1], z = d[2];if (x == z) {return ModInt(x).pow(m) * (m + 1) * (m + 2) / 2;} else if (x == y) {return (ModInt(x).pow(m + 1) * (ModInt(m + 1) * x - ModInt(m + 2) * z) + ModInt(z).pow(m + 2)) / ModInt(x - z).pow(2);} else if (y == z) {return (ModInt(x).pow(m + 2) - ModInt(y).pow(m + 1) * (ModInt(m + 1) * y - ModInt(m + 2) * x)) / ModInt(x - y).pow(2);} else {return (ModInt(x).pow(m + 2) * (y - z) + (ModInt(z).pow(m + 2) - ModInt(y).pow(m + 2)) * x + (ModInt(y).pow(m + 1) - ModInt(z).pow(m + 1)) * y *z) / (x - y) / (y - z) / (x - z);}}int main() {int n, m; cin >> n >> m;m -= 3;vector<int> a(n + 1); FOR(i, 2, n + 1) cin >> a[i], --a[i];vector<bool> to_n(n, false);FOR(i, 3, n) to_n[i] = n % i == 0;vector<vector<int>> from(n);ModInt ans = 0;FOR(i, 2, n) for (int j = i * 2; j < n; j += i) {from[j].emplace_back(i);if (to_n[j]) ans += solve(a[i], a[j], a[n], m);}cout << ans << '\n';int q; cin >> q;while (q--) {int x, y; cin >> x >> y;if (y == n) {to_n[x] = true;for (int e : from[x]) ans += solve(a[e], a[x], a[n], m);} else {from[y].emplace_back(x);if (to_n[y]) ans += solve(a[x], a[y], a[n], m);}cout << ans << '\n';}return 0;}