Submission #444654

#	Time	Username	Problem	Language	Result	Execution time	Memory
444654		Hanksburger	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	300 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[200000];
vector<int> ans;
vector<int> find_subset(int l, int u, vector<int> w)
{
	long long n=sizeof(w)/sizeof(w[0]), r=u, index=0, sum=0;
    for (long long i=0; i<n; i++)
    {
        a[i].first=w[i];
        a[i].second=i;
    }
    sort(a, a+n);
    for (long long i=0; i<n; i++)
    {
        while (1)
        {
            if (l<=sum && sum<=r)
            {
                for (long long j=i; j<index; j++)
                    ans.push_back(a[j].second);
                return ans;
            }
            if (index<n && sum<=r)
            {
                sum+=a[index].first;
                index++;
            }
            else
                break;
        }
        sum-=a[i].first;
    }
    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