#460379 (C++14) No.1017 Reiwa Sequence

提出ソース

結果

問題	No.1017 Reiwa Sequence
ユーザー	haruki_K
提出日時	2020-04-08 05:38:41
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	128 ms / 2,000 ms
コード長	5,438 bytes
コンパイル時間	1,869 ms
コンパイル使用メモリ	180,032 KB
実行使用メモリ	23,040 KB
最終ジャッジ日時	2024-07-03 08:40:33
合計ジャッジ時間	30,185 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	5 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	38 ms 9,616 KB
testcase_13	AC	4 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	3 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	8 ms 6,944 KB
testcase_20	AC	8 ms 6,940 KB
testcase_21	AC	8 ms 6,940 KB
testcase_22	AC	8 ms 6,944 KB
testcase_23	AC	8 ms 6,940 KB
testcase_24	AC	6 ms 6,944 KB
testcase_25	AC	8 ms 6,944 KB
testcase_26	AC	7 ms 6,940 KB
testcase_27	AC	5 ms 6,940 KB
testcase_28	AC	5 ms 6,944 KB
testcase_29	AC	5 ms 6,944 KB
testcase_30	AC	4 ms 6,940 KB
testcase_31	AC	5 ms 6,944 KB
testcase_32	AC	4 ms 6,944 KB
testcase_33	AC	4 ms 6,940 KB
testcase_34	AC	5 ms 6,940 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	3 ms 6,944 KB
testcase_37	AC	4 ms 6,940 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	AC	4 ms 6,944 KB
testcase_40	AC	92 ms 17,172 KB
testcase_41	AC	95 ms 14,864 KB
testcase_42	AC	128 ms 23,040 KB
testcase_43	AC	89 ms 13,572 KB
testcase_44	AC	12 ms 6,940 KB
testcase_45	AC	110 ms 16,132 KB
testcase_46	AC	87 ms 14,580 KB
testcase_47	AC	69 ms 10,316 KB
testcase_48	AC	45 ms 10,664 KB
testcase_49	AC	17 ms 6,940 KB
testcase_50	AC	18 ms 6,944 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	4 ms 6,944 KB
testcase_53	AC	5 ms 6,940 KB

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

ソースコード

raw source code

// >>> TEMPLATES

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}

// <<<
bool next_product(int m, vector<int> &v) {
    rep (i,v.size()) {
        if (++v[i] < m) return true;
        v[i] = 0;
    }
    return false;
}

int32_t main() {
    int n; cin >> n;
    vector<int> a(n); cin >> a;

    int m = 24;
    chmin(m,n);
    int m1 = m/2, m2 = m-m1;
    dump(m1,m2);

    unordered_set<int> w;
    vector<int> v(m1);
    do {
        int sum = 0;
        rep (i,m1) sum += (v[i]-1)*a[i];
        w.insert(sum);
        dump(m1,sum,v);

        if (count(all(v),1) != m1 && sum == 0) {
            cout << "Yes\n";
            rep (i,m1) cout << (v[i]-1)*a[i] << " ";
            loop (i,m1,<n) cout << "0 ";
            cout << endl;
            return 0;
        }

    } while (next_product(3,v));
//    sort(all(w));
    dump(w);

    v.assign(m2,0);
    int memo_sum = INF;
    vector<int> ans(n);
    do {
        if (count(all(v),1) == m2) continue;

        int sum = 0;
        loop (i,m1,<m) sum += (v[i-m1]-1)*a[i];
        dump(m2,sum,v);

        if (w.find(-sum) != w.end()) {
            memo_sum = sum;
            loop (i,m1,<m) ans[i] = (v[i-m1]-1)*a[i];
            break;
        }
    } while (next_product(3,v));
    dump(memo_sum);

    if (memo_sum == INF) quit("No");

    v.assign(m1,0);
    do {
        int sum = 0;
        rep (i,m1) sum += (v[i]-1)*a[i];
        dump(m1,sum,v);

        if (sum + memo_sum == 0) {
            cout << "Yes\n";
            rep (i,m1) ans[i] = (v[i]-1)*a[i];
            cout << ans << endl;
            return 0;
        }

    } while (next_product(3,v));
    assert(0);
}

yukicoder

結果

テストケース

ソースコード