Submission #400912

#	Time	Username	Problem	Language	Result	Execution time	Memory
400912		iraira655	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	2 ms	332 KiB

jelly

#include "jelly.h"
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
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>> a1, b1;
	for(int i =0; i<n; i++){
		pair<int, int> cost;
		cost.first = a[i];
		cost.second = i;
		a1.push_back(cost);

		cost.first = b[i];
		b1.push_back(cost);
	}
	sort(a1.begin(), a1.end());
	sort(b1.begin(), b1.end());
	int X = x, Y = y;
	int variety = 0;
	vector <int> bought;
	for(int j=0; j<n; j++){
		int presA = 0, presB = 0;
		if(a1[j].second == b1[j].second){//same flavor
			if(a1[j].first<=b1[j].first){ //lowest price
				if(X<=a1[j].first){
					X-=a1[j].first;
					variety++;
					bought.push_back(a1[j].second);
				}
				else if(Y<=b1[j].first){//if x doesn't have enough
					Y-=b1[j].first;
					variety++;
					bought.push_back(b1[j].second);
				}
			} else{
				if(Y<=b1[j].first){//if x doesn't have enough
					Y-=b1[j].first;
					variety++;
					bought.push_back(b1[j].second);

				}
				else if(X<=a1[j].first){
					X-=a1[j].first;
					variety++;
					bought.push_back(a1[j].second);

				}
			}
		}
		else{
			int sizBo = bought.size();
			for(int k = 0; k<sizBo; k++){
				if(bought[k] == a1[j].second){
					presA++;
					break;
				}
				else if(bought[k] == b1[j].second){
					presB++;
					break;
				}
			}
			if(a1[j].first<=b1[j].first){ //lowest price
				if(X<=a1[j].first && presA!= 1){
					X-=a1[j].first;
					variety++;
					bought.push_back(a1[j].second);

				}
				else if(Y<=b1[j].first && presB!= 1){
					Y-=b1[j].first;
					variety++;
					bought.push_back(b1[j].second);

				}
			}
		}
	}

	return variety;
}

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