Submission #952362

#TimeUsernameProblemLanguageResultExecution timeMemory
952362wiiDetecting Molecules (IOI16_molecules)C++17
69 / 100
34 ms5588 KiB
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int lf, int rf, vector<int> w) { int n = w.size(); vector<pair<int, int>> a; for (int i = 0; i < n; ++i) a.emplace_back(w[i], i); sort(a.begin(), a.end()); vector<int> ans; int sum = 0; for (int l = 0, r = 0; l < n; ++l) { while (sum < lf && r < n) { sum += a[r].first; ++r; } if (lf <= sum && sum <= rf) { for (int i = l; i < r; ++i) ans.push_back(a[i].second); break; } sum -= a[l].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...