Submission #556268

#TimeUsernameProblemLanguageResultExecution timeMemory
556268Talha_TakiDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms296 KiB
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector <int> ret;

    int n = w.size();

    vector <pii> W(n);
    for(int i = 0; i < n; ++i) {
        W[i] = {w[i], i};
    }

    ll sum = 0;
    int cnt = 0;
    while (sum < l) {
        sum += W[cnt++].first;
    }

    if (l <= sum && sum <= u) {
        for(int i = 0; i < cnt; ++i) {
            ret.push_back(i);
        }
    }


    return ret;
}
#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...