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;
typedef long long ll;
struct molecule{
int w,idx;
bool operator<(const molecule &t)const{
return w<t.w;
}
};
int N,s,e;
ll Sum;
vector<molecule> V;
vector<int> ans;
vector<int> find_subset(int l,int u,vector<int> w) {
N=w.size();
for (int i=0; i<N; i++)
V.push_back({w[i],i});
sort(V.begin(),V.end());
for (int i=0,j=0; i<N; i++){
while (j<N&&Sum<l)
Sum+=V[j++].w;
if (l<=Sum&&Sum<=u){
for (int t=i; t<j; t++)
ans.push_back(V[t].idx);
return ans;
}
Sum-=V[i].w;
}
return ans;
}
# | 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... |