Submission #1102501

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102501		adiyer	Detecting Molecules (IOI16_molecules)	C++17	46 / 100	589 ms	840 KiB

molecules

#include "molecules.h"

#include <bits/stdc++.h>

#define ll long long

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    ll s = 0, L = l, R = u;
    int n = w.size();
    vector < int > ans;
    vector < pair < int, int > > a;
    for(int i = 0; i < n; i++) a.push_back({w[i], i});
    sort(a.begin(), a.end());
    for(int i = 0; i < n; i++){
    	s += a[i].first;
    	if(L <= s && s <= R){
    		for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
		    // for(int it : ans) cout << it << ' ';
		    // cout << '\n';
    		return ans;
    	}
    }
    s = 0;
    reverse(a.begin(), a.end());
    for(int i = 0; i < n; i++){
    	s += a[i].first;
    	if(L <= s && s <= R){
		    for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
    		// for(int it : ans) cout << it << ' ';
		    // cout << '\n';
    		return ans;
    	}
    }
    int it = 5000;
    while(it--){
    	s = 0;
	    random_shuffle(a.begin(), a.end());
	    // for(auto it : a) cout << it.first << ' ';
	    // cout << '\n';
	    for(int i = 0; i < n; i++){
	    	s += a[i].first;
	    	if(L <= s && s <= R){
			    for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
	    		// for(int it : ans) cout << it << ' ';
			    // cout << '\n';
	    		return ans;
	    	}
	    }
    }
    return ans;
}

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