Submission #775005

#	Time	Username	Problem	Language	Result	Execution time	Memory
775005		Minindu2006	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	40 ms	6168 KiB

molecules

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

std::vector<int> find_subset(int L, int U, std::vector<int> w)
{
    vector<pair<int, int>> arr;
    int s = w.size();
    for(int i=0;i<s;i++)
        arr.push_back({w[i], i});
    sort(arr.begin(), arr.end());
    int p1 = 0, p2 = 0, pos = -1;
    long long sum = arr[0].first;
    while(p1 < s)
    {
        if(sum >= L && sum <= U)
        {
            pos = 1;
            break;
        }
        else if(sum < L)
        {
            p2++;
            if(p2 == s)
              break;
            sum += arr[p2].first;
        }   
        else if(sum > U)
        {
            sum -= arr[p1].first;
            p1++;
        }   
    }
    vector<int> ans;
    if(pos == -1)
        return ans;
    for(int i=p1;i<=p2;i++)
        ans.push_back(arr[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