結果

問題 No.2093 Shio Ramen
コンテスト
ユーザー fuppy_kyopro
提出日時 2022-10-31 23:19:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 9 ms / 2,000 ms
コード長 4,984 bytes
コンパイル時間 2,323 ms
コンパイル使用メモリ 204,620 KB
最終ジャッジ日時 2025-02-08 16:24:11
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << 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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int n, W;
vi v, w;

ll zantei = 0;

void solve(vi &state, ll already_w, ll already_v, int cnt = 0) {
    int rem_w = W - already_w;
    ll score = already_v;
    double border_score = 0;

    int last_i = -1;
    rep(i, n) {
        if (state[i]) {
            continue;
        }

        if (rem_w >= w[i]) {
            rem_w -= w[i];
            score += v[i];
        } else {
            border_score = v[i] * (double)rem_w / w[i];
            last_i = i;
            break;
        }
    }

    if (score + border_score <= zantei) {
        return;
    }
    chmax(zantei, score);

    if (last_i == -1) {
        return;
    }
    last_i = cnt;

    if (border_score != 0) {
        // use last_i
        if (already_w + w[last_i] <= W) {
            state[last_i] = 1;
            solve(state, already_w + w[last_i], already_v + v[last_i], cnt + 1);
        }

        // not use last_i
        state[last_i] = -1;
        solve(state, already_w, already_v, cnt + 1);

        state[last_i] = 0;
    }
}

signed main() {
    cin >> n >> W;
    v.resize(n);
    w.resize(n);

    vector<pii> vw(n);
    rep(i, n) {
        // cin >> v[i] >> w[i];
        cin >> w[i] >> v[i];
        vw[i] = {v[i], w[i]};
    }
    sort(all(vw), [](const pii &vw1, const pii &vw2) {
        return vw1.first / (double)vw1.second > vw2.first / (double)vw2.second;
    });

    rep(i, n) {
        v[i] = vw[i].first;
        w[i] = vw[i].second;
    }
    // DEBUG_VEC(v);
    // DEBUG_VEC(w);

    vi state(n);
    solve(state, 0, 0);
    cout << zantei << endl;
}
0