結果
| 問題 | No.2703 FizzBuzz Letter Counting |
| コンテスト | |
| ユーザー |
 apricity
|
| 提出日時 | 2026-10-28 17:58:23 |
| 言語 | C++23 (gcc 15.3.0 + boost 1.92.0 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 40 ms / 3,000 ms |
| + 345µs | |
| コード長 | 8,674 bytes |
| 記録 | |
| コンパイル時間 | 2,203 ms |
| コンパイル使用メモリ | 269,076 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2026-10-28 17:58:31 |
| 合計ジャッジ時間 | 7,502 ms |
|
ジャッジサーバーID （参考情報） |
judge3_0 / judge5_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 59 |
ソースコード
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
# include "debug_print.hpp"
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep1(a) for(int i = 0; i < a; i++)
#define rep2(i, a) for(int i = 0; i < a; i++)
#define rep3(i, a, b) for(int i = a; i < b; i++)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a) for(int i = (a)-1; i >= 0; i--)
#define rrep2(i, a) for(int i = (a)-1; i >= 0; i--)
#define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--)
#define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using vvvvvc = vector<vvvvc<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
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 (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
cout << t;
outr(u...);
}
template<int mod> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % mod) {
if (val < 0) val += mod;
}
constexpr int getmod() { return mod; }
constexpr Fp operator - () const noexcept {
return val ? mod - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= mod) val -= mod;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += mod;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % mod;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
val = val * u % mod;
if (val < 0) val += mod;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept {
int val; is >> val;
x = Fp<mod>(val);
return is;
}
friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1) t = t * a;
return t;
}
};
//const int mod = 1e9+7;
const int mod = 998244353;
using mint = Fp<mod>;
int crt[3][5] = {
{0,6,12,3,9},
{10,1,7,13,4},
{5,11,2,8,14}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int m; in(m);
vector<ll> v,l;
ll maxlen = 0, digit_sum = 0;
ll len = 0, cur = -1;
mint n = 0;
rep(i,m){
ll vi,li; in(vi, li);
maxlen += li;
digit_sum += vi*li;
mint p = modpow(mint(10),li);
n = n * p + (p-1)/9 * vi;
if(vi == cur) len += li;
else {
if(len > 0) {
v.emplace_back(cur);
l.emplace_back(len);
}
cur = vi;
len = li;
}
}
if(len > 0) {
v.emplace_back(cur);
l.emplace_back(len);
}
if(maxlen == 1) {
mint ans = 0;
rep(i,1,v[0]+1) {
if(i%3 == 0 or i%5 == 0) ans += 4;
else ans += 1;
}
out(ans);
return 0;
}
mint p = modpow(mint(10),maxlen-1);
mint ans = p * (maxlen-1) - (p-1)/9;
ans += (n+1 - p) * maxlen;
ll mod3 = digit_sum % 3, mod5 = v.back() % 5;
ll mod15 = crt[mod3][mod5];
ans += ((n-mod3)/3 + (n-mod5)/5) * 4;
{
mint tmp = 0;
// 3,6,9,...
mint n1 = n-mod3;
bool ok = false;
if (digit_sum <= 3) {
if (digit_sum == 1) ok = true;
if (v.front() == 1 and v.back() < 3) {
ok |= digit_sum == v.front() + v.back();
}
}
ll maxlen1 = (ok ? maxlen-1 : maxlen);
mint q = modpow(mint(10), maxlen1-1);
tmp += (q*(maxlen1-1) - (q-1)/9) / 3;
tmp += ((n1-q-2)/3+1) * maxlen1;
ans -= tmp;
// out(3, tmp);
}
{
mint tmp = 0;
// 5,10,15,...
mint n1 = n-mod5;
ll maxlen1 = maxlen;
if(maxlen1 > 1) {
mint q = modpow(mint(10), maxlen1-1);
tmp += (q/5-1) * (maxlen1-1);
if(maxlen1 > 2) tmp -= ((q/10-1)/9 - (maxlen1-2))*2;
tmp += ((n1-q)/5+1) * maxlen1;
tmp -= maxlen-2;
}
else{
tmp = 1;
}
ans -= tmp;
// out(5, tmp);
}
{
mint tmp = 0;
// 15,30,45,...
mint n1 = n-mod15;
bool ok = false;
if (digit_sum <= 5) {
if (digit_sum == 1) ok = true;
if (v.front() == 1 and v.back() < 5) {
ok |= digit_sum == v.front() + v.back();
}
}
ll maxlen1 = (ok ? maxlen-1 : maxlen);
if(maxlen1 > 1){
mint q = modpow(mint(10), maxlen1-1);
tmp += ((q-10)/15) * (maxlen1-1);
if(maxlen1 > 2) tmp -= ((q/10-1)/9 - (maxlen1-2))*2/3;
tmp += ((n1-q-5)/15+1) * maxlen1;
}
else{
tmp = 0;
}
ans += tmp;
// out(15, tmp);
}
out(ans);
}