結果

問題 No.1106 🦉 何事もバランスが大事
ユーザー hitonanode
提出日時 2020-07-11 11:51:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 4,738 bytes
コンパイル時間 1,962 ms
コンパイル使用メモリ 201,744 KB
最終ジャッジ日時 2025-01-11 19:44:32
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 77
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

constexpr int M = 5;
constexpr int D = 30;

vector<int> f(lint x)
{
    vector<int> ret;
    while (x)
    {
        lint m = x % M;
        if (m >= 3) m -= 5;
        ret.emplace_back(m);
        x /= M;
        if (m < 0) x++;
    }
    return ret;
}

int main()
{
    lint N;
    cin >> N;
    vector dpi(2 * D + 1, 0LL); // 未だにゼロ
    vector dp0 = dpi; // 上界
    vector dp1 = dpi;
    dpi[D] = 1;

    vector<int> ds = f(N);
    reverse(ds.begin(), ds.end());
    bool leading_d = true;
    for (auto e : ds)
    {
        vector dpnxtinit(dpi.size(), 0LL);
        vector dpnxt0 = dpnxtinit;
        vector dpnxt1 = dpnxtinit;
        for (int a : {-2, -1, 0, 1, 2})
        {
            REP(add, dpnxtinit.size())
            {
                int adnx = add + a;
                if (adnx < 0 or adnx >= dpnxtinit.size()) continue;

                dpnxt1[adnx] += dp1[add] + (a > 0) * (!leading_d) * dpi[add];

                if (a == 0) dpnxtinit[add] += dpi[add];
                if (a < e)
                {
                    dpnxt1[adnx] += dp0[add] + (a > 0) * leading_d * dpi[add];
                }
                if (a == e)
                {
                    dpnxt0[adnx] += dp0[add] + (a > 0) * leading_d * dpi[add];
                }
            }
        }
        dpi = dpnxtinit, dp0 = dpnxt0, dp1 = dpnxt1;
        leading_d = false;
    }
    cout << dp0[D] + dp1[D] << '\n';
}
0