# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161525 | kostia244 | Detecting Molecules (IOI16_molecules) | C++14 | 9 ms | 376 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 all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<int>;
vi find_subset(int l, int u, std::vector<int> w) {
vector<pair<int, int>> v;
vector<ll> sum;
for(int i = 0; i < w.size(); i++) v.pb({w[i], i});
sort(all(v));
sum.resize(w.size());
sum[0]=v[0].first;
for(int i = 1; i < w.size(); i++)
sum[i]=sum[i-1]+v[i].first;
vi ans;
ll cur = 0;
for(int i = w.size(); i--;) {
if((i?sum[i-1]:0)+cur<l)
cur+=v[i].first, ans.pb(v[i].second);
}
if(cur<l||cur>u) return {};
return ans;
}
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... |