# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701052 | mychecksedad | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 292 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;
#define pb push_back
#define all(x) x.begin(), x.end()
vector<int> find_subset(int l, int r, vector<int> w) {
vector<pair<int, int>> a;
for(int i = 0; i < w.size(); ++i) a.pb({w[i], i});
sort(all(a));
if(r < a[0].first){
return vector<int>(0);
}
int s = 0;
deque<int> ans;
for(int i = 0; i < a.size(); ++i){
if(s + a[i].first > r){
ans.pop_front();
ans.pb(a.back().second);
s -= a[0].first;
s += a.back().first;
if(s > r){
return vector<int>(0);
}
break;
}
s += a[i].first;
ans.pb(a[i].second);
if(s >= l && s <= r) break;
}
if(s < l){
return vector<int>(0);
}
vector<int> anss;
for(int v: ans) anss.pb(v);
sort(all(anss));
return anss;
}
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... |