Submission #687094

#TimeUsernameProblemLanguageResultExecution timeMemory
687094viwlesxqDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms212 KiB
#include "molecules.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef int64_t ll;
typedef string str;
 
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
 
vector <int> find_subset(int l, int u, vector <int> w) {
	deque <int> d;
	ll cur = 0;
	vector <pair <int, int>> v;
	for (int i = 0; i < sz(w); i++) {
		v.pb({w[i], i + 1});
	}
	sort(all(v));
	int tl = 0, tr = 0;
	while (tr < sz(w)) {
		if (cur < l) {
			cur += v[tr].F;
			d.pb(v[tr].S);
			tr++;
		}
		if (cur > u) {
			cur -= v[tl].F;
			d.ppf();
			tl++;
		}
		if (cur >= l && cur <= u) {
			break;
		}
	}
	if (cur >= l && cur <= u) {
		return vector <int> (all(d));
	}
	return vector <int> (0);
}
#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...