# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1264428 | vtnoo | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 3656 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN=10001;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
int n=w.size();
vector<pair<int,int>> v(n);
for(int i=0;i<n;i++)v[i]={w[i], i};
sort(v.begin(), v.end());
long long sum=0;
int lo=0;
for(int r=0;r<n;r++){
sum+=v[r].first;
while(sum>u){
sum-=v[lo++].first;
}
/* cout<<"=============="<<endl;
cout<<lo<<" "<<r<<endl;
cout<<sum<<endl; */
if(l<=sum&&sum<=u){
vector<int> a;
for(int i=lo;i<=r;i++){
a.push_back(v[i].second);
}
return a;
}
}
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... |