This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define se second
#define fi first
#define cek puts("HERE")
std::vector<int> find_subset(int L, int U, std::vector<int> w) {
vector<int> ret;
long long sum = 0;
int n = w.size();
for(int i=0; i<n; i++) {
sum += w[i];
ret.push_back(i+1);
if(sum >= L) {
if(sum <= U) return ret;
else break;
}
}
ret.clear();
return ret;
}
# | 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... |