# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982600 | MarwenElarbi | 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>
//#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){
int n=w.size();
sort(w.begin(),w.end());
vector<int> res;
long long sum=0;
vector<int> nabba;
for (int i = 0; i < n; ++i)
{
sum+=w[i];
res.pb(i);
if(sum>l){
if(sum<=u) return res;
sum-=w[i];
res.pop_back();
break;
}
}
reverse(res.begin(),res.end());
vector<int> ans;
bool test=false;
for (int i = n-1; i >= 0; --i)
{
if(res.empty()) break;
ans.pb(i);
sum+=w[i];
sum-=w[res.back()];
res.pop_back();
if(sum>=l){
test=true;
break;
}
}
if(!test) return nabba;
for (int i = 0; i < res.size(); ++i)
{
ans.pb(res[i]);
}
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... |