Submission #419260

#	Time	Username	Problem	Language	Result	Execution time	Memory
419260		JeanBombeur	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	56 ms	6076 KiB

molecules

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include "molecules.h"
using namespace std;

vector<int> find_subset(int mini, int maxi, vector<int> Tailles) {
    
    long long inf = mini, sup = maxi;
    
    vector <pair <long long, int>> Molecules;
    
    int nbMolecules = 0;
    
    for (int a : Tailles)
    {
        Molecules.push_back({(long long)a, nbMolecules ++});
    }
    sort(Molecules.begin(), Molecules.end());
    
    long long sum = 0;
    
    int gauche = 0, droite = 0;
    while (droite < nbMolecules && sum + Molecules[droite].first <= sup)
    {
        sum += Molecules[droite ++].first;
    }
    
    while (droite < nbMolecules && sum < inf)
    {
        sum += Molecules[droite ++].first - Molecules[gauche ++].first;
    }
    
    if (droite == nbMolecules && sum < inf)
        return vector<int>(0);
    
    vector <int> ans;
    for (int i = gauche; i < droite; i ++)
    {
        ans.push_back(Molecules[i].second);
    }
    return ans;
}

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