結果

問題 No.2155 みちらcolor
ユーザー a16784542a16784542
提出日時 2022-12-09 21:48:29
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 138 ms / 2,000 ms
コード長 3,621 bytes
コンパイル時間 4,085 ms
コンパイル使用メモリ 257,124 KB
実行使用メモリ 162,816 KB
最終ジャッジ日時 2024-04-22 21:41:21
合計ジャッジ時間 10,613 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 135 ms
156,672 KB
testcase_01 AC 92 ms
108,032 KB
testcase_02 AC 72 ms
82,944 KB
testcase_03 AC 84 ms
98,688 KB
testcase_04 AC 80 ms
97,024 KB
testcase_05 AC 111 ms
134,528 KB
testcase_06 AC 50 ms
61,184 KB
testcase_07 AC 36 ms
44,032 KB
testcase_08 AC 92 ms
109,568 KB
testcase_09 AC 101 ms
120,448 KB
testcase_10 AC 69 ms
80,128 KB
testcase_11 AC 62 ms
75,264 KB
testcase_12 AC 103 ms
120,576 KB
testcase_13 AC 13 ms
15,744 KB
testcase_14 AC 106 ms
128,384 KB
testcase_15 AC 17 ms
22,144 KB
testcase_16 AC 58 ms
73,728 KB
testcase_17 AC 24 ms
29,824 KB
testcase_18 AC 94 ms
112,640 KB
testcase_19 AC 102 ms
122,240 KB
testcase_20 AC 126 ms
150,272 KB
testcase_21 AC 138 ms
159,744 KB
testcase_22 AC 115 ms
131,456 KB
testcase_23 AC 113 ms
134,656 KB
testcase_24 AC 135 ms
161,280 KB
testcase_25 AC 130 ms
154,880 KB
testcase_26 AC 136 ms
148,736 KB
testcase_27 AC 135 ms
158,080 KB
testcase_28 AC 125 ms
142,464 KB
testcase_29 AC 121 ms
137,856 KB
testcase_30 AC 113 ms
133,120 KB
testcase_31 AC 136 ms
150,272 KB
testcase_32 AC 120 ms
144,128 KB
testcase_33 AC 123 ms
148,736 KB
testcase_34 AC 121 ms
148,608 KB
testcase_35 AC 116 ms
136,320 KB
testcase_36 AC 124 ms
147,072 KB
testcase_37 AC 134 ms
158,208 KB
testcase_38 AC 112 ms
134,656 KB
testcase_39 AC 134 ms
162,688 KB
testcase_40 AC 135 ms
162,816 KB
testcase_41 AC 138 ms
162,688 KB
testcase_42 AC 138 ms
162,688 KB
testcase_43 AC 16 ms
20,608 KB
testcase_44 AC 10 ms
14,208 KB
testcase_45 AC 10 ms
14,336 KB
testcase_46 AC 5 ms
7,936 KB
testcase_47 AC 26 ms
34,560 KB
testcase_48 AC 26 ms
33,024 KB
testcase_49 AC 9 ms
12,544 KB
testcase_50 AC 23 ms
31,360 KB
testcase_51 AC 24 ms
31,488 KB
testcase_52 AC 23 ms
29,824 KB
testcase_53 AC 26 ms
33,024 KB
testcase_54 AC 22 ms
28,416 KB
testcase_55 AC 11 ms
14,208 KB
testcase_56 AC 24 ms
31,488 KB
testcase_57 AC 18 ms
22,144 KB
testcase_58 AC 17 ms
23,680 KB
testcase_59 AC 11 ms
15,744 KB
testcase_60 AC 12 ms
17,280 KB
testcase_61 AC 16 ms
22,016 KB
testcase_62 AC 22 ms
29,824 KB
testcase_63 AC 20 ms
25,088 KB
testcase_64 AC 19 ms
25,088 KB
testcase_65 AC 12 ms
15,872 KB
testcase_66 AC 19 ms
25,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
  int n,m,l;cin>>n>>m>>l;
  V<int> a(n);
  rep(i,n)cin>>a[i];
  const int x=2e5;
  V<V<int>> dp(n+1,V<int>(x));
  dp[0][l]=1;
  rep(i,n){
    rep(j,x){
      if(dp[i][j]==0)continue;
      dp[i+1][j]=1;
      dp[i+1][(j+a[i])/2]=1;
    }
  }
  if(dp[n][m]){
    cout<<"Yes"<<endl;
    return ;
  }
  else{
    cout<<"No"<<endl;
    return ;
  }
}};

signed main() {
  int ts = 1;
  // scanf("%lld",&ts);
  rep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif
0