제출 #260047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260047		lani1akea	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	65 ms	6252 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

#define F first
#define S second
#define ll long long
#define pb push_back
#define endl '\n'
#define rep(x) cerr<<#x<<"="<<x<<endl
#define OK cerr<<"OK"<<endl<<flush
using namespace std;

const int MOD = 1e9 + 7;
const int N = 510;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<pair<int, int>> v;	
	for (int i = 0; i < n; ++i)
		v.pb({w[i], i});
	sort(v.begin(), v.end());
	ll sum = (ll)v[0].F, le = 0, ri = 1;
	while(le < n) {
		while(ri < n and sum < l) sum += (ll)v[ri++].F;
		if (sum >= l and sum <= u) break;
		sum -= (ll)v[le++].F;
	}
	rep(le);
	rep(ri);
	vector<int> res;
	for (int i = le; i < ri; ++i)
		res.pb(v[i].S);

	return res;
}

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