Submission #912325

#TimeUsernameProblemLanguageResultExecution timeMemory
912325vjudge1Potatoes and fertilizers (LMIO19_bulves)C++17
0 / 100
447 ms940 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n], b[n]; map <int, int> mp; map <int, int> mp1; map <int, int> mp2; map <int, int> mp3; int ok = 0; int okk = 0; int cnt = 0; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; if (a[i] > 0 && b[i] > 0) { if (a[i] >= b[i]) { a[i] -= b[i]; b[i] = 0; } else { b[i] -= a[i]; a[i] = 0; } } if (a[i] > 0) { mp2[ok] = a[i]; mp3[ok] = i; okk++; } if (b[i] > 0) { mp[ok] = b[i]; mp1[ok] = i; ok++; } } for (int j = 0; j < ok; j++) { for (int i = 0; i < okk; i++) { if (mp[j] <= mp2[i]) { cnt += mp[j]*abs(mp1[j]-mp3[i]); mp2[i] -= mp[j]; mp[j] = 0; break; } else { cnt += abs(mp2[i]-mp[j])*abs(mp1[j]-mp3[i]); mp[j] -= mp2[i]; mp2[i] = 0; } } } cout << cnt; }
#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...