Submission #912229

#TimeUsernameProblemLanguageResultExecution timeMemory
912229vjudge1Potatoes and fertilizers (LMIO19_bulves)C++17
24 / 100
66 ms11620 KiB
// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> #define f first #define s second #define pb push_back #define sz(x) (int)x.size() #define bit(a, i) ((a>>i)&1) using namespace std; typedef long long ll; typedef pair<int, int> pii; const int P = 18; const int K = 800; const ll INF = 2e18; const int inf = 1e9; const int mod = 1e9+7; const int maxm = 5e2+10; const int maxn = 5e5+10; const int dx[] = {0, 0, -1, 1}; const int dy[] = {1, -1, 0, 0}; int n, x; int a[maxn]; int b[maxn]; ll d[4*maxn]; int t[4*maxn]; int u[4*maxn]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; ll sum = 0, ans = 0; for(int i=1; i<=n; i++){ cin >> a[i] >> b[i]; sum += a[i]; sum -= b[i]; ans += abs(sum); } cout << 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...
#Verdict Execution timeMemoryGrader output
Fetching results...