結果

問題 No.3245 Payment with 8-rep Currency
ユーザー hitonanode
提出日時 2025-08-22 22:51:23
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 9,317 bytes
コンパイル時間 2,642 ms
コンパイル使用メモリ 230,116 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-08-22 22:51:32
合計ジャッジ時間 8,795 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample RE * 1
other AC * 25 RE * 5
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int T;
    cin >> T;

    const vector<int> weights{1, 11, 111, 1111};
    // vector<int> dp(1 << 22);
    // dp.at(0) = 1;

    // const vector<int> cands{1, 11, 111, 1111};
    // vector<int> vs;
    // for (int a : weights) {
    //     for (int b : weights) {
    //         // if (a < b) vs.push_back(a + b);
    //         for (int c : weights) {
    //             if (a < b and b < c) vs.push_back(a + b + c);
    //         }
    //     }
    // }
    // dbg(vs);
    // vs = sort_unique(vs);

    // REP(i, dp.size()) {
    //     if (!dp.at(i)) continue;
    //     for (int w : vs) {
    //         if (i + w < (int)dp.size()) dp.at(i + w) = 1;
    //     }
    // }

    // vector<int> suc(dp.size());
    // suc.at(0) = 1;
    // int last0 = -1;
    // FOR(i, 1, suc.size()) {
    //     // dbgif(i < 1000 and dp.at(i), i);
    //     if (!dp.at(i)) {
    //         suc.at(i) = 0;
    //         chmax(last0, i);
    //     } else {
    //         suc.at(i) = suc.at(i - 1) + 1;
    //     }
    // }

    vector cs(30000, vector<lint>(4, -1));
    REP(n0, 5) REP(n1, 5) REP(n2, 5) REP(n3, 5) {
        const int n = n0 + n1 + n2 + n3;
        if (n0 * 2 >= n) continue;
        if (n1 * 2 >= n) continue;
        if (n2 * 2 >= n) continue;
        if (n3 * 2 >= n) continue;
        const vector<lint> is{n0, n1, n2, n3};
        int w = 0;
        for (int i = 0; i < 4; i++) { w += weights.at(i) * is.at(i); }
        cs.at(w) = is;
    }
    // REP(ban, 5) {
    //     FOR(v, 1, 3) {
    //         int w = 0;
    //         vector<int> is(4);
    //         REP(e, 4) {
    //             if (ban != e) {
    //                 w += weights.at(e) * v;
    //                 is.at(e) = v;
    //             }
    //         }
    //         cs.at(w) = is;
    //     }
    // }

    REP(now, cs.size()) {
        if (cs.at(now).front() == -1) continue;
        REP(d, 4) REP(e, d) {
            const int nxt = now + weights.at(d) + weights.at(e);
            if (nxt >= (int)cs.size()) continue;
            auto csnxt = cs.at(now);
            csnxt.at(d)++;
            csnxt.at(e)++;
            cs.at(nxt) = csnxt;
        }
    }

    while (T--) {
        lint N;
        cin >> N;
        if (N % 8) {
            cout << "-1\n";
            continue;
        }
        N /= 8;
        const lint yo = max(0LL, N - 20000);
        const lint k = yo / 12;
        const lint m = N - k * 12;
        assert(15000 < m);

        vector<lint> ans = cs.at(m);
        if (ans.front() < 0) {
            cout << "-1\n";
            continue;
        }
        ans.at(0) += k;
        ans.at(1) += k;
        for (auto e : ans) cout << e << " ";
        cout << "\n";
    }
}
0