# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134499 | reda | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 376 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 pb push_back
#define ll long long
#define ld long double
#define mp make_pair
#define MOD 1000000007
#define endl '\n'
#pragma GCC optimize ("O3")
#define fi first
#define se second
vector<int> ans;
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.pb(mp(w[i],i));
sort(v.begin(),v.end());
if(v[w.size()-1].fi<l || v[0].fi>u)return ans;
ll sum =0;
for(int i=0;i<w.size();i++)
{
sum+= v[i].fi;
if(sum>u)break;
if(sum>=l && sum<=u )
ans.pb(v[i].se);
}
return ans;
}
/*int main ()
{
return 0 ;
}
*/
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... |