# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524246 | reni | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 460 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) {
sort(w.begin(), w.end());
vector<int>r;
long long sum=0, i, j;
for(i=0;i<w.size();i++)
{
sum+=w[i];
r.push_back(i+1);
if(sum>=l)
{
if(sum<=u){return r;}
sum-=w[i]; r.pop_back(); break;
}
}
i--;j=i;
for(;i<w.size();)
{
while(sum<l){
sum+=w[i];
r.push_back(i+1);
i++;
}
if(sum>=l && sum<=u)
{
return r;
}
sum-=w[j];
r.erase(r.begin(), r.begin()+1);
j++;
}
}
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... |