Submission #829317

#TimeUsernameProblemLanguageResultExecution timeMemory
829317QwertyPiUplifting Excursion (BOI22_vault)C++14
30 / 100
5052 ms228172 KiB
#include <bits/stdc++.h> #pragma GCC optimize("unroll-loops") #pragma GCC optimize("Ofast") #define int long long using namespace std; const int M = 300 + 11; const int X = M * M; const int INF = 1LL << 60; int a[M * 2]; int s[M * 2]; int dp[M * 2][X]; int32_t main(){ int m, L; cin >> m >> L; for(int i = 0; i <= m * 2; i++) cin >> a[i]; int ans = a[m]; for(int i = m + 1; i <= m * 2; i++) s[i] = min(L, s[i - 1] + (i - m) * a[i]); for(int i = m; i <= m * 2; i++) fill(dp[i], dp[i] + X, -INF); dp[m][0] = 0; for(int i = m + 1; i <= m * 2; i++){ for(int j = 0; j < m * m; j++){ for(int k = ((s[i] - s[i - 1] + j) % (i - m) + (i - m)) % (i - m); k < m * m; k += (i - m)){ int vj = s[i - 1] - j, vk = s[i] - k; if(vj > vk) break; if((vk - vj) / (i - m) > a[i]) continue; dp[i][k] = max(dp[i][k], dp[i - 1][j] + (vk - vj) / (i - m)); } } } if(s[m * 2] < L || L < 0){ cout << "impossible" << endl; return 0; } if(dp[m * 2][0] < 0){ cout << "impossible" << endl; }else{ cout << ans + dp[m * 2][0] << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...