Submission #875719

#	Time	Username	Problem	Language	Result	Execution time	Memory
875719		Elvin_Fritl	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	348 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e5 + 545 , inf = 1e9 + 199;

#include "molecules.h"

vector<int> find_subset(int left, int right, vector<int> w){
    ll n = w.size();
    ll l = 0 , r = 0;
    ll sum = 0;
    vector<pair<ll,ll>>a(n);
    for(int i=0;i<n;i++) {
		a[i].first = w[i];
		a[i].second = i;
	}
	sort(a.begin() , a.end());
    vector<int> res;
    for(int i=0;i<n;i++) {
		sum += a[r].first;
		while(sum > right && l < i) {
			sum -= a[l++].first;
		}
		if(sum >= left && sum <= right && l < i) {
			break;
		}
	 }
	 if(sum < left || sum > right) {
		 return res;
	 }
	 for(int i=l;i<r;i++){
		 res.push_back(a[i].second);
	 }
	 return res;
}

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