結果

問題 No.1407 Kindness
ユーザー mjtaimjtai
提出日時 2021-02-26 22:27:03
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 6,479 bytes
コンパイル時間 2,082 ms
コンパイル使用メモリ 211,012 KB
最終ジャッジ日時 2025-01-19 05:50:42
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define S static
#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef __int128_t ll128;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;
///////////////////////////////////////////////////////////////////////////////
template <typename TT, typename T>
void incr_m(map<TT, T> &m, TT k)
{
if (m.find(k) == m.end()) m[k] = 0;
m[k]++;
}
void llin(ll &a)
{
CIN(a);
}
void llinl1(V<ll> &v, ll count)
{
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(V<t2> &v, ll count)
{
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(V<t3> &v, ll count)
{
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(V<t4> &v, ll count)
{
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(V<ll> &v, ll count)
{
llinl1(v, count);
}
template <typename T>
void sort(V<T> &v)
{
sort(v.begin(), v.end());
}
template <typename T>
void sort_reverse(V<T> &v)
{
sort(v.begin(), v.end(), greater<T>());
}
t2 _ext_gcd(ll a, ll b, ll g)
{
if (!b) return t2(1, 0);
ll q = a / b;
ll r = a % b;
t2 sol = _ext_gcd(b, r, g);
ll sx = get<0>(sol);
ll sy = get<1>(sol);
ll x = sy;
ll y = sx - q * sy;
return t2(x, y);
}
t2 ext_gcd(ll a, ll b)
{
return _ext_gcd(a, b, gcd(a, b));
}
// x and mod must be coprime
ll mod_inv(ll x, ll mod)
{
t2 result = ext_gcd(x, mod);
ll ret = get<0>(result);
while (ret < 0) ret += mod;
ret %= mod;
return ret;
}
ll msec()
{
struct timeval tv;
gettimeofday(&tv, NULL);
ll ret = 0;
ret += tv.tv_sec * 1000LL;
ret += tv.tv_usec / 1000LL;
return ret;
}
template <typename T>
void _debug_print(T x)
{
cout << x << " ";
}
void _debug_print(const t2 &x)
{
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "(" << x1 << ", " << x2 << ") ";
}
void _debug_print(const t3 &x)
{
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "(" << x1 << ", " << x2 << ", " << x3 << ") ";
}
void _debug_print(const t4 &x)
{
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "(" << x1 << ", " << x2 << ", " << x3 << ", " << x4 << ") ";
}
template <typename T>
void _debug_print(T xarray[], ll n)
{
rep (i, n) _debug_print(xarray[i]);
cout << endl;
}
template <typename T>
void _debug_print(const V<T> &xlist)
{
for (auto x : xlist) _debug_print(x);
cout << endl;
}
template <typename T>
void _debug_print(const set<T> &xset)
{
for (auto x : xset) _debug_print(x);
cout << endl;
}
template <typename TT, typename T>
void _debug_print(const map<TT, T> &xlist)
{
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "K=";
_debug_print(k);
cout << " V=";
_debug_print(v);
cout << endl;
}
}
#define MOD (1000000007LL)
// #define MOD (998244353LL)
// O(log(exp))
ll mod_pow(ll base, ll exp, ll mod)
{
ll ret = 1LL;
for ( ; exp; ) {
if (exp & 1LL) {
ret *= base;
ret %= mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return ret;
}
ull mod_combination(ll x, ll y, ll mod)
{
if (y > x / 2LL) y = x - y;
ll ret = 1;
for (ll i = 0LL; i < y; ++i) {
ret = (ret * x--) % mod;
ret = (ret * mod_inv(i + 1LL, mod)) % mod;
}
return ret;
}
void make_factorial(ll factorials[], ll inv_factorials[], ll size, ll mod)
{
factorials[0] = 1LL;
srep (i, 1, size) {
factorials[i] = factorials[i-1] * i;
factorials[i] %= mod;
}
inv_factorials[size-1] = mod_inv(factorials[size-1], mod);
rrep (i, size-1) {
inv_factorials[i] = inv_factorials[i+1LL] * (i+1LL);
inv_factorials[i] %= mod;
}
}
#if 0
S ll factorials[200010];
S ll inv_factorials[200010];
make_factorial(factorials, inv_factorials, 200010, MOD);
#endif
///////////////////////////////////////////////////////////////////////////////
void _main();
int main()
{
cout << setprecision(12);
#if !DEBUG
ios::sync_with_stdio(false);
cin.tie(0);
#endif
_main();
return 0;
}
#define SZ (100010LL)
;
void _main()
{
string sn; CIN(sn);
ll len = sn.size();
S ll basecnts[SZ];
basecnts[0] = 1;
srep (i, 1, SZ) {
basecnts[i] = basecnts[i-1] * 45LL;
basecnts[i] %= MOD;
}
ll ans = 0;
srep (i, 1, len) {
ans += basecnts[i];
ans %= MOD;
}
ll now = len-1LL;
ll base = 1;
for (auto c : sn) {
ll d = c - '0';
// if (!d) break;
ll coef = (d * (d-1LL) / 2LL);
ll incr = coef * basecnts[now];
incr %= MOD;
debug_printf("incr 1 = %lld\n", incr);
incr *= base;
incr %= MOD;
debug_printf("incr 2 = %lld\n", incr);
ans += incr;
ans %= MOD;
base *= d;
base %= MOD;
now--;
}
debug_printf("last base = %lld\n", base);
ans += base;
ans %= MOD;
cout << ans << endl;
}
///////////////////////////////////////////////////////////////////////////////
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0