#983943 (C++17) No.2703 FizzBuzz Letter Counting

提出ソース

結果

問題	No.2703 FizzBuzz Letter Counting
ユーザー	apricity
提出日時	2024-05-28 18:02:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,323 bytes
コンパイル時間	1,337 ms
コンパイル使用メモリ	136,500 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-05-28 18:02:10
合計ジャッジ時間	5,575 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	63 ms 6,940 KB
testcase_04	WA	-
testcase_05	AC	10 ms 6,940 KB
testcase_06	AC	28 ms 6,944 KB
testcase_07	AC	49 ms 6,940 KB
testcase_08	WA	-
testcase_09	AC	55 ms 6,944 KB
testcase_10	AC	30 ms 6,940 KB
testcase_11	AC	4 ms 6,944 KB
testcase_12	AC	40 ms 6,940 KB
testcase_13	AC	15 ms 6,940 KB
testcase_14	AC	65 ms 6,944 KB
testcase_15	AC	63 ms 6,944 KB
testcase_16	AC	61 ms 6,940 KB
testcase_17	WA	-
testcase_18	AC	51 ms 6,944 KB
testcase_19	AC	37 ms 6,940 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	16 ms 6,944 KB
testcase_23	AC	69 ms 6,944 KB
testcase_24	AC	35 ms 6,944 KB
testcase_25	AC	39 ms 6,940 KB
testcase_26	AC	66 ms 6,940 KB
testcase_27	AC	58 ms 6,940 KB
testcase_28	AC	70 ms 6,940 KB
testcase_29	AC	72 ms 6,940 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	71 ms 6,940 KB
testcase_33	AC	72 ms 6,940 KB
testcase_34	AC	72 ms 6,940 KB
testcase_35	AC	84 ms 6,940 KB
testcase_36	AC	72 ms 6,944 KB
testcase_37	AC	73 ms 6,940 KB
testcase_38	AC	77 ms 6,940 KB
testcase_39	AC	70 ms 6,940 KB
testcase_40	AC	71 ms 6,940 KB
testcase_41	AC	72 ms 6,944 KB
testcase_42	AC	69 ms 6,944 KB
testcase_43	AC	1 ms 6,944 KB
testcase_44	AC	2 ms 6,944 KB
testcase_45	AC	2 ms 6,940 KB
testcase_46	AC	2 ms 6,940 KB
testcase_47	AC	2 ms 6,940 KB
testcase_48	AC	2 ms 6,940 KB
testcase_49	WA	-
testcase_50	AC	2 ms 6,940 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	2 ms 6,944 KB
testcase_53	AC	1 ms 6,944 KB
testcase_54	AC	2 ms 6,940 KB
testcase_55	AC	2 ms 6,940 KB
testcase_56	WA	-
testcase_57	AC	2 ms 6,940 KB
testcase_58	AC	1 ms 6,940 KB
testcase_59	AC	2 ms 6,940 KB
testcase_60	AC	1 ms 6,940 KB
testcase_61	AC	2 ms 6,940 KB
testcase_62	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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,4,13},
    {5,11,2,8,14}
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int m; in(m);
    vector<ll> v(m),l(m);
    mint n = 0;
    ll L = 0, V = 0;
    rep(i,m){
        in(v[i],l[i]);
        L += l[i];
        V += v[i]*l[i];
        mint x = modpow(mint(10), l[i]);
        n = n * x + (x-1)/9 * v[i];
    }
    if(L==1){
        int ans = 0;
        rep(i,1,v.front()+1){
            if(i%3==0 or i%5==0) ans += 4;
            else ans++;
        }
        out(ans);
        return 0;
    }
    int mod3 = V%3, mod5 = v.back()%5;
    mint tl = modpow(mint(10),L-1);
    mint s = tl*(L-1)/9 - (tl-1)/81;
    mint ans = s*9 + (n+1)*L - tl*L + ((n-mod3)/3 + (n-mod5)/5)*4;
    int mod15 = crt[mod3][mod5];
    { // mod 3
        ans -= s*3;
        if(V == 1 or (v.front()==1 and v.back()==1 and V==2)){

        }
        else{
            ans -= ((n-mod3-2-tl)/3+1)*L;
        }
    }
    { // mod 5
        ans -= (s-1)*9/5;
        if(!(L==1 and v.front()<5)) {
            ans -= 1;
            ll vr = V-v.back()*l.back();
            if(V == 1 or (v.back()<5 and l.back()==1 and vr==1)){

            }
            else{
                ans -= ((n-mod5-tl)/5+1)*L;
            }
        }
    }
    { // mod 15
        ans += (s-1)*3/5;
        ll vr = V-v.back()*l.back();
        if(V == 1 or (v.back()<5 and l.back()==1 and vr==1)){

        }
        else{
            ans += ((n-mod15-5-tl)/15+1)*L;
        }
    }
    out(ans);
}

yukicoder

結果

テストケース

ソースコード