Submission #788847

#	Time	Username	Problem	Language	Result	Execution time	Memory
788847		Minindu206	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	39 ms	6184 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) {
    int n = w.size();
    vector<pair<int, int>> ww;
    for(int i=0;i<n;i++)    
        ww.push_back({w[i], i});
    sort(ww.begin(), ww.end());
    ll sum = ww[0].first;
    int a = 0, b = 0, pos = 0;
    while(a < n)
    {
        if(sum >= l && sum <= u)
        {
            pos = 1;
            break;
        }    
            
        if(sum < l)
        {
            b++;
            if(b == n)
                break;
            sum += ww[b].first;
        }
        if(sum > u)
        {
            sum -= ww[a].first;
            a++;
        }
    }
    vector<int> ans;
    if(!pos)
        return ans;
    for(int i=a;i<=b;i++)
        ans.push_back(ww[i].second);
    return ans;
}

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