Submission #783917

#	Time	Username	Problem	Language	Result	Execution time	Memory
783917		Alfraganus	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	39 ms	5564 KiB

molecules

#include "molecules.h"
// #include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size(), j = 0, i = 0;
    long long s = 0;
    vector<pair<int, int>> a(n);
    for(int i = 0; i < n; i ++)a[i] = {w[i], i};
    sort(all(a));
    while(i < n){
        s += a[i].first;
        i ++;
        while(s > u)s -= a[j ++].first;
        if(l <= s and s <= u){
            vector<int> ans;
            for(int x = j; x < i; x ++){
                ans.push_back(a[x].second);
            }
            return ans;
        }
    }
    return {};
}

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