Submission #439444

#	Time	Username	Problem	Language	Result	Execution time	Memory
439444		jlallas384	Jelly Flavours (IOI20_jelly)	C++17	9 / 100	2 ms	436 KiB

jelly

#include <bits/stdc++.h>
using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();
	vector<int> hv(n);
    vector<tuple<int,int,int>> st;
    for(int i = 0; i < n; i++){
        st.emplace_back(a[i],i,0);
    }
    for(int i = 0; i < n; i++){
        st.emplace_back(b[i],i,1);
    }
    sort(st.begin(), st.end());
    int ans = 0;
    for(auto [p,id,ty]: st){
        if(hv[id] || p > (ty == 0 ? x : y)) continue;
        (ty == 0 ? x : y) -= p;
        ans += ++hv[id];
    }
    return ans;
}

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