# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964516 | UmairAhmadMirza | Detecting Molecules (IOI16_molecules) | C++14 | 46 ms | 6188 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.
#pragma once
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
int n=w.size();
vector<pair<int,int>> mol;
for (int i = 0; i < n; ++i)
mol.push_back({w[i],i});
sort(mol.begin(), mol.end());
int p1=0,p2=-1;
long long sm=0;
while(p1<n && p2<n){
if(sm<l){
p2++;
sm+=mol[p2].first;
}
else if(sm>u){
sm-=mol[p1].first;
p1++;
}
else
break;
}
vector<int> ans;
if(p2>=n || p1>=n)
return ans;
for (int i = p1; i <=p2; ++i)
ans.push_back(mol[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... |