Submission #1096368

#TimeUsernameProblemLanguageResultExecution timeMemory
1096368VMaksimoski008Sparklers (JOI17_sparklers)C++17
50 / 100
33 ms17500 KiB
#include <bits/stdc++.h> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define int long long using namespace std; using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; int dp[1005][1005]; signed main() { int n, id, t, l=0, r=1e9, ans=1e9; cin >> n >> id >> t; vector<ll> v(n+1); for(int i=1; i<=n; i++) cin >> v[i]; while(l <= r) { int mid = (l + r) / 2; memset(dp, 0, sizeof(dp)); dp[id][id] = 1; for(int len=2; len<=n; len++) for(int i=1, j=len; j<=n; i++,j++) if(v[j] - v[i] <= 2ll * mid * (j - i) * t) dp[i][j] = (dp[i+1][j] || dp[i][j-1]); if(dp[1][n]) ans = mid, r = mid - 1; else l = mid + 1; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...