Submission #672013

#TimeUsernameProblemLanguageResultExecution timeMemory
672013Hacv16Rice Hub (IOI11_ricehub)C++17
43 / 100
119 ms1752 KiB
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; typedef long long ll; const int INF = 0x3f3f3f3f; int besthub(int n, int l, int x[], ll b){ int ans = 0; for(int mid = 0; mid < n; mid++){ int cnt = 1, l = mid - 1, r = mid + 1, av = b; while(b && (l >= 0 || r < n)){ int dl = (l >= 0 ? x[mid] - x[l] : INF); int dr = (r < n ? x[r] - x[mid] : INF); if(av - min(dl, dr) < 0) break; av -= min(dl, dr); if(dl < dr) l--; else r++; cnt++; } ans = max(ans, cnt); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...