Submission #647203

#	Time	Username	Problem	Language	Result	Execution time	Memory
647203		tigar	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	49 ms	8680 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int>w)
{
    ll n=w.size();
    vector<pair<ll, int> >wv2(n+1);
    for(int i=1; i<=n; i++){wv2[i]={w[i-1], i-1};}
    sort(wv2.begin(), wv2.end());
    vector<int>result;
    long long sums[n+1];
    sums[0]=(ll)0;
    for(int i=1; i<=n; i++)sums[i]=(ll)wv2[i].first+sums[i-1];
    for(int i=1, j=1; i<=n;)
    {
        ll sum=sums[i]-sums[j-1];
        if(sum>=l and sum<=u)
        {
            for(int k=j; k<=i; k++)result.push_back(wv2[k].second);
            break;
        }
        else if(sum<l)i++;
        else if(sum>u)j++;
    }
    return result;
}

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