Submission #487180

#	Time	Username	Problem	Language	Result	Execution time	Memory
487180		stefantaga	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	2 ms	1744 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int st, int dr, std::vector<int> w) {
    int n=w.size(),ok,i;
    long long sum;
    vector <int> bonjour;
    pair <int,int> salut[200005];
    for (i=0;i<n;i++)
    {
        salut[i].first=w[i];
        salut[i].second=i;
    }
    sort (salut,salut+n);
    for (int i=0;i<n;i++)
    {
        if (w[i]>dr)
        {
            ok=1;
        }
        if (st<=w[i]&&w[i]<=dr)
        {
            bonjour.push_back(i);
            return bonjour;
        }
    }
    if (ok==1)
    {
        return bonjour;
    }
    sum=0;
    for (i=n-1;i>0;i--)
    {
        if (sum<st)
        {
            sum=sum+salut[i].first;
            bonjour.push_back(salut[i].second);
        }
        else
        {
            if (sum<=dr)
            {
                return bonjour;
            }
            sum=sum-w[bonjour.back()];
            bonjour.pop_back();
        }
    }
    if (sum<=dr)
            {
                return bonjour;
            }
     bonjour.clear();
     return bonjour;
}

#ifdef HOME
int u,v,i,n;
int main()
{
    ifstream cin("date.in");
    ofstream cout("date.out");
    cin>>u>>v>>n;
    vector<int> a;
    for (i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        a.push_back(x);
    }
    vector <int> ceau = find_subset(u,v,a);
    if (ceau.size()==0)
    {
        cout<<"NU EXISTA";
    }
    else
    {
        for (int i=0;i<ceau.size();i++)
        {
            cout<<ceau[i]<<" ";
        }
    }
    return 0;
}
#endif // HOME

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