結果

問題 No.1017 Reiwa Sequence
ユーザー hitonanode
提出日時 2020-04-03 22:31:15
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 688 ms / 2,000 ms
コード長 4,831 bytes
コンパイル時間 1,660 ms
コンパイル使用メモリ 171,184 KB
実行使用メモリ 162,048 KB
最終ジャッジ日時 2024-07-03 04:37:43
合計ジャッジ時間 50,046 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#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> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

void ans(vector<int> v) {
    puts("Yes");
    for (auto x : v) printf("%d ", x);
    puts("");
    exit(0);
}


int main()
{
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    vector<int> cnt(150001);
    for (auto a : A) cnt[a]++;
    REP(i, cnt.size()) if (cnt[i] > 1) {
        cnt[i] = 2;
        for (auto &a : A) {
            if (a == i) {
                if (cnt[i] == 2) cnt[i]--;
                else if (cnt[i] == 1) a = -a, cnt[i]--;
                else a = 0;
            }
            else a = 0;
        }
        ans(A);
    }
    int OFF = 10000000;
    vector<int> dp(OFF * 2 + 1);
    vector<int> prv(OFF * 2 + 1);
    dp[OFF] = 1;
    REP(i, min<int>(40, A.size())) {
        REP(j, dp.size()) if (dp[j]) {
            if (j + A[i] < dp.size() and abs(prv[j]) != i + 1 and !prv[j + A[i]]) dp[j + A[i]] = 1, prv[j + A[i]] = i + 1;
            if (j - A[i] >= 0 and abs(prv[j]) != i + 1 and !prv[j - A[i]])  dp[j - A[i]] = 1, prv[j - A[i]] = -(i + 1);
        }

        if (prv[OFF]) {
            dbg("OK");
            vector<int> used(N);
            int t = OFF;
            used[abs(prv[t]) - 1] = (prv[t] > 0 ? 1 : -1);
            bool fi = true;
            while (fi or t != OFF)
            {
                fi = false;
                int i = abs(prv[t]) - 1;
                int a = (prv[t] > 0 ? 1 : -1) * A[i];
                t -= a;
                used[abs(prv[t]) - 1] = (prv[t] > 0 ? 1 : -1);
            }
            REP(i, N) {
                A[i] *= used[i];
            }
            ans(A);
        }
    }
    puts("No");
}
0