Submission #297824

#TimeUsernameProblemLanguageResultExecution timeMemory
297824khangalDetecting Molecules (IOI16_molecules)C++14
100 / 100
65 ms4088 KiB
#include "molecules.h" #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>> vp; vp.resize(n); vector<int> ans; for(int i=0;i<n;i++){ vp[i]={w[i],i}; } sort(vp.begin(),vp.end()); long long sum = 0,j = 0; for(int i=0;i<n;i++){ while(j < n && sum < l){ sum += vp[j].first; j++; } if(sum >= l && sum <= u){ for(int o=i;o<j;o++){ ans.push_back(vp[o].second); } return ans; } sum -= vp[i].first; } return vector<int>(); }
#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...