#555872 (C++17) No.493 とても長い数列と文字列(Long Long Sequence and a String）

• 問題: No.493 とても長い数列と文字列(Long Long Sequence and a String）
• ユーザー: SHIJOU
• 提出日時: 2020-09-19 19:48:52
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2 ms / 800 ms
• コード長: 3,812 bytes
• コンパイル時間: 2,003 ms
• コンパイル使用メモリ: 202,124 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-09-05 22:53:26
• 合計ジャッジ時間: 7,997 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	1 ms; 4,376 KB
testcase_02	AC	2 ms; 4,376 KB
testcase_03	AC	2 ms; 4,376 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	1 ms; 4,376 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	1 ms; 4,376 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	2 ms; 4,380 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	2 ms; 4,376 KB
testcase_13	AC	1 ms; 4,376 KB
testcase_14	AC	1 ms; 4,376 KB
testcase_15	AC	1 ms; 4,376 KB
testcase_16	AC	2 ms; 4,376 KB
testcase_17	AC	2 ms; 4,376 KB
testcase_18	AC	2 ms; 4,376 KB
testcase_19	AC	1 ms; 4,380 KB
testcase_20	AC	2 ms; 4,376 KB
testcase_21	AC	1 ms; 4,376 KB
testcase_22	AC	1 ms; 4,376 KB
testcase_23	AC	2 ms; 4,376 KB
testcase_24	AC	2 ms; 4,380 KB
testcase_25	AC	2 ms; 4,376 KB
testcase_26	AC	1 ms; 4,376 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	1 ms; 4,380 KB
testcase_29	AC	1 ms; 4,376 KB
testcase_30	AC	2 ms; 4,376 KB
testcase_31	AC	1 ms; 4,376 KB
testcase_32	AC	1 ms; 4,380 KB
testcase_33	AC	1 ms; 4,376 KB
testcase_34	AC	2 ms; 4,380 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	1 ms; 4,376 KB
testcase_37	AC	1 ms; 4,376 KB
testcase_38	AC	1 ms; 4,376 KB
testcase_39	AC	1 ms; 4,376 KB
testcase_40	AC	1 ms; 4,380 KB
testcase_41	AC	1 ms; 4,376 KB
testcase_42	AC	1 ms; 4,376 KB
testcase_43	AC	1 ms; 4,376 KB
testcase_44	AC	1 ms; 4,376 KB
testcase_45	AC	2 ms; 4,376 KB
testcase_46	AC	2 ms; 4,380 KB
testcase_47	AC	1 ms; 4,376 KB
testcase_48	AC	1 ms; 4,376 KB
testcase_49	AC	1 ms; 4,376 KB
testcase_50	AC	1 ms; 4,380 KB
testcase_51	AC	1 ms; 4,376 KB
testcase_52	AC	1 ms; 4,376 KB
testcase_53	AC	1 ms; 4,376 KB
testcase_54	AC	2 ms; 4,380 KB
testcase_55	AC	1 ms; 4,376 KB
testcase_56	AC	2 ms; 4,380 KB
testcase_57	AC	1 ms; 4,380 KB
testcase_58	AC	2 ms; 4,376 KB
testcase_59	AC	2 ms; 4,376 KB
testcase_60	AC	1 ms; 4,376 KB
testcase_61	AC	1 ms; 4,376 KB
testcase_62	AC	1 ms; 4,376 KB
testcase_63	AC	1 ms; 4,380 KB
testcase_64	AC	2 ms; 4,376 KB
testcase_65	AC	1 ms; 4,376 KB
testcase_66	AC	1 ms; 4,376 KB
testcase_67	AC	2 ms; 4,380 KB
testcase_68	AC	1 ms; 4,380 KB
testcase_69	AC	2 ms; 4,380 KB
testcase_70	AC	1 ms; 4,376 KB
testcase_71	AC	1 ms; 4,380 KB
testcase_72	AC	1 ms; 4,376 KB
testcase_73	AC	1 ms; 4,376 KB
testcase_74	AC	1 ms; 4,376 KB
testcase_75	AC	1 ms; 4,376 KB
testcase_76	AC	2 ms; 4,380 KB
testcase_77	AC	2 ms; 4,384 KB
testcase_78	AC	1 ms; 4,380 KB
testcase_79	AC	1 ms; 4,376 KB
testcase_80	AC	2 ms; 4,380 KB
testcase_81	AC	1 ms; 4,380 KB
testcase_82	AC	2 ms; 4,380 KB
testcase_83	AC	2 ms; 4,376 KB
testcase_84	AC	1 ms; 4,376 KB
testcase_85	AC	1 ms; 4,376 KB
testcase_86	AC	2 ms; 4,376 KB
testcase_87	AC	1 ms; 4,380 KB
testcase_88	AC	2 ms; 4,376 KB
testcase_89	AC	1 ms; 4,376 KB
testcase_90	AC	1 ms; 4,380 KB
testcase_91	AC	1 ms; 4,380 KB
testcase_92	AC	1 ms; 4,376 KB
testcase_93	AC	1 ms; 4,376 KB
testcase_94	AC	2 ms; 4,380 KB
testcase_95	AC	1 ms; 4,380 KB
testcase_96	AC	1 ms; 4,380 KB
testcase_97	AC	1 ms; 4,376 KB
testcase_98	AC	1 ms; 4,380 KB
testcase_99	AC	1 ms; 4,380 KB
testcase_100	AC	2 ms; 4,376 KB
testcase_101	AC	1 ms; 4,376 KB
testcase_102	AC	1 ms; 4,380 KB
testcase_103	AC	2 ms; 4,376 KB
testcase_104	AC	2 ms; 4,376 KB
testcase_105	AC	1 ms; 4,380 KB
testcase_106	AC	1 ms; 4,376 KB
testcase_107	AC	1 ms; 4,380 KB
testcase_108	AC	1 ms; 4,380 KB
testcase_109	AC	2 ms; 4,380 KB
testcase_110	AC	2 ms; 4,380 KB
testcase_111	AC	2 ms; 4,376 KB
testcase_112	AC	1 ms; 4,376 KB
testcase_113	AC	2 ms; 4,380 KB
testcase_114	AC	2 ms; 4,380 KB
testcase_115	AC	1 ms; 4,380 KB
testcase_116	AC	1 ms; 4,376 KB
testcase_117	AC	1 ms; 4,376 KB
testcase_118	AC	2 ms; 4,380 KB

ソースコード

//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const unsigned int mod = 1000000007;
//const unsigned int mod = 998244353;

struct mint {
	unsigned int x;
	mint():x(0) {}
	mint(int64_t x_) {
		int64_t v = int64_t(x_ % mod);
		if(v < 0) v += mod;
		x = (unsigned int)v;
	}
	static mint row(int v) {
		mint v_;
		v_.x = v;
		return v_;
	}
	mint operator-() const { return mint(-x);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		uint64_t z = x;
		z *= a.x;
		x = (unsigned int)(z % mod);
		return *this;
	}
	mint operator+(const mint a) const { return mint(*this) += a;}
	mint operator-(const mint a) const { return mint(*this) -= a;}
	mint operator*(const mint a) const { return mint(*this) *= a;}
	friend bool operator==(const mint &a, const mint &b) {return a.x == b.x;}
	friend bool operator!=(const mint &a, const mint &b) {return a.x != b.x;}
	mint &operator++() {
		x++;
		if(x == mod) x = 0;
		return *this;
	}
	mint &operator--() {
		if(x == 0) x = mod;
		x--;
		return *this;
	}
	mint operator++(int) {
		mint result = *this;
		++*this;
		return result;
	}
	mint operator--(int) {
		mint result = *this;
		--*this;
		return result;
	}
	mint pow(int64_t t) const {
		mint x_ = *this, r = 1;
		while(t) {
			if(t&1) r *= x_;
			x_ *= x_;
			t >>= 1;
		}
		return r;
	}
	//for prime mod
	mint inv() const { return pow(mod-2);}
	mint& operator/=(const mint a) { return *this *= a.inv();}
	mint operator/(const mint a) {return mint(*this) /= a;}
};

istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

#define U 61

//head

int k;
ll l, r, u[U], sum[U];
mint prod[U];

pair<ll, mint> calc(ll C, int k) {
	if(!C) return {0, 1};
	ll *itr = lower_bound(u, u+U, C);
	int z = itr-u;
	if(z > k) return {-1, -1};
	string s = to_string(z*z);
	int siz = s.size();
	pair<ll, mint> res = {sum[z-1], prod[z-1]};
	C -= u[z-1];
	if(C < siz) {
		rep(i, C) {
			int h = (s[i] == '0'?10:s[i]-'0');
			res.first += h;
			res.second *= h;
		}
		return res;
	}
	rep(i, siz) {
		int h = (s[i] == '0'?10:s[i]-'0');
		res.first += h;
		res.second *= h;
	}
	auto [_, __] = calc(C-siz, k);
	res.first += _;
	res.second *= __;
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> k >> l >> r;
	fill(prod, prod+U, mint(1));
	for(int i = 1; i < U; i++) {
		string z = to_string(i*i);
		int siz = z.size();
		u[i] = siz + u[i-1]*2;
		rep(j, siz) sum[i] += (z[j] == '0'?10:z[j]-'0');
		sum[i] += sum[i-1]<<1;
		rep(j, siz) prod[i] *= (z[j] == '0'?10:z[j]-'0');
		prod[i] *= prod[i-1]*prod[i-1];
	}
	auto [s1, p1] = calc(l-1, k);
	auto [s2, p2] = calc(r, k);
	if(s2 == -1) cout << s2 << endl;
	else cout << make_pair(s2-s1, p2/p1) << endl;
}