# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101280 | chunghan | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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>
#include"molecules.h"
using namespace std;
typedef long long int lld;
typedef pair<int, int> pii;
vector<int> solve(int l, int u, vector<int> w) {
vector<pii> p;
vector<int> rst;
vector<lld> S;
int r_1, r_2;
for (int i = 0; i < (int)w.size(); i++)
p.push_back(pii(w[i], i));
sort(p.begin(), p.end());
S.push_back(p[0].first);
for (int i = 1; i < (int)p.size(); i++)
S.push_back(S[i-1] + p[i].first);
for (int i = 1; i < (int)p.size(); i++) {
lld t = S[i] - u;
int j = lower_bound(S.begin(), S.end(), t) - S.begin() + 1;
j--;
if (S[i] - S[j] >= l) {
r_1 = j;
r_2 = i;
break;
}
}
for (int i = r_1; i <= r_2; i++)
rst.push_back(p[i].second);
return rst;
}