Submission #819827

#TimeUsernameProblemLanguageResultExecution timeMemory
819827KemalKDetecting Molecules (IOI16_molecules)C++17
69 / 100
1078 ms3456 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector <pair<int, int>> a(n);
    for (int i = 0; i < n; i++){
        a[i] = {w[i], i};
    }
    sort(a.begin(), a.end());
    vector <int> ans;
    for (int i = 0; i < n; i++){
        ll sum = 0;
        for (int j = i; j < n; j++){
            sum += a[j].first;
            if (sum >= l and sum <= u){
                for (int k = i; k <= j; k++){
                    ans.push_back(a[k].second);
                }
                return ans;
            }
        }
    }
    return {};
}
#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...