Submission #595574

#TimeUsernameProblemLanguageResultExecution timeMemory
595574AdamGSPotatoes and fertilizers (LMIO19_bulves)C++17
24 / 100
83 ms14840 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() const int LIM=5e5+7; ll A[LIM], B[LIM]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; rep(i, n) cin >> A[i] >> B[i]; ll ans=0, l=0; rep(i, n) { while(B[i]) { while(!A[l]) ++l; ll x=min(A[l], B[i]); ans+=x*abs(l-i); A[l]-=x; B[i]-=x; } } cout << ans << '\n'; }
#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...