# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982606 | MarwenElarbi | Detecting Molecules (IOI16_molecules) | C++17 | 43 ms | 4676 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;
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
std::vector<int> find_subset(int l, int u, std::vector<int> w){
vector<pair<int,int>> v;
int n=w.size();
for (int i = 0; i < n; ++i)
{
v.pb({w[i],i});
}
sort(v.begin(),v.end());
ll sum=0;
int j=0;
vector<int> ans;
for (int i = 0; i < w.size(); ++i)
{
sum+=v[i].fi;
while(sum>u){
sum-=v[j].fi;
j++;
}
if(sum>=l){
for (int k = j; k <= i; ++k)
{
ans.pb(v[k].se);
}
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... |