結果
問題 | No.1522 Unfairness |
ユーザー | 👑 PCTprobability |
提出日時 | 2021-11-20 19:51:05 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,770 bytes |
コンパイル時間 | 7,836 ms |
コンパイル使用メモリ | 302,308 KB |
実行使用メモリ | 386,532 KB |
最終ジャッジ日時 | 2023-09-02 16:10:44 |
合計ジャッジ時間 | 19,017 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 278 ms
386,100 KB |
testcase_01 | AC | 278 ms
386,084 KB |
testcase_02 | AC | 279 ms
386,240 KB |
testcase_03 | AC | 301 ms
386,092 KB |
testcase_04 | AC | 295 ms
386,088 KB |
testcase_05 | AC | 303 ms
386,100 KB |
testcase_06 | AC | 334 ms
386,420 KB |
testcase_07 | AC | 307 ms
386,240 KB |
testcase_08 | AC | 336 ms
386,344 KB |
testcase_09 | AC | 302 ms
386,228 KB |
testcase_10 | AC | 322 ms
386,520 KB |
testcase_11 | AC | 290 ms
386,240 KB |
testcase_12 | AC | 293 ms
386,332 KB |
testcase_13 | AC | 320 ms
386,532 KB |
testcase_14 | AC | 284 ms
386,364 KB |
testcase_15 | AC | 349 ms
386,480 KB |
testcase_16 | AC | 346 ms
386,344 KB |
testcase_17 | AC | 349 ms
386,352 KB |
testcase_18 | AC | 348 ms
386,396 KB |
testcase_19 | AC | 349 ms
386,496 KB |
testcase_20 | AC | 351 ms
386,496 KB |
testcase_21 | AC | 280 ms
386,156 KB |
testcase_22 | AC | 279 ms
386,080 KB |
testcase_23 | AC | 280 ms
386,156 KB |
testcase_24 | AC | 281 ms
386,168 KB |
testcase_25 | AC | 279 ms
386,216 KB |
testcase_26 | AC | 278 ms
386,152 KB |
testcase_27 | AC | 278 ms
386,088 KB |
testcase_28 | AC | 281 ms
386,088 KB |
testcase_29 | WA | - |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("Ofast") #include <bits/stdc++.h> #include <unistd.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = long long; #define endl "\n" #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define all(s) (s).begin(),(s).end() //#define rep2(i, m, n) for (int i = (m); i < (n); ++i) //#define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define pb push_back #define P pair<ll,ll> #define REP(i, n) for (int i = 0; i < (n); ++i) #define in scanner.read_int() //const ll mod = 998244353; const ll mod = 1000000007; const ll inf = 4500000000000000000ll; static const long double pi = 3.141592653589793; template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];} template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];} template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;} template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}} template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;} void yes(bool a){cout<<(a?"yes":"no")<<endl;} void YES(bool a){cout<<(a?"YES":"NO")<<endl;} void Yes(bool a){cout<<(a?"Yes":"No")<<endl;} void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; } void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; } void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; } template<class T>auto min(const T& a){ return *min_element(all(a)); } template<class T>auto max(const T& a){ return *max_element(all(a)); } template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;} 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<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } void cincout(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(20); } int main() { cincout(); ll a,b; cin>>a>>b; vector<ll> x(a-1); vector<ll> y(a-1); vector<ll> t(a); vcin(t); sor(t); for(int i=0;i<a-1;i++){ y[i]=t[i+1]; x[i]=t[i+1]-t[i]; swap(x[i],y[i]); } a--; //x価値 y重さ vector<vector<ll>> dp(7000,vector<ll>(7000,0)); rever(x); rever(y); dp[0][y[0]]=x[0]; dp[1][y[1]]=x[1]; for(int i=0;i<a;i++){ if(i){ for(int j=0;j<=6999;j++) chmax(dp[i][j],dp[i-1][j]); } if(i>=2){ for(int j=0;j<=6999;j++){ if(j-y[i]>=0) chmax(dp[i][j],dp[i-2][j-y[i]]+x[i]); chmax(dp[i][j],dp[i-1][j]); } } for(int j=1;j<=6999;j++) chmax(dp[i][j],dp[i][j-1]); } cout<<dp[a-1][b]<<endl; }