Submission #775534

#TimeUsernameProblemLanguageResultExecution timeMemory
775534agussDetecting Molecules (IOI16_molecules)C++17
100 / 100
37 ms5556 KiB
#include "molecules.h"
#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>> v(n);
    vector<int> ans;
    for(int i = 0; i < n; i++){
        v[i].first = w[i];
        v[i].second = i;
    }
    sort(v.begin(), v.end());
    ll sum = v[0].first, s = 0, e = 0;
    while(e < n and s < n){
        if(sum >= l and sum <= u){
            for(int i = s; i <= e; i++)
                ans.push_back(v[i].second);
            return ans;
        }
        if(sum < l)
            sum += v[++e].first;
        if(sum > u) 
            sum -= v[s++].first;
        
    }
    return vector<int>(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...