結果

問題 No.844 split game
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-06-28 22:23:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 659 ms / 2,000 ms
コード長 5,567 bytes
コンパイル時間 2,766 ms
コンパイル使用メモリ 82,948 KB
実行使用メモリ 63,708 KB
最終ジャッジ日時 2023-09-14 22:11:44
合計ジャッジ時間 22,690 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 373 ms
59,700 KB
testcase_01 AC 371 ms
58,980 KB
testcase_02 AC 563 ms
62,068 KB
testcase_03 AC 506 ms
61,400 KB
testcase_04 AC 343 ms
59,128 KB
testcase_05 AC 613 ms
63,708 KB
testcase_06 AC 333 ms
59,016 KB
testcase_07 AC 340 ms
59,172 KB
testcase_08 AC 263 ms
59,376 KB
testcase_09 AC 485 ms
61,800 KB
testcase_10 AC 624 ms
61,840 KB
testcase_11 AC 604 ms
61,476 KB
testcase_12 AC 485 ms
61,368 KB
testcase_13 AC 362 ms
59,360 KB
testcase_14 AC 382 ms
59,304 KB
testcase_15 AC 658 ms
62,516 KB
testcase_16 AC 649 ms
61,820 KB
testcase_17 AC 659 ms
61,364 KB
testcase_18 AC 642 ms
61,680 KB
testcase_19 AC 655 ms
61,488 KB
testcase_20 AC 632 ms
61,536 KB
testcase_21 AC 640 ms
62,036 KB
testcase_22 AC 631 ms
61,700 KB
testcase_23 AC 149 ms
53,488 KB
testcase_24 AC 201 ms
57,816 KB
testcase_25 AC 181 ms
57,980 KB
testcase_26 AC 145 ms
53,632 KB
testcase_27 AC 188 ms
57,332 KB
testcase_28 AC 110 ms
52,736 KB
testcase_29 AC 194 ms
58,420 KB
testcase_30 AC 197 ms
58,380 KB
testcase_31 AC 192 ms
57,708 KB
testcase_32 AC 119 ms
53,176 KB
testcase_33 AC 205 ms
57,948 KB
testcase_34 AC 180 ms
57,596 KB
testcase_35 AC 219 ms
58,292 KB
testcase_36 AC 188 ms
56,188 KB
testcase_37 AC 235 ms
58,364 KB
testcase_38 AC 327 ms
58,948 KB
testcase_39 AC 486 ms
61,604 KB
testcase_40 AC 320 ms
59,128 KB
testcase_41 AC 75 ms
51,004 KB
testcase_42 AC 75 ms
50,900 KB
testcase_43 AC 75 ms
51,144 KB
testcase_44 AC 77 ms
50,896 KB
testcase_45 AC 76 ms
51,112 KB
testcase_46 AC 76 ms
50,940 KB
testcase_47 AC 75 ms
50,892 KB
testcase_48 AC 76 ms
51,272 KB
testcase_49 AC 76 ms
51,512 KB
testcase_50 AC 82 ms
50,984 KB
testcase_51 AC 77 ms
51,620 KB
testcase_52 AC 76 ms
51,148 KB
testcase_53 AC 75 ms
51,120 KB
testcase_54 AC 76 ms
51,424 KB
testcase_55 AC 79 ms
51,512 KB
testcase_56 AC 76 ms
50,868 KB
testcase_57 AC 77 ms
50,964 KB
testcase_58 AC 77 ms
51,240 KB
testcase_59 AC 81 ms
51,232 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

class SegmentTreeRMQL {
  public int M, H, N;
  public long[] st;
  
  public SegmentTreeRMQL(int n)
  {
      N = n;
      M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
      H = M>>>1;
      st = new long[M];
      Arrays.fill(st, 0, M, Long.MAX_VALUE);
  }
  
  public SegmentTreeRMQL(long[] a)
  {
      N = a.length;
      M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
      H = M>>>1;
      st = new long[M];
      for(int i = 0;i < N;i++){
          st[H+i] = a[i];
      }
      Arrays.fill(st, H+N, M, Long.MAX_VALUE);
      for(int i = H-1;i >= 1;i--)propagate(i);
  }
  
  public void update(int pos, long x)
  {
      st[H+pos] = x;
      for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
  }
  
  private void propagate(int i)
  {
      st[i] = Math.min(st[2*i], st[2*i+1]);
  }
  
  public long minx(int l, int r){
      long min = Long.MAX_VALUE;
      if(l >= r)return min;
      while(l != 0){
          int f = l&-l;
          if(l+f > r)break;
          long v = st[(H+l)/f];
          if(v < min)min = v;
          l += f;
      }
      
      while(l < r){
          int f = r&-r;
          long v = st[(H+r)/f-1];
          if(v < min)min = v;
          r -= f;
      }
      return min;
  }
  
  public long min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
  
  private long min(int l, int r, int cl, int cr, int cur)
  {
      if(l <= cl && cr <= r){
          return st[cur];
      }else{
          int mid = cl+cr>>>1;
          long ret = Long.MAX_VALUE;
          if(cl < r && l < mid){
              ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
          }
          if(mid < r && l < cr){
              ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
          }
          return ret;
      }
  }
  
  public int firstle(int l, long v) {
      int cur = H+l;
      while(true){
          if(st[cur] <= v){
              if(cur < H){
                  cur = 2*cur;
              }else{
                  return cur-H;
              }
          }else{
              cur++;
              if((cur&cur-1) == 0)return -1;
              if((cur&1)==0)cur>>>=1;
          }
      }
  }
  
  public int lastle(int l, long v) {
      int cur = H+l;
      while(true){
          if(st[cur] <= v){
              if(cur < H){
                  cur = 2*cur+1;
              }else{
                  return cur-H;
              }
          }else{
              if((cur&cur-1) == 0)return -1;
              cur--;
              if((cur&1)==1)cur>>>=1;
          }
      }
  }
}



public class Main {



  private static void solve() {
    int n = ni();
    int m = ni();
    int a = ni();
    
    int[][] p = ntable(m, 3);
    Arrays.sort(p, (o1, o2) -> o1[1] - o2[1]);
    
    SegmentTreeRMQL st = new SegmentTreeRMQL(n + 1);
    st.update(0, 0);
    

    int ptr = 0;
    for (int i = 1; i <= n; i ++) {
      long v = -st.min(0, i) - (i == n ? 0 : a);

      while (ptr < m && p[ptr][1] == i) {
        int l = p[ptr][0] - 1;
        int r = p[ptr][1];
        long lv = -st.min(l, l + 1);

        v = Math.max(v, lv + p[ptr][2] - (r == n ? 0 : a));
        ptr ++;
      }
      st.update(i, -v);
    }
    System.out.println(-st.min(n, n + 1));
  }

  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0