# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156518 | a_player | Detecting Molecules (IOI16_molecules) | C++14 | 21 ms | 16252 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>
#define f first
#define s second
#define mp make_pair
#define pb push_back
using namespace std;
//typedef long long ll;
pair<int,int> dp[1001][1001];
int v[1001];
int N,uu,ll;
bool ric(int n,int val){
if(val>=uu&&val<=ll)return 1;
if(n==N)return 0;
if(val>ll)return 0;
if(dp[n][val].f!=-1)return dp[n][val].f;
if(ric(n+1,val)){
dp[n][val].f=1;
dp[n][val].s=0;
return 1;
}
else if(ric(n+1,val+v[n])){
dp[n][val].f=1;
dp[n][val].s=1;
return 1;
}
else {
dp[n][val].f=0;
dp[n][val].s=-1;
return 0;
}
return 0;
}
vector<int> find_subset(int l,int u,vector<int> w){
uu=l;
ll=u;
N=w.size();
for(int i=0;i<1001;i++)
for(int j=0;j<1001;j++)dp[i][j]=mp(-1,-1);
for(int i=0;i<w.size();i++)v[i]=w[i];
ric(0,0);
vector<int> sol;
if(dp[0][0].f==0)return sol;
int val=0;
int n=0;
while(val<u){
if(dp[n][val].s==1){
sol.push_back(n);
val+=v[n];
n++;
}else n++;
}
return sol;
}
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... |