Submission #590310

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5903102022-07-05 19:51:25mpawicka_77Potatoes and fertilizers (LMIO19_bulves)C++14
0 / 100
108 ms262144 KiB
#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);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#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...