Submission #299167

#	Time	Username	Problem	Language	Result	Execution time	Memory
299167		azatega	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	66 ms	8296 KiB

molecules

#include "molecules.h"
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

#define ll long long

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<pair<ll, int>> new_w;
    vector<int> bl;
    int n = w.size();

	ll tot_sum = 0;
	for(int i = 0; i < n; i++){
		tot_sum += w[i];
		new_w.push_back({w[i], i});
	}

	sort(new_w.begin(), new_w.end());

    ll currsum = 0;
    int s = 0;

    for(int i = 0; i < n; i++){
    	currsum += new_w[i].first;
    	while(currsum > u && s <= i){
    		currsum -= new_w[s].first;
    		s++;
    	}

    	if(currsum >= l && currsum <= u){
    		vector<int> res;
    		for(int x = s; x <= i; x++)
    			res.push_back(new_w[x].second);
    		return res;
    	}	
    }

    return bl;
}

/*int main(){
	int n, l, u;
	vector<int> niz;
	cin >> n >> l >> u;
	
	niz.resize(n);
	for(int i = 0; i < n; i++)
		cin >> niz[i];
	vector<int> rs = find_subset(l, u, niz);
	for(int i = 0; i < rs.size(); i++)
		cout << rs[i] << endl;
}*/

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