Submission #305690

#TimeUsernameProblemLanguageResultExecution timeMemory
305690amunduzbaevDetecting Molecules (IOI16_molecules)C++14
100 / 100
81 ms8300 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define ll long long vector<int> find_subset(int l, int u, vector<int> a) { vector<pair<ll,int > >ans; vector<int>ans1; int n=a.size(); ll sum=0; for(int i=0;i<n;i++){ sum+=a[i]; ans.push_back({(ll)a[i],i}); } if(sum<(ll)l) return ans1; sort(ans.begin(),ans.end()); int s=0; sum=0; for(int i=0;i<n;i++){ ll f=ans[i].first; sum+=f; while(sum>(ll)u){ sum-=ans[s].first; s++; } if(sum>=(ll)l&&sum<=(ll)u){ for(int j=s;j<=i;j++){ ans1.push_back(ans[j].second); } return ans1; } } return ans1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...