Submission #636099

#	Time	Username	Problem	Language	Result	Execution time	Memory
636099		yogesh_sane	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	45 ms	6184 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<pair<int, int>> mol;
    vector<int> ans;
    int n = w.size();
    for(int i = 0; i < n; i++)
        mol.push_back({w[i],i});
    sort(mol.begin(), mol.end());
    int lo = 0, hi = 0;
    long long sum = mol[0].first;
    while(sum < l || sum > u){
        if(sum < l){
            if(hi < n-1){
                hi++;
                sum += mol[hi].first;
            }else{
                break;
            }
        }else if(sum > u){
            if(lo < n-1){
                sum -= mol[lo].first;
                lo++;
            }else{
                break;
            }
        }
    }
    if(l <= sum && sum <= u){
        for(int i = lo; i <= hi; i++)
            ans.push_back(mol[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