結果
| 問題 | No.493 とても長い数列と文字列(Long Long Sequence and a String） |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2017-03-11 00:39:37 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 800 ms |
| コード長 | 6,146 bytes |
| コンパイル時間 | 1,144 ms |
| コンパイル使用メモリ | 113,920 KB |
| 実行使用メモリ | 6,948 KB |
| 最終ジャッジ日時 | 2024-06-24 09:19:11 |
| 合計ジャッジ時間 | 3,830 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 115 |
ソースコード
#include <iostream>#include <vector>#include <cstdio>#include <sstream>#include <map>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <functional>#include <set>#include <ctime>#include <random>#include <chrono>#include <cassert>#include <tuple>#include <utility>using namespace std;namespace {using Integer = long long; //__int128;template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}template<class T> istream& operator , (istream& is, T& val){ return is >> val;}template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":""); return os;}template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}istream& operator >> (istream& is, __int128& x){static char buff[100];is >> buff;x = 0;size_t i = 0;if(buff[0] == '-') i++;for(; buff[i]; i++){x *= 10;x += buff[i]-'0';}if(buff[0] == '-') x *= -1;return is;}ostream& operator << (ostream& os, __int128 x){if(x==0) return os << 0;string s;if(x<0){os << "-";x *= -1;}while(x!=0){s += (x%10) + '0';x /= 10;}reverse(s.begin(), s.end());return os << s;}template<class H> void print(const H& head){ cout << head; }template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }template<class H> void eprint(const H& head){ cerr << head; }template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v),step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ?val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ returnrange_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } };inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexedmt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss <<v[i]; } return ss.str(); }inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }}constexpr long long mod = 9_ten + 7;long long dfs_sum(vector<__int128>& len, vector<__int128>& sum, long long l, bool rev){if(l == 0) return 0;long long k = 0;while( len[k+1] <= l ) k++;long long ret = sum[k];long long ll = len[k];k++;stringstream ss;ss << k*k;string tmp = ss.str();if(rev) reverse(tmp.begin(), tmp.end());for(int i=0; i<tmp.size() && ll<l; i++, ll++){ret += tmp[i]=='0' ? 10 : tmp[i] - '0';}if(ll < l){ret += dfs_sum(len, sum, l-ll, rev);}return ret;}long long dfs_pro(vector<__int128>& len, vector<__int128>& pro, long long l, bool rev){long long k = 0;while( len[k+1] <= l ) k++;long long ret = pro[k];long long ll = len[k];k++;stringstream ss;ss << k*k;string tmp = ss.str();if(rev) reverse(tmp.begin(), tmp.end());for(int i=0; i<tmp.size() && ll<l; i++, ll++){ret *= tmp[i]=='0' ? 10 : tmp[i] - '0';ret %= mod;}if(ll < l){(ret *= dfs_pro(len, pro, l-ll, rev)) %= mod;}return ret;}int main(){long long k,l,r;cin >> k,l,r;k = min(61LL, k);vector<__int128> len(k+1, 0);len[0] = 0;for(long long i=1; i<len.size(); i++){stringstream ss;ss << i*i;len[i] = len[i-1]*2 + ss.str().size();}vector<__int128> sum(k+1, 0);vector<__int128> pro(k+1, 1);for(long long i=1; i<sum.size(); i++){stringstream ss;ss << i*i;string tmp = ss.str();sum[i] = sum[i-1] * 2 + [&](){long long ret=0;for(auto c : tmp){ret += c=='0'?10 : c-'0';}return ret;}();pro[i] = pro[i-1] * pro[i-1] % mod * [&](){long long ret=1;for(auto c : tmp){ret *= c=='0'?10 : c-'0';ret %= mod;}return ret;}() % mod;}eprintln( join(len, "\n") );eprintln( join(sum, "\n") );eprintln( join(pro, "\n") );if( r>len.back() ){println(-1);return 0;}l--;long long ans_sum = sum[k];if(l!=0) ans_sum -= dfs_sum(len,sum, l, false);if(r!=len[k]) ans_sum -= dfs_sum(len,sum, len[k]-r, true);long long ans_pro = pro[k];if(l!=0) (ans_pro *= my_pow_mod( dfs_pro(len,pro, l, false) , mod-2, mod)) %= mod;if(r!=len[k]) (ans_pro *= my_pow_mod( dfs_pro(len,pro, len[k]-r, true) , mod-2, mod)) %= mod;println(ans_sum, ans_pro);return 0;}