Submission #415986

#TimeUsernameProblemLanguageResultExecution timeMemory
415986aris12345678Detecting Molecules (IOI16_molecules)C++14
100 / 100
58 ms6168 KiB
#include <bits/stdc++.h> #include "molecules.h" using namespace std; const int mxN = 200005; vector<int> find_subset(int l, int u, vector<int> w) { vector<pair<int, int> > arr; int n = w.size(); for(int i = 0; i < n; i++) arr.push_back({w[i], i}); sort(arr.begin(), arr.end()); vector<int> ans; int i = 0, j = 0; long long sum = 0; while(j < n) { while(j < n && sum+arr[j].first <= u) sum += arr[j++].first; if(l <= sum) { for(int k = i; k < j; k++) ans.push_back(arr[k].second); break; } sum -= arr[i++].first; } 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...