Submission #507275

#TimeUsernameProblemLanguageResultExecution timeMemory
507275CyberSleeperPotatoes and fertilizers (LMIO19_bulves)C++14
34 / 100
91 ms14792 KiB
#include <bits/stdc++.h> #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define debug(x) cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl #define fi first #define se second #define mp make_pair #define pb push_back #define ll long long #define ull unsigned long long #define pii pair<int, int> #define pll pair<ll, ll> #define ld long double #define nl '\n' #define tb '\t' #define sp ' ' using namespace std; const int MX=500005, MOD=998244353, BLOCK=327, INF=1e9+7; const ll INFF=1e18+7; const ld ERR=1e-7, pi=3.14159265358979323846; ll N, ans=INFF, A, B, tot, pref[MX], suff, DP[MX]; int main(){ fastio; cin >> N; for(int i=1; i<=N; i++){ cin >> A >> B; pref[i]=pref[i-1]+A-B; DP[i]=DP[i-1]+abs(pref[i]); } if(!pref[N]){ cout << DP[N]; exit(0); } for(int i=N; i>0; i--){ suff+=abs(pref[i]-1); ans=min(ans, DP[i-1]+suff); } cout << ans << nl; }
#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...