結果
問題 | No.1017 Reiwa Sequence |
ユーザー | 👑 hitonanode |
提出日時 | 2020-04-03 22:31:15 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 546 ms / 2,000 ms |
コード長 | 4,831 bytes |
コンパイル時間 | 1,800 ms |
コンパイル使用メモリ | 169,952 KB |
実行使用メモリ | 162,084 KB |
最終ジャッジ日時 | 2023-09-16 03:18:36 |
合計ジャッジ時間 | 28,248 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 112 ms
160,300 KB |
testcase_01 | AC | 104 ms
159,752 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 202 ms
160,320 KB |
testcase_04 | AC | 3 ms
4,380 KB |
testcase_05 | AC | 120 ms
160,316 KB |
testcase_06 | AC | 103 ms
160,316 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 243 ms
160,372 KB |
testcase_10 | AC | 294 ms
160,296 KB |
testcase_11 | AC | 239 ms
160,320 KB |
testcase_12 | AC | 287 ms
160,400 KB |
testcase_13 | AC | 220 ms
160,288 KB |
testcase_14 | AC | 240 ms
159,864 KB |
testcase_15 | AC | 261 ms
159,848 KB |
testcase_16 | AC | 236 ms
159,728 KB |
testcase_17 | AC | 317 ms
159,980 KB |
testcase_18 | AC | 236 ms
159,912 KB |
testcase_19 | AC | 454 ms
160,004 KB |
testcase_20 | AC | 470 ms
159,796 KB |
testcase_21 | AC | 475 ms
160,044 KB |
testcase_22 | AC | 472 ms
159,796 KB |
testcase_23 | AC | 459 ms
160,056 KB |
testcase_24 | AC | 415 ms
159,916 KB |
testcase_25 | AC | 437 ms
159,788 KB |
testcase_26 | AC | 405 ms
159,852 KB |
testcase_27 | AC | 450 ms
160,508 KB |
testcase_28 | AC | 440 ms
160,360 KB |
testcase_29 | AC | 316 ms
160,376 KB |
testcase_30 | AC | 351 ms
160,508 KB |
testcase_31 | AC | 399 ms
160,324 KB |
testcase_32 | AC | 430 ms
160,392 KB |
testcase_33 | AC | 292 ms
160,320 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 3 ms
4,376 KB |
testcase_36 | AC | 2 ms
4,380 KB |
testcase_37 | AC | 400 ms
160,324 KB |
testcase_38 | AC | 100 ms
160,356 KB |
testcase_39 | AC | 427 ms
160,284 KB |
testcase_40 | AC | 494 ms
161,488 KB |
testcase_41 | AC | 523 ms
161,392 KB |
testcase_42 | AC | 546 ms
161,400 KB |
testcase_43 | AC | 509 ms
161,568 KB |
testcase_44 | AC | 150 ms
161,560 KB |
testcase_45 | AC | 519 ms
161,600 KB |
testcase_46 | AC | 500 ms
161,344 KB |
testcase_47 | AC | 464 ms
161,420 KB |
testcase_48 | AC | 54 ms
5,436 KB |
testcase_49 | AC | 153 ms
162,084 KB |
testcase_50 | AC | 57 ms
5,316 KB |
testcase_51 | AC | 68 ms
159,876 KB |
testcase_52 | AC | 416 ms
160,288 KB |
testcase_53 | AC | 384 ms
160,328 KB |
ソースコード
#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"); }