# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205370 | oko | Detecting Molecules (IOI16_molecules) | C++14 | 1091 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 <cstdio>
#include <vector>
#include <cassert>
#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
long long a,b,sum;
vector<pair<int,int> >v;
vector<int> find_subset(int l, int u, std::vector<int> w)
{
for(int i=0;i<w.size();i++)v.push_back({w[i],i});
sort(v.begin(),v.end());
vector<int>ans;
while(a<v.size())
{
if(sum<l&&b<v.size())
{
sum+=v[b].first;
b++;
}
else if(u<sum)
{
sum-=v[a].first;
a++;
}
if(l<=sum&&sum<=u)
{
for(int i=a;i<b;i++)ans.push_back(v[i].second);
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... |