# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
297938 | dandrozavr | Detecting Molecules (IOI16_molecules) | C++14 | 68 ms | 6252 KiB |
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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define F first
#define S second
#define pii pair < int , int >
#define _ <<" "<<
#define TIME 1.0 * clock() / CLOCKS_PER_SEC
#include "molecules.h"
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector < int > nul;
ll sum = 0;
int now = 0;
int n = w.size();
vector < pii > a;
for (int i = 0; i < w.size(); ++i)
a.pb({w[i], i});
sort(a.begin(), a.end());
for (int i = 0; i < n; ++i){
sum += a[i].F;
while(sum > u) sum -= a[now++].F;
if (sum >= l){
for (; now <= i; ++now)
nul.pb(a[now].S);
return nul;
}
}
return nul;
}
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... |