結果

問題 No.2808 Concentration
ユーザー 👑 hos.lyric
提出日時 2024-07-19 21:13:27
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 243 ms / 2,000 ms
コード長 2,909 bytes
コンパイル時間 3,287 ms
コンパイル使用メモリ 124,800 KB
実行使用メモリ 24,192 KB
最終ジャッジ日時 2024-07-19 21:13:47
合計ジャッジ時間 15,627 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons
    ;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
enum INF = 10L^^18;
void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const S = readLong;
      const H = readLong;
      auto X = new long[N];
      auto Y = new long[N];
      auto Z = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong;
        Y[i] = readLong;
        Z[i] = readLong;
      }
      
      auto ZSum = new long[N + 1];
      foreach (i; 0 .. N) {
        ZSum[i + 1] = ZSum[i] + Z[i];
      }
      
      auto fs = new long[N];
      auto gs = new long[N];
      fs[] = -INF;
      gs[] = -INF;
      
      alias Entry = Tuple!(long, "val", int, "j");
      DList!Entry queF;
      auto maxGs = new long[N + 1];
      maxGs[0] = -INF;
      
      int jH, jS;
      foreach (i; 0 .. N) {
        // start: need sleep >= H
        for (; X[i] - Y[jH] >= H; ++jH) {}
        if (0 < jH) {
          // chmax(fs[i], gs[0 .. jH].maxElement);
          chmax(fs[i], maxGs[jH]);
        }
        chmax(fs[i], 0);
        fs[i] -= ZSum[i];
        for (; !queF.empty && queF.back.val <= fs[i]; queF.removeBack) {}
        queF.insertBack(Entry(fs[i], i));
        
        // end: wake up <= S
        for (; jS < i + 1 && Y[i] - X[jS] > S; ++jS) {}
        if (jS < i + 1) {
          // chmax(gs[i], fs[jS .. i + 1].maxElement + ZSum[i + 1]);
          for (; !queF.empty && queF.front.j < jS; queF.removeFront) {}
          if (!queF.empty) {
            chmax(gs[i], queF.front.val + ZSum[i + 1]);
          }
        }
        maxGs[i + 1] = max(maxGs[i], gs[i]);
      }
      debug {
        writeln("fs = ", fs);
        writeln("gs = ", gs);
      }
      long ans = gs.maxElement;
      chmax(ans, 0);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0