結果
| 問題 | No.1261 数字集め |
| ユーザー |
 heno239
|
| 提出日時 | 2020-10-16 23:01:39 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,566 bytes |
| コンパイル時間 | 1,668 ms |
| コンパイル使用メモリ | 118,284 KB |
| 最終ジャッジ日時 | 2025-01-27 22:50:22 |
| 合計ジャッジ時間 | 8,655 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bits/locale_classes.h:40,
from /usr/include/c++/13/bits/ios_base.h:41,
from /usr/include/c++/13/ios:44,
from /usr/include/c++/13/ostream:40,
from /usr/include/c++/13/iostream:41,
from main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = int]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/vector:66,
from main.cpp:7:
/usr/include/c++/13/bits/stl_vector.h:133:14: note: called from here
133 | struct _Vector_impl
| ^~~~~~~~~~~~
ソースコード
#pragma GCC optimize("Ofast")#pragma GCC target ("sse4")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 21;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}typedef array<modint,4> vec;using mat = array<vec, 4>;mat mtmul(mat& A, mat& B) {mat C;rep(i, 4) {rep(k, 4) {rep(j, 4) {C[i][j] += A[i][k] * B[k][j];}}}return C;}mat mtpow(mat A, ll n) {mat B;rep(i,4) {B[i][i] = 1;}while (n > 0) {if (n & (ll)1)B = mtmul(B, A);A = mtmul(A, A);n >>= 1;}return B;}int mebius[1 << 20];vector<int> chcnt(1 << 20);int loc[1 << 20];vector<int> ch[1 << 20];bool isp[1 << 20];void init() {fill(isp + 2, isp + (1 << 20), true);fill(mebius, mebius + (1 << 20), 1);for (int i = 2; i < (1 << 20); i++) {if (!isp[i])continue;mebius[i] *= -1;for (int j = 2 * i; j < (1 << 20); j += i) {isp[j] = false;mebius[j] *= -1;if ((j / i) % i == 0) {mebius[j] = 0;}}}for (int i = 2; i < (1 << 20); i++) {for (int j = i; j < (1 << 20); j += i) {chcnt[j]++;}}for (int i = 2; i < (1 << 20); i++)ch[i].resize(chcnt[i]);for (int i = 2; i < (1 << 20); i++) {for (int j = i; j < (1 << 20); j += i) {ch[j][loc[j]]= i; loc[j]++;}}}void solve() {int n, m; cin >> n >> m;vector<int> a(n + 1);for (int i = 2; i <= n; i++)cin >> a[i];modint ans = 0;for (int j = 2; j < n; j++) {if (n % j)continue;for (int d : ch[j])if(d>1&&d<j) {mat mt = array<vec,4>{ vec{0,1,0,0},vec{0,a[n] - 1,1,0},vec{0,0,a[j] - 1,1},vec{0,0,0,a[d]-1} };mt = mtpow(mt, m);ans += mt[0][3];//cout << d << " " << j << " " << mt[0][3] << "\n";}}cout << ans << "\n";vector<bool> canend(n+1);rep1(i, n)if (n % i == 0)canend[i] = true;int q; cin >> q;rep(i, q) {int l, r; cin >> l >> r;if (r == n) {for (int d : ch[l])if(d>1&&d<l) {mat mt = array<vec, 4>{ vec{ 0,1,0,0 }, vec{ 0,a[n] - 1,1,0 }, vec{ 0,0,a[l] - 1,1 }, vec{ 0,0,0,a[d] - 1 } };mt = mtpow(mt, m);ans += mt[0][3];}canend[l] = true;}else {if (canend[r]) {mat mt = array<vec, 4>{ vec{ 0,1,0,0 }, vec{ 0,a[n] - 1,1,0 }, vec{ 0,0,a[r] - 1,1 }, vec{ 0,0,0,a[l] - 1 } };mt = mtpow(mt, m);ans += mt[0][3];}ch[r].push_back(l);}cout << ans << "\n";}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(15);//init_f();init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}