結果

問題 No.1017 Reiwa Sequence
ユーザー PachicobuePachicobue
提出日時 2020-04-04 00:05:07
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 528 ms / 2,000 ms
コード長 7,145 bytes
コンパイル時間 2,182 ms
コンパイル使用メモリ 215,008 KB
実行使用メモリ 86,272 KB
最終ジャッジ日時 2024-07-03 06:38:12
合計ジャッジ時間 39,346 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 4 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 4 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 3 ms
5,376 KB
testcase_15 AC 5 ms
5,376 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 12 ms
6,016 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 468 ms
85,248 KB
testcase_20 AC 477 ms
85,248 KB
testcase_21 AC 474 ms
85,248 KB
testcase_22 AC 482 ms
85,376 KB
testcase_23 AC 477 ms
85,248 KB
testcase_24 AC 472 ms
85,376 KB
testcase_25 AC 481 ms
85,248 KB
testcase_26 AC 481 ms
85,248 KB
testcase_27 AC 230 ms
44,160 KB
testcase_28 AC 230 ms
44,288 KB
testcase_29 AC 7 ms
5,376 KB
testcase_30 AC 13 ms
5,888 KB
testcase_31 AC 47 ms
13,568 KB
testcase_32 AC 222 ms
44,288 KB
testcase_33 AC 7 ms
5,376 KB
testcase_34 AC 218 ms
44,288 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 212 ms
44,288 KB
testcase_38 AC 2 ms
5,376 KB
testcase_39 AC 218 ms
44,416 KB
testcase_40 AC 497 ms
86,144 KB
testcase_41 AC 490 ms
86,144 KB
testcase_42 AC 498 ms
86,144 KB
testcase_43 AC 492 ms
86,272 KB
testcase_44 AC 14 ms
5,376 KB
testcase_45 AC 503 ms
86,272 KB
testcase_46 AC 497 ms
86,144 KB
testcase_47 AC 528 ms
86,144 KB
testcase_48 AC 24 ms
5,376 KB
testcase_49 AC 22 ms
5,376 KB
testcase_50 AC 22 ms
5,376 KB
testcase_51 AC 2 ms
5,376 KB
testcase_52 AC 237 ms
44,416 KB
testcase_53 AC 136 ms
24,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
// created [2020/04/03] 23:53:08
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T>
using max_heap = std::priority_queue<T>;
template<typename T>
using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
T in(const T offset) { return in<T>() - offset; }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T offset) { return in<T>(offset); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs, const T offset)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs, offset); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs, const T offset) { return in_v<T, Uint, n, 0>(szs, offset); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
template<typename... Types>
auto in_t(Types... offsets) { return std::tuple<std::decay_t<Types>...>{in<Types>(offsets)...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
    void clear()
    {
        std::cin.tie(), std::ios::sync_with_stdio(true);
    }
} io_setting;

int out() { return 0; }
template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
int main()
{
    const auto N  = in<int>();
    const auto as = in_v<ll>({N});
    std::map<ll, ll> memo;
    std::map<ll, ll> prev;
    prev[0] = 0;
    for (int i = 0; i < N; i++) {
        std::map<ll, ll> nprev;
        for (const auto [sum, vs] : prev) {
            const auto nsum = sum + as[i];
            const auto nvs  = (vs | (1LL << i));
            if (memo.count(nsum)) {
                const auto pvs = memo[nsum];
                std::vector<int> bs(N, 0);
                for (int i = 0; i < std::min(60, N); i++) {
                    if (btest(nvs, i)) { bs[i] += 1; }
                    if (btest(pvs, i)) { bs[i] -= 1; }
                }
                outln("Yes");
                for (int i = 0; i < N; i++) { out(as[i] * bs[i]), out(' '); }
                outln();
                return 0;
            }
            nprev[nsum] = nvs;
            memo[nsum]  = nvs;
        }
        for (const auto& p : nprev) { prev.insert(p); }
    }
    outln("No");
    return 0;
}
0