제출 #741852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
741852		mzv	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	304 KiB

molecules

#include <bits/stdc++.h>

#define ccd ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define endl '\n'
#define usaco freopen("(insert).in", "r", stdin);freopen("(insert).out", "w", stdout);

using namespace std;

/* ------------------------ hi lol ------------------------ */

// author : mzv

vector<int> find_subset(int l, int u, vector<int> w) { // array sucks at size (and also i keep getting CE when using int[], idk why :/)
	int k = w.size();
	sort(w.begin(),w.end());
	int idx=0;
	ll sum=0;
	for (int i=0;i<k;i++) {
		sum+=w[i];
		if (sum>u) {
			while (sum>u) {
				sum-=w[idx];
				idx++;
			}
		}
		if (sum>=l&&sum<=u) {
			// done
			vector<int> v;
			for (int x=idx;x<=i;x++) {
				v.push_back(x);
			}
			return v;
		}
	}
	// not found
	return {};
}

/*
int main() {
	ccd
//	usaco
//	vector<int> p = find_subset(15, 17, {6, 8, 8, 7}); // 1 2
//	vector<int> p = find_subset(14, 15, {5, 5, 6, 6}); // empty
	vector<int> p = find_subset(10, 20, {15, 17, 16, 18}); // 0
	for (auto pp : p) {
		cout << pp << " ";
	}
}
*/
/*
two pointer approach
1 3 5 7 9
11 14

1
4
9
16
while --> 15,12 stop!

5,7 noted!
*/

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31