# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1226030 | edga1 | Detecting Molecules (IOI16_molecules) | C++20 | 1098 ms | 71548 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace::std;
bitset<10005> dp[500005];
int s[10005];
vector<int> find_subset(int l, int u, vector<int> w){
int n=w.size();
int ma=0;
for(int i=0; i<n; i++){
if(w[i]>=l && w[i]<=u) return vector<int> (1,i);
if(w[i]<l) ma=1;
}
if(ma==0) return vector<int> (0);
for(int i=0; i<l; i++){
//dp[i]=vector<int>(0);
}
set<int> sums,ne;
sums.insert(0);
for(int i=0; i<n; i++){
for(auto a:ne) sums.insert(a);
ne.clear();
for(auto a:sums){
int sum=a+w[i];
if(sum>=l && sum<=u){
auto b=dp[a];
b.set(i);
vector<int> r;
for(int i=0; i<n; i++){
if(b[i]) r.push_back(i);
}
return r;
}
if(sum<l && !s[sum]){
s[sum]=1;
auto b=dp[a];
b.set(i);
dp[sum]=b;
ne.insert(sum);
}
}
}
return vector<int>(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... |