Submission #853864

#TimeUsernameProblemLanguageResultExecution timeMemory
853864thinknoexitDetecting Molecules (IOI16_molecules)C++17
100 / 100
38 ms6296 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pair<int, int>> v; for (int i = 0;i < n;i++) { v.push_back({ w[i], i }); } sort(v.begin(), v.end()); ll sum = 0; int pl = 0, pr = 0; while (pr < n && sum < l) { sum += v[pr++].first; while (sum > u) { sum -= v[pl++].first; } if (l <= sum && sum <= u) { break; } } while (pl < n && sum > u) { sum -= v[pl++].first; } vector<int> ans; if (l <= sum && sum <= u) { for (int i = pl;i < pr;i++) { ans.push_back(v[i].second); } } return ans; } // int main() { // int l, u, n; // cin >> n >> l >> u; // vector<int> w(n); // for (auto& x : w) cin >> x; // vector<int> ans = find_subset(l, u, w); // for (auto& x : ans) { // cout << x << ' '; // } // }
#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...