# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1191719 | simona1230 | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 5192 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
long long p[200001];
long long n;
pair<int,int> a[200001];
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
n=w.size();
for(int i=0;i<n;i++)
a[i]={w[i],i};
sort(a,a+n);
p[0]=a[0].first;
for(long long i=1; i<n; i++)
p[i]=p[i-1]+a[i].first;
for(long long x=1; x<=n; x++)
{
long long s1=p[x-1];
long long s2=p[n-1]-p[n-x]+a[n-x].first;
//cout<<x<<" "<<s1<<" "<<s2<<" "<<l<<" "<<u<<endl;
if(s1<l&&s2>u||s1>=l&&s1<=u||s2>=l&&s2<=u)
{
for(long long i=0; i<n; i++)
{
long long j=i+x-1;
long long s=p[j]-p[i]+a[i].first;
//cout<<i<<" - "<<j<<" "<<s<<endl;
if(s>=l&&s<=u)
{
vector<int> ans;
for(long long y=i; y<=j; y++)
ans.push_back(a[y].second);
sort(ans.begin(),ans.end());
return ans;
}
}
}
}
return {};
}
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... |