Submission #1168970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168970		aentrenus	Jelly Flavours (IOI20_jelly)	C++20	0 / 100	1 ms	328 KiB

jelly

#include "jelly.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
#define all(a) a.begin(), a.end()
#define print(a) for (auto elem:a) cout<<elem<<' '; cout<<'\n'
#define segprep(b) resize(1<<((int)ceil(log2(b.size()))+1))
#define FOR(a) for (int _ = 0; _ < a; _++)

int n;

// int solve1(int &x, int &y, vi &a, vi &b)

int solve3(int x, vi a){
	// O CHUJ CHODZI
	sort(all(a));
	for (int i = 0; i < n; i++){
		cerr<<"x: "<<x<<", a[i]: "<<a.at(i)<<'\n';
		if (x >= a.at(i)){
			x -= a.at(i);
			continue;
		}
		return i;
	}
	return n;
}

int find_maximum_unique(int x, int y, vi a, vi b) {
	n = a.size();

	if (y == 0) return solve3(x, a);
	return 0;
}

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