#947222 (C++14) No.2617 容量3のナップザック

提出ソース

結果

問題	No.2617 容量3のナップザック
ユーザー	woodywoody
提出日時	2024-01-30 00:25:29
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	375 ms / 2,000 ms
コード長	6,021 bytes
コンパイル時間	4,411 ms
コンパイル使用メモリ	239,176 KB
実行使用メモリ	113,160 KB
最終ジャッジ日時	2024-09-28 10:09:40
合計ジャッジ時間	11,640 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	230 ms 89,064 KB
testcase_13	AC	244 ms 100,352 KB
testcase_14	AC	205 ms 86,276 KB
testcase_15	AC	158 ms 71,776 KB
testcase_16	AC	163 ms 60,528 KB
testcase_17	AC	187 ms 83,052 KB
testcase_18	AC	193 ms 83,844 KB
testcase_19	AC	38 ms 16,384 KB
testcase_20	AC	220 ms 90,552 KB
testcase_21	AC	104 ms 45,532 KB
testcase_22	AC	248 ms 102,812 KB
testcase_23	AC	258 ms 100,492 KB
testcase_24	AC	14 ms 8,228 KB
testcase_25	AC	153 ms 67,120 KB
testcase_26	AC	159 ms 68,492 KB
testcase_27	AC	93 ms 37,636 KB
testcase_28	AC	11 ms 6,860 KB
testcase_29	AC	94 ms 41,280 KB
testcase_30	AC	235 ms 94,736 KB
testcase_31	AC	211 ms 81,464 KB
testcase_32	AC	262 ms 112,668 KB
testcase_33	AC	272 ms 112,668 KB
testcase_34	AC	290 ms 112,664 KB
testcase_35	AC	286 ms 112,668 KB
testcase_36	AC	375 ms 112,800 KB
testcase_37	AC	296 ms 112,656 KB
testcase_38	AC	269 ms 112,800 KB
testcase_39	AC	270 ms 113,152 KB
testcase_40	AC	294 ms 112,796 KB
testcase_41	AC	199 ms 113,160 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    ll n,k,s,a,b,m; cin>>n>>k>>s>>a>>b>>m;
    vl f(n*2);
    f[0] = s;
    rep1(i,n*2) f[i] = (f[i-1] * a + b) % m;
    vl w(n),v(n);
    rep(i,n) w[i] = f[i] % 3 + 1;
    rep(i,n) v[i] = w[i] * f[i+n];
    vvl x(3);
    rep(i,n) x[w[i]-1].pb(v[i]);
    while(sz(x[0]) < 3*n) x[0].pb(0);
    while(sz(x[1]) < n) x[1].pb(0);
    while(sz(x[2]) < n) x[2].pb(0);
    rep(i,3) sort(rrng(x[i]));
    vvl sum(3);
    rep(i,3){
        sum[i] = vl(sz(x[i]));
        rep(j,sz(x[i])){
            sum[i][j] += x[i][j];
            if (j) sum[i][j] += sum[i][j-1];
        }
    }
    ll ans = sum[2][k-1];
    rep(i,k){
        ll tmp = 0;
        if (i) tmp = sum[2][i-1];
        int l = 0, u = k-i-1;

        auto check = [&](int j)->bool{
            int cnt1 = j + ((k-i)-j) * 3;
            int id1 = cnt1 - 1;
            int id2 = cnt1 - 2;
            int id3 = j;
            ll dif = x[1][id3] - x[0][id1] - x[0][id2];
            return (dif>=0);
        };

        if (check(u)){
            tmp += sum[1][k-i-1];
            tmp += sum[0][k-i-1];
            chmax(ans, tmp);
            continue;
        }else if(!check(l)){
            tmp += sum[0][(k-i)*3-1];
            chmax(ans, tmp);
            continue;
        }
        while(u-l>1){
            int mid = (l+u) / 2;
            if (check(mid)) l = mid;
            else u = mid;
        }
        tmp += sum[1][l] + sum[0][(k-i) + (k-i-(l+1))*2 - 1];
        chmax(ans, tmp);
    }
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード