Submission #1062142

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062142		Hectorungo_18	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	1058 ms	5592 KiB

molecules

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

mt19937 gnd(time(nullptr));

// #define int long long
vector<int> find_subset(int l, int r, 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());

    int aux = 0;
    vector<int> ba(n), bb(n);
    for(int i = 0; i < n; i++){
        ba[i]=v[i].first;
        bb[i]=v[i].second;
    }
    vector<int> sol;
    for(int i = n-1; i >= 0; i--){
        if(ba[i] > r) continue;
        sol.clear();
        sol.push_back(bb[i]);
        aux = ba[i];
        bool im = 1;
        int fal = l-aux;
        int cp = i;
        while(l > aux){
            fal = r-aux;
            auto it = upper_bound(ba.begin(), ba.begin()+cp, fal);
            if(it == ba.end() || it == ba.begin()){
                im = 0;
                break;
            }
            else{
                // if(it == ba.begin()+cp) it--;
                cp = it-ba.begin()-1;
                aux+=ba[cp];
                sol.push_back(bb[cp]);
            }
            if(aux >= l && aux <= r) break;
            // cp++;
            if(cp == 0){
                im = 0;
                break;
            }
        }
        if(im == 0) continue;
        if(aux <= l && aux >= r) break;
        break;


    }
    if(aux < l || aux > r){
        sol.clear();
    }
    return sol;
    
    
    
    
}

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