제출 #338461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338461		northlake	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	1 ms	380 KiB

jelly

#include<bits/stdc++.h>
#include<jelly.h>

using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
    int n = a.size(); int counter = 0; int answer = 0; vector<int> uebersprungene = {};
    if (x > y) swap(x, y);
    sort(a.begin(), a.end());

    int sum_x = 0;
    while ((sum_x + a[counter]) <= x && counter < n) {
        sum_x += a[counter];
        answer += 1; counter += 1;
    }
    bool possible = true;
    while (possible) {
        if (sum_x - a[counter-1] + a[counter] <= x) {
            sum_x = sum_x - a[counter-1] + a[counter];
            uebersprungene.push_back(a[counter-1]);
            counter += 1;
        } else possible = false;
    }

    int sum_y = 0;
    for (auto j : uebersprungene) {
        if (sum_y + j <= y) {
            sum_y += j;
            answer += 1;
        }
    }
    while ((sum_y + a[counter]) <= y && counter < n) {
        sum_y += a[counter];
        answer += 1; counter += 1;
    }
    
    return answer;
}

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