# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426290 | Play_Erwan | Detecting Molecules (IOI16_molecules) | C++11 | 1086 ms | 1144 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define F first
#define S second
int x,f,con;
vector<int> v;
map<int,int> dp;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
dp[0]=-1;
for(int k=1;k<=w.size();k++){
x=w[k-1];
if(x>u)continue;
for(auto y:dp)if(y.S!=k && y.F+x<=u){
if(dp[y.F+x]==0){dp[y.F+x]=k; if(y.F+x>=l){con=1; break;}}
}
if(con)break;
}
for(int i=l;i<=u;i++)if(dp[i]!=0){f=i; break;}
while(f>0){
v.pb(dp[f]-1);
f-=w[dp[f]-1];
}
return v;
}
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... |