Submission #647200

#TimeUsernameProblemLanguageResultExecution timeMemory
647200tigarDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms228 KiB
#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<int, int> >wv2(n+1);
    for(int i=1; i<=n; i++){wv2.push_back({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;)
    {
        int sum=sums[i]-sums[j-1];
        if(sum>=l and sum<=u)
        {
            for(int k=j-1; k<i; k++)result.push_back(wv2[k].second);
            break;
        }
        else if(sum<l)i++;
        else if(sum>u)j++;
    }
    return result;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...