Submission #1000387

#TimeUsernameProblemLanguageResultExecution timeMemory
1000387overwatch9Detecting Molecules (IOI16_molecules)C++17
100 / 100
66 ms6412 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; using ll = long long; vector<int> find_subset(int l, int u, std::vector<int> W) { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n = W.size(); vector <pair <ll, int>> w(n); for (int i = 0; i < n; i++) w[i] = {W[i], i}; sort(w.begin(), w.end()); ll sum = 0; int lp = 0, rp = 0; vector <int> ans; while (rp <= n) { if (sum < l) { if (rp < n) sum += w[rp++].first; else return ans; } else if (sum > u) sum -= w[lp++].first; if (sum >= l && sum <= u) { sum = 0; for (int i = lp; i < rp; i++) { ans.push_back(w[i].second); } return ans; } } 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...