結果
| 問題 | No.1269 I hate Fibonacci Number |
| ユーザー |
 heno239
|
| 提出日時 | 2020-10-23 23:53:28 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 826 ms / 3,000 ms |
| コード長 | 4,805 bytes |
| コンパイル時間 | 1,551 ms |
| コンパイル使用メモリ | 124,644 KB |
| 実行使用メモリ | 15,616 KB |
| 最終ジャッジ日時 | 2024-07-21 13:54:47 |
| 合計ジャッジ時間 | 7,345 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
ソースコード
#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<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 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 << 18;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];}struct uf {private:vector<int> par, ran,cnt;public:uf(int n) {par.resize(n, 0);ran.resize(n, 0);cnt.resize(n, 1);rep(i, n) {par[i] = i;}}int find(int x) {if (par[x] == x)return x;else return par[x] = find(par[x]);}void unite(int x, int y) {x = find(x), y = find(y);if (x == y)return;if (ran[x] < ran[y]) {par[x] = y; cnt[y] += cnt[x];}else {par[y] = x; cnt[x] += cnt[y];if (ran[x] == ran[y])ran[x]++;}}bool same(int x, int y) {return find(x) == find(y);}int takecnt(int x) {return cnt[find(x)];}};modint cdp[5001][100][2];modint sums[5001][2];modint dp[5001][2];void solve() {int n; ll l, r; cin >> n >> l >> r;vector<ll> v;v.push_back(1); v.push_back(1);while (v.back() <= r) {v.push_back(v[v.size() - 2] + v[v.size() - 1]);}vector<string> f;for (int i = 1; i < v.size(); i++) {if (l <= v[i] && v[i] <= r)f.push_back(to_string(v[i]));}vector<string> nf;for(string s:f) {bool valid = true;for (string t : nf) {rep(k, s.size() - t.size() + 1) {string u = s.substr(k, t.size());if (u == t)valid = false;}}if (valid)nf.push_back(s);}rep(i, nf.size()) {cdp[nf[i].size()][i][1] = 1;}rep(i, n)rep(j, nf.size())rep(k, 2) {if (cdp[i][j][k] == (modint)0)continue;string las = nf[j];rep(t, nf.size()) {for (int loc = 1; loc < las.size(); loc++) {bool valid = true;string sloc = las.substr(loc, las.size() - loc);if (sloc.size() >= nf[t].size())continue;rep(x, sloc.size())if (sloc[x] != nf[t][x])valid = false;if (valid) {int ni = i + nf[t].size() - sloc.size();if (ni <= n) {cdp[ni][t][k ^ 1] += cdp[i][j][k];}}}}}rep(i, n + 1)rep(j, nf.size())rep(k, 2)sums[i][k] += cdp[i][j][k];dp[0][0] = 1;rep(i, n)rep(j, 2) {dp[i + 1][j] += dp[i][j] * (modint)10;for (int x = 1; i + x <= n; x++) {rep(k, 2) {dp[i + x][j ^ k] += dp[i][j] * sums[x][k];}}}modint ans = dp[n][0] - dp[n][1]; ans -= 1;cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}