結果

問題 No.1522 Unfairness
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-05-28 23:19:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 5,578 bytes
コンパイル時間 6,435 ms
コンパイル使用メモリ 306,184 KB
実行使用メモリ 386,560 KB
最終ジャッジ日時 2024-04-27 05:05:01
合計ジャッジ時間 16,325 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 275 ms
386,560 KB
testcase_01 AC 271 ms
386,432 KB
testcase_02 AC 270 ms
386,560 KB
testcase_03 AC 289 ms
386,560 KB
testcase_04 AC 284 ms
386,560 KB
testcase_05 AC 291 ms
386,432 KB
testcase_06 AC 320 ms
386,432 KB
testcase_07 AC 291 ms
386,560 KB
testcase_08 AC 320 ms
386,560 KB
testcase_09 AC 287 ms
386,432 KB
testcase_10 AC 308 ms
386,560 KB
testcase_11 AC 281 ms
386,560 KB
testcase_12 AC 295 ms
386,432 KB
testcase_13 AC 307 ms
386,432 KB
testcase_14 AC 276 ms
386,432 KB
testcase_15 AC 327 ms
386,560 KB
testcase_16 AC 331 ms
386,432 KB
testcase_17 AC 331 ms
386,432 KB
testcase_18 AC 328 ms
386,432 KB
testcase_19 AC 331 ms
386,560 KB
testcase_20 AC 336 ms
386,432 KB
testcase_21 AC 267 ms
386,432 KB
testcase_22 AC 265 ms
386,432 KB
testcase_23 AC 269 ms
386,560 KB
testcase_24 AC 267 ms
386,560 KB
testcase_25 AC 271 ms
386,560 KB
testcase_26 AC 269 ms
386,560 KB
testcase_27 AC 268 ms
386,560 KB
testcase_28 WA -
testcase_29 AC 268 ms
386,560 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
class Scanner {
    vector<char> buffer;
    ssize_t n_written;
    ssize_t n_read;

public:
    Scanner(): buffer(1024*1024) { do_read(); }

    int64_t read_int() {
        int64_t ret = 0, sgn = 1;
        int ch = current_char();
        while (isspace(ch)) { ch = next_char(); }
        if (ch == '-') { sgn = -1; ch = next_char(); }
        for (; isdigit(ch); ch = next_char())
            ret = (ret * 10) + (ch - '0');
        return sgn * ret;
    }

private:
    void do_read() {
        ssize_t r = read(0, &buffer[0], buffer.size());
        if (r < 0) {
            throw runtime_error(strerror(errno));
        }
        n_written = r;
        n_read = 0;
    }

    inline int next_char() {
        ++n_read;
        if (n_read == n_written) { do_read(); }
        return current_char();
    }

    inline int current_char() {
        return (n_read == n_written) ? EOF : buffer[n_read];
    }
};

//Scanner scanner;
//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}

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));
  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;
}
0