結果
問題 | No.1736 Princess vs. Dragoness |
ユーザー | rokahikou1 |
提出日時 | 2023-06-07 20:10:45 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,962 bytes |
コンパイル時間 | 1,826 ms |
コンパイル使用メモリ | 177,272 KB |
実行使用メモリ | 104,320 KB |
最終ジャッジ日時 | 2024-06-09 13:16:06 |
合計ジャッジ時間 | 3,875 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 7 ms
8,320 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 97 ms
104,320 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 37 ms
28,672 KB |
testcase_14 | WA | - |
testcase_15 | AC | 5 ms
6,940 KB |
testcase_16 | AC | 42 ms
50,816 KB |
testcase_17 | WA | - |
testcase_18 | AC | 16 ms
15,232 KB |
testcase_19 | AC | 21 ms
19,840 KB |
testcase_20 | AC | 7 ms
7,296 KB |
testcase_21 | AC | 5 ms
6,944 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 6 ms
7,040 KB |
testcase_26 | AC | 32 ms
27,520 KB |
testcase_27 | AC | 6 ms
6,944 KB |
testcase_28 | AC | 5 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 35 ms
33,024 KB |
testcase_31 | AC | 13 ms
13,312 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 1 ms
6,940 KB |
コンパイルメッセージ
main.cpp: In function 'void solve()': main.cpp:241:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 241 | auto [index, life] = dp[i][j]; | ^
ソースコード
#pragma region Macros #include <bits/stdc++.h> #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define rrep(i, n) for(int(i) = (n)-1; (i) >= 0; (i)--) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define ROF(i, m, n) for(int(i) = (n)-1; (i) >= (m); (i)--) #define ALL(v) (v).begin(), (v).end() #define LLA(v) (v).rbegin(), (v).rend() #define SZ(v) (int)(v).size() #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define DOUBLE(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define STRING(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ read(name) #define VEC2(type, name, height, width) \ vector<vector<type>> name(height, vector<type>(width)); \ read(name) #define DVEC(type, name1, name2, size) \ vector<type> name1(size), name2(size); \ read(name1, name2) #define TVEC(type, name1, name2, name3, size) \ vector<type> name1(size), name2(size), name3(size); \ read(name1, name2, name3) using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; const char newl = '\n'; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; template <class T> inline bool between(T x, T l, T r) { return l <= x && x < r; } template <class T> inline vector<T> make_vec(size_t a, T val) { return vector<T>(a, val); } template <class... Ts> inline auto make_vec(size_t a, Ts... ts) { return vector<decltype(make_vec(ts...))>(a, make_vec(ts...)); } void read() {} template <class T> inline void read(T &a) { cin >> a; } template <class T, class S> inline void read(pair<T, S> &p) { read(p.first), read(p.second); } template <class T> inline void read(vector<T> &v) { for(auto &&a : v) read(a); } template <class T, class U> inline void read(vector<T> &a, vector<U> &b) { for(int i = 0; i < a.size(); i++) { read(a[i]); read(b[i]); } } template <class T, class U, class V> inline void read(vector<T> &a, vector<U> &b, vector<V> &c) { for(int i = 0; i < a.size(); i++) { read(a[i]); read(b[i]); read(c[i]); } } template <class Head, class... Tail> inline void read(Head &head, Tail &...tail) { read(head), read(tail...); } template <class T> void _write(const T &a) { cout << a; } template <class T, class U> void _write(const std::pair<T, U> &a) { cout << a.first << ' ' << a.second; } template <class T> void write(const T &a) { _write(a); cout << newl; } template <class T> void write(const vector<T> &a) { for(int i = 0; i < a.size(); i++) { _write(a[i]); cout << (i + 1 == a.size() ? newl : ' '); } } template <class Head, class... Tail> void write(const Head &head, const Tail &...tail) { _write(head); cout << ' '; write(tail...); } template <class T> void writel(const T &a) { cout << a << '\n'; } template <class T> void writel(const vector<T> &a) { for(int i = 0; i < a.size(); i++) { _write(a[i]); cout << newl; } } template <class Head, class... Tail> void writel(const Head &head, const Tail &...tail) { _write(head); cout << newl; write(tail...); } template <class T> void _debug(const T &a) { cerr << a; } template <class T, class U> void _debug(const std::pair<T, U> &a) { cerr << a.first << ' ' << a.second; } template <class T> void debug(const T &a) { _debug(a); cerr << newl; } template <class T> void debug(const vector<T> &a) { for(int i = 0; i < a.size(); i++) { _debug(a[i]); cerr << (i + 1 == a.size() ? newl : ' '); } } template <class Head, class... Tail> void debug(const Head &head, const Tail &...tail) { _debug(head); cerr << ' '; debug(tail...); } template <class T> void debugl(const T &a) { cerr << a << '\n'; } template <class T> void debugl(const vector<T> &a) { for(int i = 0; i < a.size(); i++) { _debug(a[i]); cerr << newl; } } template <class Head, class... Tail> void debugl(const Head &head, const Tail &...tail) { _debug(head); cerr << newl; debug(tail...); } template <class T> auto sum(const vector<T> &a) { return accumulate(ALL(a), T(0)); } template <class T> auto min(const vector<T> &a) { return *min_element(ALL(a)); } template <class T> auto max(const vector<T> &a) { return *max_element(ALL(a)); } template <class T, class U> void msort(vector<T> &a, vector<U> &b) { assert(a.size() == b.size()); vector<pair<T, U>> ab(a.size()); for(int i = 0; i < a.size(); i++) ab[i] = {a[i], b[i]}; sort(ALL(ab)); for(int i = 0; i < a.size(); i++) { a[i] = ab[i].first; b[i] = ab[i].second; } } template <class T, class U, class V> void msort(vector<T> &a, vector<U> &b, vector<V> &c) { assert(a.size() == b.size() && b.size() == c.size()); vector<tuple<T, U, V>> abc(a.size()); for(int i = 0; i < a.size(); i++) abc[i] = {a[i], b[i], c[i]}; sort(ALL(abc)); for(int i = 0; i < a.size(); i++) { a[i] = get<0>(abc[i]); b[i] = get<1>(abc[i]); c[i] = get<2>(abc[i]); } } template <class T, class U> inline bool chmax(T &a, U b) { if(a < b) { a = b; return 1; } return 0; } template <class T, class U> inline bool chmin(T &a, U b) { if(a > b) { a = b; return 1; } return 0; } int digit(ll a) { ll ret = 0; while(a && ++ret) a /= 10; return ret; } int digit_sum(ll a) { ll ret = 0; while(a) { ret += a % 10; a /= 10; } return ret; } ll llpow(ll a, ll n) { ll ret = 1; rep(i, n) ret *= a; return ret; } inline int bsf(int v) { return __builtin_ctz(v); } // 最下位の1が下から何番目か inline int bsf(ll v) { return __builtin_ctzll(v); } inline int bsr(int v) { return 31 - __builtin_clz(v); } // 最上位の1が下から何番目か inline int bsr(ll v) { return 63 - __builtin_clzll(v); } inline int lsb(int v) { return v & -v; } // 最下位の1だけ残す inline ll lsb(ll v) { return v & -v; } inline int msb(int v) { return 1 << bsr(v); } // 最上位の1だけ残す inline ll msb(ll v) { return 1LL << bsr(v); } struct IO { IO() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); } } io; #pragma endregion template <typename T> pair<T, T> min(pair<T, T> &a, pair<T, T> &b) { if(a.first == b.first) { return a.second < b.second ? a : b; } else { return a.first < b.first ? a : b; } } void solve() { LL(n, a, b, x, y); VEC(ll, h, n); auto dp = make_vec(a + 1, b + 1, make_pair(LINF, LINF)); dp[0][0] = make_pair(n, h[n - 1]); rep(i, a + 1) rep(j, b + 1) { auto [index, life] = dp[i][j]; if(life > x) { if(i + 1 <= a) dp[i + 1][j] = min(dp[i + 1][j], make_pair(index, life - x)); } else { if(i + 1 <= a) dp[i + 1][j] = min(dp[i + 1][j], make_pair(max(0LL, index - 1), 0LL)); } ll power = y; while(power && index > 0) { if(life > power) { life -= power; power = 0; } else { power -= life; life = 0; if(index > 0) { life = h[--index]; } } if(power == 0) { if(j + 1 <= b) dp[i][j + 1] = min(dp[i][j + 1], make_pair(index, life)); } } } bool ok = false; if(dp[a][b].first == 0) ok = true; write(ok ? "Yes" : "No"); } int main() { int t = 1; // cin >> t; while(t--) { solve(); } }