Submission #759935

#TimeUsernameProblemLanguageResultExecution timeMemory
759935thinknoexitDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms340 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w)
{
    int n = w.size();
    pair<int, int> a[n];
    ll sum = 0;
    for (int i = 0;i < n;i++) {
        sum += w[i];
        a[i] = { w[i],i };
    }
    sort(a, a + n, greater<pair<int, int>>());
    vector<int> ans, emp;
    int idx = 0;
    for (int i = 0;i < n;i++) {
        if (sum - a[i].first >= l) {
            sum -= a[i].first;
        }
        else {
            ans[idx++] = a[i].second;
        }
    }
    if (sum > u) return emp;
    return ans;
}
#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...