제출 #1222272

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222272		steveonalex	Jelly Flavours (IOI20_jelly)	C++20	100 / 100	197 ms	77640 KiB

jelly

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "jelly.h"

ostream& operator << (ostream &os, pair<int, int> x){
    return os << "(" << x.first << ", " << x.second << ")";
}

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
    int n = a.size();
    vector<pair<int, int>> p(n);
    for(int i = 0; i < n; ++i) p[i] = {a[i], b[i]};

    sort(ALL(p));

    int dp[n+1][x+1]; memset(dp, 63, sizeof dp);
    dp[0][0] = 0;
    for(int i = 0; i < n; ++i) for(int j = 0; j <= x; ++j) {
        minimize(dp[i+1][j], dp[i][j] + p[i].second);
        if (j + p[i].first <= x) {
            minimize(dp[i+1][j+p[i].first], dp[i][j]);
        }
    } 

    int ans = 0;
    for(int i = 0; i <= n; ++i){
        vector<int> pref; pref.push_back(0);
        for(int j = i; j < n; ++j) pref.push_back(p[j].second);
        sort(ALL(pref));
        for(int i = 1; i < (int) pref.size(); ++i) pref[i] += pref[i-1];

        for(int j = 0; j <= x; ++j) if (dp[i][j] <= y){
            int bruh = y - dp[i][j];
            int idx = upper_bound(ALL(pref), bruh) - pref.begin() - 1;
            maximize(ans, i + idx);
        }
    }

    return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 24 / 24
• Subtask 3: 9 / 9
• Subtask 4: 10 / 10
• Subtask 5: 14 / 14
• Subtask 6: 32 / 32