Submission #774997

#	Time	Username	Problem	Language	Result	Execution time	Memory
774997		Minindu2006	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	304 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;
    for(int i=0;i<(int)w.size();i++)
        arr.push_back({w[i], i});
    sort(arr.begin(), arr.end());
    int p1 = 0, p2 = 0, pos = 0;
    long long sum = arr[0].first;
    while(p1 < (int)w.size())
    {
        if(sum >= L && sum <= U)
        {
            pos = 1;
            break;
        }
        else if(sum < L)
        {
            p1++;
            if(p1 == (int)w.size())
            sum += arr[p1].first;
        }   
        else if(sum > U)
        {
            sum -= arr[p2].first;
            p2++;
        }   
    }
    vector<int> ans;
    if(!pos)
        return ans;
    for(int i=p2;i<=p1;i++)
        ans.push_back(arr[i].second);
    return ans;
}

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