Submission #1077655

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077655		speedcode	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	600 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w){
    int n = w.size();
    vector<pair<int, int>> dat(n);
    for(int i = 0; i < n; i++){
        dat[i] = {w[i], i};
    }
    sort(dat.begin(), dat.end());
    ll s1 = dat[0].first;
    ll s2 = dat[n-1].first;
    int k = 1;
    while(k <= n){
        if(s1 > u || s2 < l){
            k++;
            s1 += dat[k-1].first;
            s2 += dat[n-k].first;
        }else{
            vector<int> result(k);
            int ind = 0;
            for(int i = 0; i < k; i++){
                result[i] = dat[i].second;
            }
            while(s1 < u){
                s1 -= dat[ind].first;
                s1 += dat[n-ind-1].first;
                result[ind] = dat[n-ind-1].second;
            }
            return result;
        }
    }

    return {};
}

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