# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115238 | Zflop | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 336 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.
#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 2;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int,int>>p;
for (int i = 0; i < w.size();++i)
p.push_back({w[i],i});
sort(p.begin(),p.end());
vector<int>v;
int s = 0;
for (int i = w.size() - 1; i >= 0;--i) {
if (s >= l && s <= u) return v;
if (s + p[i].first <= u) {
v.push_back(p[i].second);
s += p[i].first;
}
}
return v;
}
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... |