제출 #595569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
595569		AdamGS	Potatoes and fertilizers (LMIO19_bulves)	C++17	0 / 100	2 ms	468 KiB

bulves

#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, INF=1e9+7;
ll T[LIM];
set<pair<ll,ll>>S;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n;
  cin >> n;
  rep(i, n) {
    ll x;
    cin >> x >> T[i];
    S.insert({i, x});
  }
  S.insert({-INF, -INF});
  S.insert({INF, INF});
  ll ans=0;
  rep(i, n) while(T[i]) {
    auto it=S.lower_bound({i, -1});
    auto a=*it;
    --it;
    auto b=*it;
    if(a.st-i<i-b.st) {
      S.erase(a);
      ans+=(a.st-i)*min(T[i], a.nd);
      if(T[i]>=a.nd) T[i]-=a.nd;
      else {
        a.nd-=T[i];
        T[i]=0;
        S.insert(a);
      }
    } else {
      S.erase(b);
      ans+=(i-b.st)*min(T[i], b.nd);
      if(T[i]>=b.nd) T[i]-=b.nd;
      else {
        b.nd-=T[i];
        T[i]=0;
        S.insert(b);
      }
    }
  }
  cout << ans << '\n';
}

• Subtask 1: 0 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36