# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590310 | mpawicka_77 | Potatoes and fertilizers (LMIO19_bulves) | C++14 | 108 ms | 262144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
stack<pair<int,int>>S[500003];
stack<int>nad,nad2;
int T[500003];
int main()
{
int n;
cin>>n;
for(int i=1; i<=n; i++)
{
int a,b;
cin>>a>>b;
T[i]=a-b;
}
for(int i=1; i<=n; i++)
{
if(T[i]>0) nad.push(i);
while (T[i]<0 && !nad.empty())
{
int k=nad.top(),w=min(-T[i],T[k]);
T[k]-=w, T[i]+=w;
if(T[k]==0) nad.pop();
S[i].push({k,w});
}
}
long long ans=0;
for(int i=n; i>=1; i--)
{
if(T[i]>0) nad2.push(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |