Submission #867552

#	Time	Username	Problem	Language	Result	Execution time	Memory
867552		StefanL2005	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	40 ms	4344 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long

vector<int> find_subset(int L, int R, vector<int> v)
{
    int n = v.size();
    vector<pair<int,int>> w(n);

    for (int i = 0; i < n; i++)
        w[i] = make_pair(v[i], i);
    sort(w.begin(), w.end());

    deque<int> Q;
    vector<int> result;
    ll sum = 0;

    if (w[0].first > R)
        return result;  
    if (R - L < w[n-1].first - w[0].first)
        return result;
    
    for (int i = 0; i < n; i++)
    {
        if(L <= sum && sum <= R)
            break;
        
        sum += w[i].first;
        Q.push_back(w[i].second);

        if (sum > R)
        {
            sum-= v[Q.front()];
            Q.pop_front();
        }
    }

    if (L <= sum && sum <= R)
        while(!Q.empty())
        {
            result.push_back(Q.front());
            Q.pop_front();       
        }

    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