# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524254 | reni | Detecting Molecules (IOI16_molecules) | C++14 | 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<iostream>
#include<algorithm>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector< pair<int,int> > v;
for(int i=0;i<w.size();i++)
{
v.push_back({w[i],i});
}
sort(v.begin(),v.end());
vector< int > r;
long long sum=0, i, j=0;
for(i=0;i<v.size();i++)
{
sum+=v[i].first;
if(sum>=l && sum<=u)
{
for(int d=j;d<=i;d++)
{
r.push_back(v[d].second);
}
return r;
}
while(j<i && sum>=l)
{
sum-=v[j].first;j++;
}
}
return r;
}
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... |