結果
| 問題 | No.1086 桁和の桁和2 |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-06-19 22:32:13 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,978 bytes |
| コンパイル時間 | 1,507 ms |
| コンパイル使用メモリ | 172,432 KB |
| 実行使用メモリ | 12,808 KB |
| 最終ジャッジ日時 | 2024-07-03 15:07:08 |
| 合計ジャッジ時間 | 13,842 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,944 KB |
| testcase_02 | AC | 2 ms
6,944 KB |
| testcase_03 | AC | 1 ms
6,944 KB |
| testcase_04 | WA | - |
| testcase_05 | AC | 40 ms
6,944 KB |
| testcase_06 | AC | 2 ms
6,940 KB |
| testcase_07 | AC | 2 ms
6,940 KB |
| testcase_08 | WA | - |
| testcase_09 | AC | 2 ms
6,944 KB |
| testcase_10 | AC | 25 ms
6,940 KB |
| testcase_11 | AC | 8 ms
6,940 KB |
| testcase_12 | AC | 3 ms
6,944 KB |
| testcase_13 | AC | 31 ms
6,940 KB |
| testcase_14 | AC | 21 ms
6,944 KB |
| testcase_15 | AC | 94 ms
6,944 KB |
| testcase_16 | AC | 548 ms
10,088 KB |
| testcase_17 | AC | 47 ms
6,944 KB |
| testcase_18 | WA | - |
| testcase_19 | AC | 614 ms
10,756 KB |
| testcase_20 | AC | 78 ms
6,944 KB |
| testcase_21 | AC | 531 ms
9,968 KB |
| testcase_22 | AC | 753 ms
12,560 KB |
| testcase_23 | AC | 457 ms
9,012 KB |
| testcase_24 | AC | 327 ms
7,348 KB |
| testcase_25 | AC | 632 ms
11,072 KB |
| testcase_26 | AC | 541 ms
9,652 KB |
| testcase_27 | AC | 386 ms
8,012 KB |
| testcase_28 | AC | 314 ms
7,064 KB |
| testcase_29 | WA | - |
| testcase_30 | AC | 786 ms
12,772 KB |
| testcase_31 | AC | 790 ms
12,720 KB |
| testcase_32 | WA | - |
| testcase_33 | AC | 779 ms
12,652 KB |
| testcase_34 | AC | 782 ms
12,704 KB |
| testcase_35 | AC | 40 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) { \
if (a[_i][_j] <= -INF / 2) cerr << '-'; \
if (abs(a[_i][_j]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i][_j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) { \
if (_i) cerr << sp; \
if (a[_i] <= -INF / 2) cerr << '-'; \
if (abs(a[_i]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
signed main() {
ll N;
cin >> N;
ll L[N], R[N], D[N];
rep(i, N) cin >> L[i];
rep(i, N) cin >> R[i];
rep(i, N) cin >> D[i];
if (accumulate(D, D + N, 0LL) == 0) {
return puts("1") & 0;
} else if (count(D, D + N, 0LL) != 0) {
return puts("0") & 0;
}
rep(i, N) D[i] %= 9;
ll DP[N + 1][9];
rep(i, N + 1) rep(j, 9) DP[i][j] = 0;
DP[0][0] = 1;
rep(i, N) rep(j, 9) rep(k, 9) {
if ((j + k) % 9 != D[i]) continue;
ll cnt = mpow(10, R[i]) - mpow(10, L[i]);
cnt %= MOD;
cnt += MOD;
cnt *= inv(9);
cnt %= MOD;
if (k == 0) cnt = (cnt + 1) % MOD;
DP[i + 1][(j + k) % 9] += cnt * DP[i][j];
DP[i + 1][(j + k) % 9] %= MOD;
}
cout << DP[N][D[N - 1]] << rt;
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined