結果
問題 | No.1017 Reiwa Sequence |
ユーザー | noshi91 |
提出日時 | 2020-04-03 23:07:06 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,334 bytes |
コンパイル時間 | 916 ms |
コンパイル使用メモリ | 130,352 KB |
実行使用メモリ | 22,468 KB |
最終ジャッジ日時 | 2024-04-23 14:39:09 |
合計ジャッジ時間 | 24,162 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
10,624 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 4 ms
5,864 KB |
testcase_10 | AC | 4 ms
6,056 KB |
testcase_11 | AC | 6 ms
8,100 KB |
testcase_12 | AC | 4 ms
6,076 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 10 ms
11,324 KB |
testcase_15 | AC | 11 ms
12,608 KB |
testcase_16 | AC | 10 ms
12,788 KB |
testcase_17 | AC | 12 ms
12,832 KB |
testcase_18 | AC | 11 ms
12,176 KB |
testcase_19 | AC | 30 ms
22,468 KB |
testcase_20 | AC | 28 ms
21,984 KB |
testcase_21 | AC | 28 ms
21,636 KB |
testcase_22 | AC | 28 ms
21,416 KB |
testcase_23 | AC | 27 ms
20,944 KB |
testcase_24 | AC | 26 ms
20,768 KB |
testcase_25 | AC | 27 ms
20,732 KB |
testcase_26 | AC | 25 ms
20,568 KB |
testcase_27 | AC | 10 ms
8,472 KB |
testcase_28 | AC | 9 ms
8,292 KB |
testcase_29 | AC | 7 ms
7,976 KB |
testcase_30 | AC | 5 ms
5,932 KB |
testcase_31 | AC | 5 ms
7,384 KB |
testcase_32 | AC | 5 ms
5,872 KB |
testcase_33 | AC | 3 ms
5,376 KB |
testcase_34 | AC | 2 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 3 ms
5,376 KB |
testcase_38 | AC | 3 ms
5,376 KB |
testcase_39 | AC | 2 ms
5,376 KB |
testcase_40 | TLE | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
ソースコード
//#define NDEBUG #include <algorithm> #include <cstddef> #include <cstdint> #include <iostream> #include <utility> #include <vector> namespace n91 { using i8 = std::int_fast8_t; using i32 = std::int_fast32_t; using i64 = std::int_fast64_t; using u8 = std::uint_fast8_t; using u32 = std::uint_fast32_t; using u64 = std::uint_fast64_t; using isize = std::ptrdiff_t; using usize = std::size_t; struct rep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr rep(const usize f, const usize l) noexcept : f(std::min(f, l)), l(l) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; struct revrep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr revrep(const usize f, const usize l) noexcept : f(l - 1), l(std::min(f, l) - 1) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; template <class T> auto md_vec(const usize n, const T &value) { return std::vector<T>(n, value); } template <class... Args> auto md_vec(const usize n, Args... args) { return std::vector<decltype(md_vec(args...))>(n, md_vec(args...)); } template <class T> constexpr T difference(const T &a, const T &b) noexcept { return a < b ? b - a : a - b; } template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; } template <class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b; } template <class F> class rec_lambda { F f; public: rec_lambda(F &&f) : f(std::move(f)) {} template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); } }; template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); } template <class T> T scan() { T ret; std::cin >> ret; return ret; } } // namespace n91 #include <deque> namespace n91 { void main_() { /* std::ios::sync_with_stdio(false); std::cin.tie(nullptr); //*/ const usize n = scan<usize>(); std::vector<u64> a(n + 1); for (const usize i : rep(0, n)) { std::cin >> a[i]; } a[n] = 0; const usize A = *std::max_element(a.begin(), a.end()); for (const usize i : revrep(0, n)) { a[i] += a[i + 1]; } const auto next = [&](std::deque<usize> &rle, u64 &sum) -> bool { if (rle.size() == 2) { return false; } usize t0 = rle[0]; usize t1 = rle[1]; sum -= a[t0] - a[t0 + t1]; sum += a[t0 + t1] - a[t0 + t1 + 1]; if (rle.size() >= 4 && rle[2] == 1) { rle[3] += 1; rle.pop_front(); rle.pop_front(); rle.pop_front(); rle.push_front(t0 + 1); if (t1 != 1) { sum += a[0] - a[t1 - 1]; rle.push_front(t1 - 1); rle.push_front(0); } } else { rle.pop_front(); rle.pop_front(); rle[0] -= 1; if (rle[0] == 0) { rle.pop_front(); } rle.push_front(1); rle.push_front(t0 + 1); if (t1 != 1) { sum += a[0] - a[t1 - 1]; rle.push_front(t1 - 1); rle.push_front(0); } } return true; }; std::vector<int> oc; u64 ans = -static_cast<u64>(1); for (const usize k : rep(1, n + 1)) { std::deque<usize> deq; if (k != n) { deq.push_front(n - k); } deq.push_front(k); deq.push_front(0); u64 sum = a[0] - a[k]; oc.resize(A * k + 1); do { if (oc[sum] != 0) { ans = sum; break; } oc[sum] = 1; } while (next(deq, sum)); if (ans != -static_cast<u64>(1)) { break; } } if (ans == -static_cast<u64>(1)) { std::cout << "No\n"; return; } std::cout << "Yes\n"; std::vector<int> b(n, 0); int state = 0; for (const usize k : rep(1, n + 1)) { std::deque<usize> deq; if (k != n) { deq.push_front(n - k); } deq.push_front(k); deq.push_front(0); u64 sum = a[0] - a[k]; do { if (sum == ans) { if (state == 0) { state = 1; usize i = 0; bool f = false; for (const auto e : deq) { if (f) { for (const usize j : rep(i, i + e)) { b[j] += 1; } } i += e; f = !f; } } else if (state == 1) { state = 2; usize i = 0; bool f = false; for (const auto e : deq) { if (f) { for (const usize j : rep(i, i + e)) { b[j] -= 1; } } i += e; f = !f; } } } } while (next(deq, sum)); if (state == 2) { break; } } for (const usize i : rep(0, n)) { if (i) std::cout << " "; std::cout << i64(b[i]) * i64(a[i] - a[i + 1]); } std::cout << "\n"; } } // namespace n91 int main() { n91::main_(); return 0; }