結果

問題 No.1017 Reiwa Sequence
ユーザー 👑 AngrySadEight
提出日時 2025-01-23 22:13:30
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,363 bytes
コンパイル時間 3,461 ms
コンパイル使用メモリ 181,308 KB
実行使用メモリ 35,604 KB
最終ジャッジ日時 2025-01-23 22:14:30
合計ジャッジ時間 29,393 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 12 WA * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
using mint = modint998244353;
template <typename T>
void debug(T e) {
    cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}
vector<ll> n_adic(ll i, ll n, ll N) {
    ll x = 1;
    rep(j, N) { x *= n; }
    vector<ll> vec(N);
    rep(j, N) {
        x /= n;
        vec[j] = i / x;
        i -= x * vec[j];
    }
    return vec;
}
int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<ll> v = {0, 1, -1};
    if (N <= 13) {
        ll pow_val = 1;
        for (ll i = 0; i < N; i++) {
            pow_val *= 3;
        }
        for (ll i = 1; i < pow_val; i++) {
            vector<ll> ter = n_adic(i, 3, N);
            ll sum = 0;
            for (ll j = 0; j < N; j++) {
                sum += v[ter[j]] * A[j];
            }
            if (sum == 0) {
                cout << "Yes" << endl;
                for (ll j = 0; j < N; j++) {
                    cout << v[ter[j]] * A[j] << " ";
                }
                cout << endl;
                return 0;
            }
        }
        cout << "No" << endl;
    } else {
        ll pow_val = 1;
        for (ll i = 0; i < 14; i++) {
            pow_val *= 3;
        }
        vector<ll> hash_val(4000004, -1);
        for (ll i = 1; i < pow_val; i++) {
            vector<ll> ter = n_adic(i, 3, 14);
            ll sum = 0;
            for (ll j = 0; j < 14; j++) {
                sum += v[ter[j]] * A[j];
            }
            if (hash_val[sum + 2000000] != -1) {
                vector<ll> pair_ter = n_adic(hash_val[sum + 2000000], 3, 14);
                cout << "Yes" << endl;
                for (ll j = 0; j < 14; j++) {
                    cout << (v[pair_ter[j]] + v[ter[j]]) * A[j] << " ";
                }
                for (ll j = 14; j < N; j++) {
                    cout << 0 << " ";
                }
                cout << endl;
                return 0;
            }
            hash_val[sum + 2000000] = i;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0