結果

問題 No.759 悪くない忘年会にしような！
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-08 07:55:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 897 ms / 2,000 ms
コード長 5,772 bytes
コンパイル時間 4,562 ms
コンパイル使用メモリ 91,328 KB
実行使用メモリ 64,940 KB
最終ジャッジ日時 2023-10-12 04:53:46
合計ジャッジ時間 28,572 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
50,896 KB
testcase_01 AC 79 ms
51,212 KB
testcase_02 AC 78 ms
50,892 KB
testcase_03 AC 77 ms
50,960 KB
testcase_04 AC 78 ms
51,008 KB
testcase_05 AC 76 ms
50,772 KB
testcase_06 AC 78 ms
50,884 KB
testcase_07 AC 78 ms
49,048 KB
testcase_08 AC 77 ms
50,824 KB
testcase_09 AC 76 ms
51,104 KB
testcase_10 AC 74 ms
51,216 KB
testcase_11 AC 78 ms
50,848 KB
testcase_12 AC 75 ms
50,976 KB
testcase_13 AC 78 ms
50,952 KB
testcase_14 AC 76 ms
50,796 KB
testcase_15 AC 78 ms
50,980 KB
testcase_16 AC 76 ms
50,960 KB
testcase_17 AC 78 ms
51,104 KB
testcase_18 AC 80 ms
50,948 KB
testcase_19 AC 80 ms
50,852 KB
testcase_20 AC 79 ms
51,008 KB
testcase_21 AC 79 ms
51,380 KB
testcase_22 AC 78 ms
50,748 KB
testcase_23 AC 77 ms
50,952 KB
testcase_24 AC 77 ms
50,952 KB
testcase_25 AC 79 ms
51,260 KB
testcase_26 AC 79 ms
50,832 KB
testcase_27 AC 78 ms
50,896 KB
testcase_28 AC 80 ms
50,804 KB
testcase_29 AC 79 ms
51,508 KB
testcase_30 AC 78 ms
50,828 KB
testcase_31 AC 78 ms
51,156 KB
testcase_32 AC 78 ms
50,852 KB
testcase_33 AC 225 ms
58,212 KB
testcase_34 AC 132 ms
53,268 KB
testcase_35 AC 194 ms
56,396 KB
testcase_36 AC 229 ms
58,444 KB
testcase_37 AC 131 ms
53,276 KB
testcase_38 AC 228 ms
59,156 KB
testcase_39 AC 147 ms
53,424 KB
testcase_40 AC 213 ms
58,136 KB
testcase_41 AC 225 ms
58,720 KB
testcase_42 AC 229 ms
58,372 KB
testcase_43 AC 235 ms
58,756 KB
testcase_44 AC 804 ms
62,984 KB
testcase_45 AC 739 ms
61,868 KB
testcase_46 AC 844 ms
60,096 KB
testcase_47 AC 783 ms
61,896 KB
testcase_48 AC 788 ms
62,028 KB
testcase_49 AC 237 ms
59,184 KB
testcase_50 AC 239 ms
58,996 KB
testcase_51 AC 244 ms
59,124 KB
testcase_52 AC 232 ms
58,672 KB
testcase_53 AC 733 ms
61,768 KB
testcase_54 AC 737 ms
61,800 KB
testcase_55 AC 813 ms
62,056 KB
testcase_56 AC 747 ms
61,720 KB
testcase_57 AC 858 ms
61,828 KB
testcase_58 AC 758 ms
61,876 KB
testcase_59 AC 816 ms
62,092 KB
testcase_60 AC 836 ms
62,080 KB
testcase_61 AC 768 ms
63,976 KB
testcase_62 AC 730 ms
62,252 KB
testcase_63 AC 865 ms
63,928 KB
testcase_64 AC 879 ms
64,096 KB
testcase_65 AC 770 ms
62,044 KB
testcase_66 AC 897 ms
64,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {
  static class SegmentTreeRMQ {
    public int M, H, N;
    public int[] st;

    public SegmentTreeRMQ(int n) {
      N = n;
      M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
      H = M >>> 1;
      st = new int[M];
      Arrays.fill(st, 0, M, Integer.MAX_VALUE);
    }

    public SegmentTreeRMQ(int[] a) {
      N = a.length;
      M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
      H = M >>> 1;
      st = new int[M];
      for (int i = 0; i < N; i++) {
        st[H + i] = a[i];
      }
      Arrays.fill(st, H + N, M, Integer.MAX_VALUE);
      for (int i = H - 1; i >= 1; i--)
        propagate(i);
    }

    public void update(int pos, int 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 int minx(int l, int r) {
      int min = Integer.MAX_VALUE;
      if (l >= r)
        return min;
      while (l != 0) {
        int f = l & -l;
        if (l + f > r)
          break;
        int v = st[(H + l) / f];
        if (v < min)
          min = v;
        l += f;
      }

      while (l < r) {
        int f = r & -r;
        int v = st[(H + r) / f - 1];
        if (v < min)
          min = v;
        r -= f;
      }
      return min;
    }

    public int min(int l, int r) {
      return l >= r ? 0 : min(l, r, 0, H, 1);
    }

    private int 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;
        int ret = Integer.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, int 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, int 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;
        }
      }
    }
  }


  private static void solve() {
    int n = ni();
    int[][] p = new int[n][];
    for (int i = 0; i < n; i++) {
      p[i] = new int[] {i, ni(), ni(), ni(), 0};
    }
    Arrays.sort(p, (o1, o2) -> {
      for (int i = 1; i <= 3; i++) {
        if (o1[i] != o2[i])
          return o2[i] - o1[i];
      }
      return o1[0] - o2[0];
    });
    
    int max = 10010;
    SegmentTreeRMQ st = new SegmentTreeRMQ(max);
    for (int[] v : p) {
      int x = -st.min(v[2], max);
      if (x >= v[3]) {
        continue;
      }
      st.update(v[2], -v[3]);
      v[4] = 1;
    }
    Arrays.sort(p, (o1, o2) -> o1[0] - o2[0]);
    for (int[] v : p) {
      if (v[4] == 1) {
        out.println(v[0] + 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