# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997741 | Petrix | Bank (IZhO14_bank) | C++17 | 73 ms | 8636 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<iostream>
using namespace std;
#define int long long
int a[20],b[20];
int dp[1048577];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m,max1,sum,i,j;
cin>>n>>m;
for(i=0;i<n;i++) {
cin>>a[i];
if(i) a[i]+=a[i-1];
}
for (i=0;i<m;i++)
cin>>b[i];
for(i=0;i<(1<<m);i++) {
max1=-1;sum=0;
for(j=0;j<m;j++){
if(i&(1<<j)){
sum+=b[j];
max1=max(max1,dp[i^(1<<j)]);
}
}
dp[i]=max1;
if(sum==a[max1+1]) dp[i]++;
if(dp[i]==n-1){
# | 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... |