# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023642 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 348 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 ll long long
#define nl "\n"
#define pi pair<int, int>
#define mp make_pair
#define ff first
#define ss second
vector<int> find_subset(int l, int u, vector<int> w){
ll n = w.size();
vector<pi> num(n+5, mp(0, 0));
for (ll i=0; i<w.size(); i++) num[i] = mp(w[i], i);
sort(num.begin(), num.end());
ll sum = 0, start = 0;
while(start<n && sum<l){
sum += num[start].ff;
start++;
}
if (sum<l) return {};
ll front=-1, back=-1;
if(sum>=l && sum<=u){
front = 0;
back = start-1;
}
else{
ll size = start-1; // 0 to start-2
sum -= num[start-1].ff;
for (ll i=start-1; i<n; i++){
sum -= num[i-size].ff;
sum += num[i].ff;
if(sum>=l && sum<=u){
front = i-size+1;
back = i;
break;
}
}
}
vector<int> v;
if(front==-1 && back==-1) return v;
for (ll i=front; i<=back; i++){
v.push_back(num[i].ss);
}
return v;
}
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... |