結果

問題 No.1990 Candy Boxes
ユーザー cutmdocutmdo
提出日時 2022-06-24 22:59:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 4,432 bytes
コンパイル時間 3,534 ms
コンパイル使用メモリ 255,048 KB
実行使用メモリ 12,340 KB
最終ジャッジ日時 2023-08-12 23:09:59
合計ジャッジ時間 7,279 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,384 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 1 ms
4,384 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 20 ms
7,912 KB
testcase_13 AC 21 ms
8,240 KB
testcase_14 AC 15 ms
8,644 KB
testcase_15 AC 16 ms
9,240 KB
testcase_16 AC 17 ms
9,660 KB
testcase_17 AC 18 ms
10,208 KB
testcase_18 AC 17 ms
10,296 KB
testcase_19 AC 20 ms
9,812 KB
testcase_20 AC 24 ms
10,564 KB
testcase_21 AC 23 ms
10,416 KB
testcase_22 AC 18 ms
8,244 KB
testcase_23 AC 24 ms
9,820 KB
testcase_24 AC 23 ms
9,568 KB
testcase_25 AC 31 ms
12,340 KB
testcase_26 AC 20 ms
11,808 KB
testcase_27 AC 20 ms
11,520 KB
testcase_28 AC 21 ms
12,236 KB
testcase_29 AC 21 ms
12,092 KB
testcase_30 AC 17 ms
10,568 KB
testcase_31 AC 22 ms
12,184 KB
testcase_32 AC 12 ms
7,656 KB
testcase_33 AC 18 ms
10,260 KB
testcase_34 AC 16 ms
8,972 KB
testcase_35 AC 25 ms
11,176 KB
testcase_36 AC 24 ms
10,924 KB
testcase_37 AC 21 ms
10,996 KB
testcase_38 AC 17 ms
9,604 KB
testcase_39 AC 19 ms
10,088 KB
testcase_40 AC 19 ms
11,156 KB
testcase_41 AC 20 ms
10,876 KB
testcase_42 AC 12 ms
7,776 KB
testcase_43 AC 16 ms
9,520 KB
testcase_44 AC 15 ms
8,820 KB
testcase_45 AC 15 ms
9,580 KB
testcase_46 AC 21 ms
9,228 KB
testcase_47 AC 25 ms
11,184 KB
testcase_48 AC 22 ms
10,096 KB
testcase_49 AC 2 ms
4,384 KB
testcase_50 AC 1 ms
4,384 KB
testcase_51 AC 1 ms
4,384 KB
testcase_52 AC 2 ms
4,388 KB
testcase_53 AC 2 ms
4,388 KB
testcase_54 AC 2 ms
4,380 KB
testcase_55 AC 1 ms
4,380 KB
testcase_56 AC 2 ms
4,380 KB
testcase_57 AC 2 ms
4,380 KB
testcase_58 AC 1 ms
4,384 KB
testcase_59 AC 2 ms
4,380 KB
testcase_60 AC 2 ms
4,380 KB
testcase_61 AC 1 ms
4,380 KB
testcase_62 AC 2 ms
4,384 KB
testcase_63 AC 1 ms
4,384 KB
testcase_64 AC 1 ms
4,384 KB
testcase_65 AC 26 ms
11,816 KB
testcase_66 AC 22 ms
10,464 KB
testcase_67 AC 23 ms
10,872 KB
testcase_68 AC 14 ms
8,244 KB
testcase_69 AC 25 ms
11,392 KB
testcase_70 AC 25 ms
11,812 KB
testcase_71 AC 21 ms
9,768 KB
testcase_72 AC 28 ms
11,876 KB
testcase_73 AC 25 ms
11,876 KB
testcase_74 AC 19 ms
8,536 KB
testcase_75 AC 16 ms
9,772 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================

signed main() {
    ll n;
    cin >> n;

    VL a(n);
    cin >> a;

    auto b = a;
    V<PAIR> v(n, {-1,0});
    V<PAIR> w(n, {-1,0});

    v[0] = {0, 0};
    w[0] = {(a[0] + 1) / 2, a[0] / 2};
    FOR(i, 1, n) {
        b[i] -= b[i - 1];
        b[i - 1] -= b[i - 1];
        v[i] = w[i - 1];

        ll need = (a[i] + 1) / 2 - v[i].first;
        ll ex = b[i];
        ll ad1 = std::min(ex, need);
        ll ad2 = ex - ad1;
        w[i] = {ad1,ad2};
        if(ad1 < 0 || ad2 < 0) {
            cout << "No" << endl;
            return 0;
        }
    }

    dump(b, v, w);
    REPC(x, b)if(x != 0) {
        cout << "No" << endl;
        return 0;
    }
    REP(i, n) {
        auto f = v[i].first + w[i].first;
        auto s = v[i].second + w[i].second;
        if(f < s || f + s != a[i]) {
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;

}
0