Submission #1019729

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019729		esomer	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	36 ms	5724 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pair<int, int>> v(n);
    for(int i = 0; i < n; i++){
        v[i] = {w[i], i};
    }
    sort(v.begin(), v.end());
    ll sum = 0;
    int frst = 0;
    for(int i = 0; i < n; i++){
    	sum += v[i].first;
    	if(sum >= l && sum <= u){
            vector<int> ans;
            for(int j = frst; j <= i; j++) ans.push_back(v[j].second);
            return ans;
    	}
    	if(sum > u){
    		sum -= v[frst].first;
    		frst++;
    		if(sum >= l && sum <= u){
	            vector<int> ans;
	            for(int j = frst; j <= i; j++) ans.push_back(v[j].second);
	            return ans;
	    	}
    	}
    }
    return {};
}

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