# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64423 | mhnd | Detecting Molecules (IOI16_molecules) | C++14 | 106 ms | 22356 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 3e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int,int>> v;
for(int i=0;i<w.size();i++)v.push_back({w[i],i});
sort(v.begin(),v.end());
ll sum=0;
int p = 0;
vector<int> ans;
for(int i=0;i<v.size();i++){
sum+=v[i].first;
while(p < v.size() && sum > u)sum -= v[p++].first;
if(sum >= l && sum <= u){
for(int x=p;x<=i;x++)ans.push_back(v[x].second);
break;
}
}
return ans;
}
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... |