# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1190065 | exoworldgd | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 4028 KiB |
#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pii> wip;
for (int i = 0; i < n; ++i) wip.emplace_back(w[i], i);
sort(wip.begin(),wip.end());
int left=0,right=0;
long long curr = 0;
while (right < n) {
curr+=wip[right].first;
while (curr > u && left <= right) {
curr -= wip[left].first;
left++;
}
if (curr >= l && curr <= u) {
vector<int> res;
for (int i = left; i <= right; i++) res.push_back(wip[i].second);
return res;
}
right++;
}
return {};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |