# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849753 | chilengaming | Detecting Molecules (IOI16_molecules) | C++17 | 45 ms | 6292 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<bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> ans;
vector<pair<int, int>> ww;
for(int i=0;i<w.size();i++)
{
ww.push_back({w[i],i});
}
sort(ww.begin(), ww.end());
int j=0;
long long sum=0;
for (int i=0;i<ww.size();i++)
{
sum+=ww[i].first;
while (sum>u) sum-=ww[j++].first;
if (sum>=l)
{
for (int k=j;k<=i;k++)
ans.push_back(ww[k].second);
break;
}
}
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... |