# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418254 | saleh | Detecting Molecules (IOI16_molecules) | C++17 | 58 ms | 8212 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
#define ft first
#define sd second
using namespace std;
vector<int32_t> find_subset(int32_t l, int32_t u, vector<int32_t> W) {
vector<pair<int, int>> w;
for (int i = 0; i < W.size(); i++) w.push_back({W[i], i});
sort(w.begin(), w.end());
int n = w.size(), sum = 0;
int p = 0, q = n;
if (accumulate(W.begin(), W.end(), 0ll) < l) return {};
while (p < n && sum + w[p].ft <= u) sum += w[p++].ft;
if (sum >= l) {
vector<int32_t> v;
for (int i = 1; i <= p; i++) v.push_back(w[i - 1].sd);
return v;
}
while (p > 0 && sum < l) {
sum += w[--q].ft;
sum -= w[--p].ft;
}
if (sum < l) return {};
else {
vector<int32_t> v;
for (int i = 1; i <= p; i++) v.push_back(w[i - 1].sd);
for (int i = n; i > q; i--) v.push_back(w[i - 1].sd);
return v;
}
}
//int32_t main() {}
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... |