# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894490 | 2023-12-28T11:10:24 Z | Batorgil952 | Bank (IZhO14_bank) | C++14 | 1000 ms | 416 KB |
#include<bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair using namespace std; const int N=21; int a[N], b[N]; int dp[N]; int n, m; map< int, int > M; int Rec(int k){ if(k==m+1){ M.clear(); int s=0; for(int i=1; i<=m; i++){ M[dp[i]]++; } int ind=0; for(int i=1; i<=n; i++){ if(M[a[i]]>0){ M[a[i]]--; } else ind++; } if(ind==0) return 1; return 0; } int ans=0; for(int i=k+1; i<=m; i++){ int c=dp[k]; dp[i]+=c; dp[k]=0; if(ans==0) ans=max(ans, Rec(k+1)); dp[i]-=c; dp[k]=c; } if(ans==0) ans=max(ans, Rec(k+1)); return ans; } int main(){ scanf("%d",&n); scanf("%d",&m); for(int i=1; i<=n; i++){ scanf("%d",&a[i]); } for(int i=1; i<=m; i++){ scanf("%d",&b[i]); dp[i]=b[i]; } if(Rec(1)) printf("YES\n"); else printf("NO\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Execution timed out | 1057 ms | 348 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 412 KB | Output is correct |
2 | Correct | 5 ms | 348 KB | Output is correct |
3 | Correct | 61 ms | 416 KB | Output is correct |
4 | Correct | 971 ms | 412 KB | Output is correct |
5 | Execution timed out | 1045 ms | 348 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1073 ms | 348 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Execution timed out | 1057 ms | 348 KB | Time limit exceeded |
6 | Halted | 0 ms | 0 KB | - |