| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 425888 | vincentpikachu20 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 204 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>
#define int long long
using namespace std;
vector<signed> find_subset(signed _l, signed _u, vector<signed> _w) {
    int l = _l, u = _u;
    vector<int> w(_w.begin(), _w.end());
    sort(w.begin(), w.end());
    u = min(u,accumulate(w.begin(), w.end(), (int)0));
    int n = w.size();
    //
    int k = (l+w[0]-1)/w[0];
    if(k*w[0] > u) return vector<signed>();
    else{
        vector<signed> a(k);
        for(int i = 0; i < k; i ++) a[i] = i;
        return a;
    }
}
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... | ||||
