Submission #79972

#TimeUsernameProblemLanguageResultExecution timeMemory
79972muradeynDetecting Molecules (IOI16_molecules)C++14
69 / 100
57 ms4384 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> >a; for (int i = 0;i<n;i++)a.push_back({w[i],i}); sort(a.begin(),a.end()); if (a[0].first > u)return {}; int curr = 0 , sum = 0; for (int i = 0;i<n;i++) { //cout<<i<<" "<<sum<<endl; if (sum + a[i].first <= u) { sum += a[i].first; if (sum >= l) { vector<int>ans; for (int j = curr;j<=i;j++)ans.push_back(a[j].second); return ans; } continue; } sum += a[i].first; sum -= a[curr++].first; if (sum >= l) { vector<int>ans; for (int j = curr;j<=i;j++)ans.push_back(a[j].second); return ans; } } return {}; }
#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...