Submission #69316940

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 

  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int n,k,t=0,sm=0;
    cin>>n>>k;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>que;
    for(int i=0;i<n;i++){
      int a,b,c;
      cin>>a>>b>>c;
      chmax(t,a);
      while(!que.empty()&&sm+c>k){
        auto [val,j]=que.top();que.pop();
        sm-=j;
        t=max(t,val);

      }
      
      cout<<t<<endl;
      que.push({t+b,c});
      sm+=c;
    }

  
 
   

  }

Submission Info

Judge Result