結果

問題 No.1990 Candy Boxes
ユーザー 👑 hitonanodehitonanode
提出日時 2022-06-25 12:42:40
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 30 ms / 2,000 ms
コード長 6,051 bytes
コンパイル時間 1,976 ms
コンパイル使用メモリ 175,716 KB
実行使用メモリ 8,300 KB
最終ジャッジ日時 2023-08-12 23:14:33
合計ジャッジ時間 5,764 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,384 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 1 ms
4,384 KB
testcase_12 AC 17 ms
4,784 KB
testcase_13 AC 18 ms
4,920 KB
testcase_14 AC 12 ms
5,148 KB
testcase_15 AC 13 ms
5,472 KB
testcase_16 AC 14 ms
5,632 KB
testcase_17 AC 15 ms
5,716 KB
testcase_18 AC 16 ms
5,764 KB
testcase_19 AC 19 ms
5,608 KB
testcase_20 AC 21 ms
6,708 KB
testcase_21 AC 20 ms
5,836 KB
testcase_22 AC 17 ms
5,072 KB
testcase_23 AC 22 ms
5,904 KB
testcase_24 AC 21 ms
5,708 KB
testcase_25 AC 30 ms
7,060 KB
testcase_26 AC 17 ms
6,728 KB
testcase_27 AC 17 ms
5,976 KB
testcase_28 AC 17 ms
6,616 KB
testcase_29 AC 18 ms
5,952 KB
testcase_30 AC 13 ms
6,956 KB
testcase_31 AC 18 ms
6,180 KB
testcase_32 AC 10 ms
4,752 KB
testcase_33 AC 14 ms
5,480 KB
testcase_34 AC 14 ms
5,728 KB
testcase_35 AC 21 ms
8,300 KB
testcase_36 AC 20 ms
6,820 KB
testcase_37 AC 17 ms
5,996 KB
testcase_38 AC 14 ms
5,584 KB
testcase_39 AC 16 ms
5,728 KB
testcase_40 AC 15 ms
5,916 KB
testcase_41 AC 15 ms
5,860 KB
testcase_42 AC 9 ms
4,676 KB
testcase_43 AC 12 ms
5,216 KB
testcase_44 AC 11 ms
4,988 KB
testcase_45 AC 13 ms
5,684 KB
testcase_46 AC 18 ms
5,128 KB
testcase_47 AC 22 ms
5,752 KB
testcase_48 AC 20 ms
5,352 KB
testcase_49 AC 1 ms
4,380 KB
testcase_50 AC 2 ms
4,380 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 1 ms
4,384 KB
testcase_53 AC 1 ms
4,384 KB
testcase_54 AC 1 ms
4,384 KB
testcase_55 AC 2 ms
4,380 KB
testcase_56 AC 1 ms
4,384 KB
testcase_57 AC 2 ms
4,384 KB
testcase_58 AC 1 ms
4,380 KB
testcase_59 AC 2 ms
4,384 KB
testcase_60 AC 1 ms
4,380 KB
testcase_61 AC 1 ms
4,384 KB
testcase_62 AC 1 ms
4,384 KB
testcase_63 AC 2 ms
4,384 KB
testcase_64 AC 2 ms
4,384 KB
testcase_65 AC 22 ms
7,480 KB
testcase_66 AC 19 ms
5,900 KB
testcase_67 AC 19 ms
6,384 KB
testcase_68 AC 12 ms
5,128 KB
testcase_69 AC 21 ms
7,028 KB
testcase_70 AC 22 ms
6,832 KB
testcase_71 AC 19 ms
5,348 KB
testcase_72 AC 24 ms
5,896 KB
testcase_73 AC 24 ms
6,524 KB
testcase_74 AC 16 ms
4,928 KB
testcase_75 AC 14 ms
5,756 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#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, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
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> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
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, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
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, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &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, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) 0
#define dbgif(cond, x) 0
#endif

void bad() {
    puts("No");
    exit(0);
}

int main() {
    int N;
    cin >> N;
    vector<lint> B(N);
    cin >> B;
    B.insert(B.begin(), 0);
    B.push_back(0);
    N = B.size();
    dbg(B);

    vector<lint> cs(N);
    vector<int> change;
    int last = 0;
    REP(i, N) {
        if (i) cs[i] = cs[i - 1];
        if (last % 2 != B[i] % 2) {
            if (change.size() and (i - change.back()) % 2 == 0) {
                change.pop_back();
                --cs[i];
            } else {
                change.push_back(i);
                ++cs[i];
            }
        }
        last = B[i];
    }
    dbg(cs);
    dbg(change);

    if (change.size()) bad();

    REP(i, N - 1) {
        lint req = B[i] - cs[i];
        if (req < 0) bad();
        cs[i] += req;
        cs[i + 1] += req;
    }
    if (B != cs) bad();
    puts("Yes");
}
0