# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494845 | Ronin13 | Bank (IZhO14_bank) | C++14 | 196 ms | 12624 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 ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define f first
#define s second
using namespace std;
void solve(){
int n;cin>>n;
int m;cin>>m;
int a[n+1],b[m+1];
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=m;i++)cin>>b[i];
int pr[n+2];pr[0]=0;
for(int i=1;i<=n;i++){
pr[i]=pr[i-1]+a[i];
}
pr[n+1]=pr[n];
int sum[(1<<m)],ind[(1<<m)],dp[(1<<m)];
for(int i=0;i<(1<<m);i++){
sum[i]=ind[i]=0;
dp[i]=0;
for(int j=0;j<m;j++){
if((1<<j)&i)sum[i]+=b[j+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... |