# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239558 | nicolaalexandra | Detecting Molecules (IOI16_molecules) | C++14 | 103 ms | 13688 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"
#define DIM 200010
using namespace std;
multiset <pair<int,int> > s;
vector <int> sol;
pair <int,int> v[DIM];
int i,k;
vector <int> find_subset (int l, int r, vector <int> w){
for (i=0;i<w.size();i++)
v[++k] = make_pair(w[i],i);
sort (v+1,v+k+1);
long long sum = 0;
for (i=1;i<=k;i++){
if (sum + v[i].first < l){
sum += v[i].first;
s.insert(make_pair(v[i].first,v[i].second));
continue;
}
if (sum + v[i].first >= l && sum + v[i].first <= r){
sum += v[i].first;
s.insert(make_pair(v[i].first,v[i].second));
break;
}
/// sum + v[i].first > r
s.insert(make_pair(v[i].first,v[i].second));
sum += v[i].first;
int val = sum - r;
multiset <pair<int,int> > :: iterator it = s.lower_bound(make_pair(val,0));
sum -= it->first;
s.erase(it);
if (sum >= l && sum <= r)
break;
}
if (sum >= l && sum <= r){
for (auto it : s)
sol.push_back(it.second);
sort (sol.begin(),sol.end());
}
return sol;
}
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... |