| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 159285 | rama_pang | Detecting Molecules (IOI16_molecules) | C++14 | 68 ms | 4856 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
    auto cmp = [&](int a, int b) {
        return w[a] < w[b];
    };
    vector<int> ord(w.size());
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), cmp);
    lint target = w[ord[0]];
    vector<int> res;
    int le = 0, ri = 0;
    while (le < w.size() && ri < w.size()) {
        if (l <= target && target <= u) {
            for (int i = le; i <= ri; i++) res.push_back(ord[i]);
            break;
        } else if (target < l) {
            target += w[ord[++ri]];
        } else if (target > u) {
            target -= w[ord[le++]];
        }
    }
    return res;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
