# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162523 | brcode | Detecting Molecules (IOI16_molecules) | C++14 | 107 ms | 8296 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 <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
vector<int> arr;
vector<int> find_subset(int l, int u, vector<int> w){
long long li =0 ;
long long ri = 0;
vector<pair<long long,long long>> v1;
for(long long i=0;i<w.size();i++){
v1.push_back(make_pair(w[i],i));
}
sort(v1.begin(),v1.end());
long long currsum = v1[0].first;
while(li<=ri){
if(currsum>=l && currsum<=u){
for(long long i=li;i<=ri;i++){
ans.push_back(v1[i].second);
}
break;
}else if(currsum<l){
ri++;
if(ri == w.size()){
break;
}
currsum+=v1[ri].first;
}else{
currsum-=v1[li].first;
li++;
}
}
return ans;
}
/*int main(){
long long n,l,r;
cin>>n>>l>>r;
for(long long i=0;i<n;i++){
long long x;
cin>>x;
arr.push_back(x);
}
find_subset((int)l,(int)r,arr);
for(long long i=0;i<ans.size();i++){
cout<<ans[i]<<" ";
}
}*/
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... |