# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151232 | vyaduct | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
vt<int> find_subset(int l, int u, vt<int> w) {
sort(all(w));
int n = sz(w);
vt<int> pref(n+1, 0);
for (int i=0;i<n;i++) pref[i+1] = pref[i] + w[i];
vt<int> curr;
for (int i=0;i<n;i++){
for (int j=i;j<n;j++){
int sum = pref[j+1]-pref[i];
if (sum >= l && sum <= u){
for (int iter=i;iter<=j;iter++){
curr.push_back(iter);
}
return curr;
}
}
}
return vt<int>(0);
}
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... |