# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800387 | ttamx | Bank (IZhO14_bank) | C++14 | 102 ms | 8532 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>
using namespace std;
typedef pair<int,int> p2;
const int N=25;
const int K=(1<<20)+5;
int n,m;
int a[N],b[N];
p2 dp[K];
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> m;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<m;i++)cin >> b[i];
for(int i=1;i<1<<m;i++)dp[i]={-1,-1};
dp[0]={0,0};
for(int i=1;i<1<<m;i++){
for(int j=0;j<m;j++){
if(!(i>>j&1))continue;
int u=i^(1<<j);
auto [id,val]=dp[u];
if(id==-1)continue;
if(val+b[j]==a[id]){
dp[i]={id+1,0};
}else if(val+b[j]<a[id]){
dp[i]={id,val+b[j]};
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... |