Submission #997118

#TimeUsernameProblemLanguageResultExecution timeMemory
997118codefoxDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define pii pair<int, int> vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pii> nums; for (int i = 0; i < n; i++) nums.push_back({w[i], i}); sort(nums.begin(), nums.end()); int lefts=n, rights=n; long long sum = 0; while (sum <= u) { lefts--; sum += nums[lefts].first; } while (sum > u) { rights--; sum -= nums[rights].first; lefts--; sum += nums[lefts].first; } if (sum >= l) { vector<int> ans(rights-lefts); for (int i = lefts; i < rights; i++) { ans[i-lefts] = nums[i].second; } return ans; } else { vector<int> ans(0); 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...