# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144131 | crispxx | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 3656 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
// #include "grader.cpp"
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define nl '\n'
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector <array<int, 2>> w_i(n);
for(int i = 0; i < n; i++) {
w_i[i] = {w[i], i};
}
sort(all(w_i));
int _l = 0;
long long sum = 0;
for(int r = 0; r < n; r++) {
sum += w_i[r][0];
while(sum > u && _l <= r) {
sum -= w_i[_l][0];
_l++;
}
if(l <= sum && sum <= u) {
vector<int> ans;
for(int i = _l; i <= r; i++) {
ans.pb(w_i[i][1]);
}
return ans;
}
}
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... |