Submission #318244

#	Time	Username	Problem	Language	Result	Execution time	Memory
318244		Vladth11	Jelly Flavours (IOI20_jelly)	C++14	100 / 100	134 ms	78820 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair <int,int> pii;

int dp[2005][10001];
int costb[2005];
int i;

struct ura {
    int first, second, poz;
};
ura elem[2005];

bool cmp(ura a, ura b) {
    return a.second < b.second;
}

bool cm(ura a, ura b) {

    return a.first < b.first;
}
int bad[2005];
int ord[2005];

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
    int n = a.size();
    for(i = 0; i < n; i++)
        elem[i] = {a[i], b[i], i};
    sort(elem, elem + n, cm);
    int maxim = 0;
    for(i = 0; i <= n; i++){
        for(int j = 0; j <= x; j++)
            dp[i][j] = 2e9;
    }
    dp[0][0] = 0;
    for(i = 1; i <= n; i++) {
        costb[i] = 2e9;
        ord[i] = elem[i - 1].poz;
        for(int j = 0; j <= x; j++) {
            dp[i][j] = min(dp[i][j], dp[i - 1][j] + elem[i - 1].second);
            if(j >= elem[i - 1].first)
                dp[i][j] = min(dp[i][j], dp[i - 1][j - elem[i - 1].first]);
           // cout << dp[i][j] << " ";
            costb[i] = min(costb[i], dp[i][j]);
        }
       // cout << "\n";
    }
    sort(elem, elem + n, cmp);
    for(i = 0; i <= n; i++) {
        if(i > 0) {
            bad[ord[i]] = 1;
        }
        //cout << i << " ";
        int raman = y - costb[i], cnt = 0;
        if(raman < 0)
            continue;
       // cout << raman << " ";
        for(int j = 0; j < n; j++) {
            if(bad[elem[j].poz])
                continue;
            if(raman - elem[j].second < 0){
                break;
            }
            //cout << elem[j].second << "\n";
            cnt++;
            raman -= elem[j].second;
        }
        //cout << cnt + i << "\n";
        maxim = max(maxim, cnt + i);
    }
    return maxim;
}
/*
static int n, x, y;
static std::vector<int> a, b;

int main() {
    assert(scanf("%d %d %d", &n, &x, &y) == 3);
    a.resize(n);
    b.resize(n);
    for (int i = 0; i < n; i++) {
        assert(scanf("%d %d", &a[i], &b[i]) == 2);
    }

    fclose(stdin);

    int answer = find_maximum_unique(x, y, a, b);

    printf("%d\n", answer);
}
*/

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