Submission #1102550

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102550		adiyer	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	1061 ms	7364 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());
    int j = 0;
    for(int i = 0; i < n; i++) s += a[i].first;
    for(int i = 0; i < n; i++){
    	while(j <= i) s -= a[j].first, j++;
    	s += a[i].first;
    	while(s > R && j < n) s -= a[j].first, j++;
    	if(L <= s && s <= R){
    		for(int it = 0; it <= i; it++) ans.push_back(a[it].second);
		    for(int it = max(j, i + 1); it < n; it++) ans.push_back(a[it].second);
		    return ans;
    	}
    }
    s = 0;
    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 = 500;
    while(it--){
    	s = 0;
	    random_shuffle(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);
	    		return ans;
	    	}
	    }
    }
    return ans;
}

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