# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101275 | 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;
lld S[200001];
int r1, r2;
for (int i = 0; i < w.size(); i++)
p.push_back(pii(w[i], i));
sort(p.begin(), p.end());
S[0] = p[0].first;
for (int i = 1; i < p.size(); i++)
S[i] = S[i-1] + p[i].first;
for (int i = 1; i < p.size(); i++) {
int t = S[i] - u;
int j = lower_bound(S, S+p.size(), t);
j--;
if (S[i] - S[j] >= l) {
r1 = j;
r2 = i;
break;
}
}
for (int i = r1; i <= r2; i++)
rst.push_back(p[i].second);
return rst;
}