# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1018679 |
2024-07-10T08:23:56 Z |
VarTech |
Bank (IZhO14_bank) |
C++17 |
|
0 ms |
604 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k; cin>>n>>k;
int a[n];
for (int i = 0; i < n; i++)
cin>>a[i];
pair<int, int> dp[1<<n];
dp[0] = {0, k+1};
for (int s = 1; s < (1<<n); s++) {
dp[s] = {25, 0};
for (int i = 0; i < n; i++) {
if (s>>i&1){
auto [c, w] = dp[s^(1<<i)];
if (w + a[i] > k) {
c++;
w = min(a[i], w);
}
else
w += a[i];
dp[s] = min(dp[s], {c, w});
}
}
// cerr<<s<<' '<<dp[s].first<<' '<<dp[s].second<<endl;
}
cout<<dp[(1<<n)-1].first;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |