#459735 (C++17(gcc12)) No.1017 Reiwa Sequence

提出ソース

結果

問題	No.1017 Reiwa Sequence
ユーザー	iiljj
提出日時	2020-04-06 23:08:35
言語	C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
結果	AC
実行時間	129 ms / 2,000 ms
コード長	5,984 bytes
コンパイル時間	2,207 ms
コンパイル使用メモリ	210,436 KB
実行使用メモリ	26,716 KB
最終ジャッジ日時	2024-07-03 08:33:48
合計ジャッジ時間	33,126 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	4 ms 6,940 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	125 ms 25,212 KB
testcase_20	AC	120 ms 25,216 KB
testcase_21	AC	120 ms 25,340 KB
testcase_22	AC	111 ms 25,212 KB
testcase_23	AC	108 ms 25,208 KB
testcase_24	AC	102 ms 25,084 KB
testcase_25	AC	106 ms 25,084 KB
testcase_26	AC	103 ms 25,084 KB
testcase_27	AC	62 ms 16,564 KB
testcase_28	AC	51 ms 14,116 KB
testcase_29	AC	3 ms 6,940 KB
testcase_30	AC	4 ms 6,940 KB
testcase_31	AC	13 ms 6,944 KB
testcase_32	AC	42 ms 14,128 KB
testcase_33	AC	3 ms 6,948 KB
testcase_34	AC	77 ms 22,368 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,940 KB
testcase_37	AC	85 ms 23,176 KB
testcase_38	AC	2 ms 6,940 KB
testcase_39	AC	47 ms 14,128 KB
testcase_40	AC	124 ms 26,716 KB
testcase_41	AC	126 ms 26,588 KB
testcase_42	AC	118 ms 26,556 KB
testcase_43	AC	129 ms 26,568 KB
testcase_44	AC	16 ms 6,944 KB
testcase_45	AC	123 ms 26,572 KB
testcase_46	AC	117 ms 26,552 KB
testcase_47	AC	114 ms 26,548 KB
testcase_48	AC	27 ms 6,940 KB
testcase_49	AC	25 ms 6,944 KB
testcase_50	AC	24 ms 6,944 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	65 ms 16,820 KB
testcase_53	AC	48 ms 14,008 KB

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

ソースコード

raw source code

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";

/* #endregion */

// Problem
void solve() {
    int n;
    cin >> n;
    vll a(n);
    cin >> a;

    int nn = min(n, 22);
    ll sum = 0LL;

    int x = -1, y = -1;
    um<int, int> m;

    for (int i = 1; i < (1 << nn); i++) {
        int code = i ^ (i >> 1);
        int bitpos = __builtin_ctz(i);
        if (((1 << bitpos) & code) != 0)
            sum += a[bitpos];
        else
            sum -= a[bitpos];
        if (m.find(sum) != m.end()) {
            x = m[sum], y = code;
            break;
        }
        m[sum] = code;
    }
    if (x == -1) {
        cout << no << endl;
        return;
    }
    cout << yes << endl;
    vll ret(n);
    REP(i, 0, nn) {
        int xx = (x >> i) & 1, yy = (y >> i) & 1;
        if (!(xx ^ yy))
            ret[i] = 0;
        else if (xx)
            ret[i] = a[i];
        else
            ret[i] = -a[i];
    }
    REP(i, nn, n) ret[i] = 0;
    cout >> ret;
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード