Submission #1029624

#TimeUsernameProblemLanguageResultExecution timeMemory
1029624nisanduuDetecting Molecules (IOI16_molecules)C++14
100 / 100
44 ms8348 KiB
#include "molecules.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<ll> pref; int n = w.size(); vector<pair<ll,ll>> arr; for(ll i=0;i<n;i++){ arr.push_back({w[i],i}); } sort(arr.begin(),arr.end()); vector<int> ans; ll p1 = 0,p2 = 0; ll cr = 0; while(p2<n&&p1<n){ cr += arr[p1].first; while(cr>u&&p2<p1){ cr -= arr[p2].first; p2++; } if(cr<=u&&cr>=l){ for(ll i=p2;i<=p1;i++){ ans.push_back(arr[i].second); } return ans; } p1++; } return ans; }
#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...