Submission #406443

#	Time	Username	Problem	Language	Result	Execution time	Memory
406443		victoriad	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	2 ms	332 KiB

jelly

#include "jelly.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
		vector<pair<int,int> >pa(n);
		vector<pair<int,int> >pb(n);
		for(int i=0;i<n;i++){
			pa[i]=make_pair(a[i],i);
			pb[i]=make_pair(b[i],i);
		}
		sort(pb.begin(),pb.end());
		sort(pa.begin(),pa.end());
		int r=0;
		vector<bool>v(n,false);
		bool f=true,s=true;
		for(int i=0;i<n;i++){
			if(f){
			if(!v[pb[i].second]){
				if(pb[i].first<=y){
					r++;
					y-=pb[i].first;
					v[pb[i].second]=true;
				}
				else{
					f=false;
				}
			}
			}
			if(s){
			if(!v[pa[i].second]){
				if(pa[i].first<=x){
					r++;
					x-=pa[i].first;
					v[pa[i].second]=true;
				}
				else{
					s=false;
				}
			}
			}
			if(!f && !s)break;

		}
		return r;
}

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