Submission #418247

#TimeUsernameProblemLanguageResultExecution timeMemory
418247salehDetecting Molecules (IOI16_molecules)C++17
19 / 100
1 ms204 KiB
#include "molecules.h"
#include <bits/stdc++.h>

#define int long long

using namespace std;


vector<int32_t> find_subset(int32_t l, int32_t u, vector<int32_t> w) {
	int n = w.size(), sum = 0;
	int p = 0, q = n;
	if (accumulate(w.begin(), w.end(), 0ll) < l) return {};
	while (p < n && sum + w[p] <= u) sum += w[p++];
	if (sum >= l) {
		vector<int32_t> v;
		for (int i = 1; i <= p; i++) v.push_back(i - 1);
		return v;
	}
	while (p > 0 && sum < l) {
		sum += w[--q];
		sum -= w[--p];
	}
	if (sum < l) return {};
	else {
		vector<int32_t> v;
		for (int i = 1; i <= p; i++) v.push_back(i - 1);
		for (int i = n; i > q; i--) v.push_back(i - 1);
		return v;
	}
}
//int32_t main() {}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...