Submission #1062008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062008		Hectorungo_18	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	348 KiB

molecules

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

// #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());

    vector<int> sol;
    for(int i = n-1; i >= 0; i--){
        int aux = v[i].first;
        vector<int> pos;
        pos.push_back(i);
        for(int j = i-1; i >= 0; j--){
            if(aux+v[j].first > r) continue;
            else{
                aux+=v[j].first;
                pos.push_back(v[j].second);
            }
            if(aux >= l) break;
        }
        if(aux >= l && aux <= r){
            sol = pos;
            reverse(sol.begin(), sol.end());
            break;
        }
    }


    return sol;
    
    
    
    
}

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