Submission #568159

#	Time	Username	Problem	Language	Result	Execution time	Memory
568159		definitelynotmee	Detecting Molecules (IOI16_molecules)	C++98	100 / 100	51 ms	5040 KiB

molecules

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;
 
vector<int> find_subset(int l, int u, vector<int> v){
    ll sum = 0;
    int n = v.size();
    vector<ll> w(n);
    for(int i = 0; i < n; i++)
        w[i] = v[i];
    
    vector<int> o(n);
    iota(all(o),0);
    sort(all(o),[&](int a, int b){
        return w[a] < w[b];
    });
    int ct = 0;
    for(int i = 0; i < n; i++){
        if(sum+w[o[i]] > u)
            break;
        ct++;
        sum+=w[o[i]];
    }
    if(ct == n && sum < l)
        return{};
    vector<int> resp;
    while(sum < l && ct){
        resp.push_back(o.back());
        sum+=w[o.back()]-w[o[ct-1]];
        o.pop_back();
        ct--;
    }
    if(sum < l || sum > u)
        return {};
    
    for(int i = 0; i < ct; i++)
        resp.push_back(o[i]);
    return resp;
}

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