結果

問題 No.759 悪くない忘年会にしような！
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-08 07:55:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 964 ms / 2,000 ms
コード長 5,772 bytes
コンパイル時間 2,893 ms
コンパイル使用メモリ 90,796 KB
実行使用メモリ 53,412 KB
最終ジャッジ日時 2024-09-14 04:23:28
合計ジャッジ時間 26,956 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 84 ms
38,164 KB
testcase_01 AC 85 ms
38,224 KB
testcase_02 AC 85 ms
38,472 KB
testcase_03 AC 86 ms
38,208 KB
testcase_04 AC 85 ms
38,156 KB
testcase_05 AC 82 ms
38,164 KB
testcase_06 AC 83 ms
38,164 KB
testcase_07 AC 84 ms
38,600 KB
testcase_08 AC 85 ms
38,368 KB
testcase_09 AC 85 ms
38,472 KB
testcase_10 AC 85 ms
38,320 KB
testcase_11 AC 86 ms
38,572 KB
testcase_12 AC 83 ms
38,436 KB
testcase_13 AC 82 ms
38,356 KB
testcase_14 AC 84 ms
38,316 KB
testcase_15 AC 84 ms
38,164 KB
testcase_16 AC 83 ms
38,376 KB
testcase_17 AC 84 ms
38,412 KB
testcase_18 AC 83 ms
38,224 KB
testcase_19 AC 83 ms
38,500 KB
testcase_20 AC 84 ms
38,172 KB
testcase_21 AC 86 ms
38,472 KB
testcase_22 AC 85 ms
38,392 KB
testcase_23 AC 85 ms
38,156 KB
testcase_24 AC 83 ms
38,600 KB
testcase_25 AC 84 ms
38,412 KB
testcase_26 AC 83 ms
38,496 KB
testcase_27 AC 84 ms
38,316 KB
testcase_28 AC 85 ms
38,164 KB
testcase_29 AC 84 ms
38,552 KB
testcase_30 AC 84 ms
38,376 KB
testcase_31 AC 83 ms
38,400 KB
testcase_32 AC 83 ms
38,224 KB
testcase_33 AC 235 ms
45,904 KB
testcase_34 AC 134 ms
40,076 KB
testcase_35 AC 176 ms
41,484 KB
testcase_36 AC 234 ms
45,628 KB
testcase_37 AC 146 ms
40,568 KB
testcase_38 AC 240 ms
45,916 KB
testcase_39 AC 159 ms
40,620 KB
testcase_40 AC 223 ms
44,812 KB
testcase_41 AC 226 ms
45,616 KB
testcase_42 AC 239 ms
45,808 KB
testcase_43 AC 240 ms
46,004 KB
testcase_44 AC 846 ms
52,004 KB
testcase_45 AC 815 ms
52,184 KB
testcase_46 AC 759 ms
51,908 KB
testcase_47 AC 871 ms
52,288 KB
testcase_48 AC 837 ms
52,280 KB
testcase_49 AC 243 ms
46,420 KB
testcase_50 AC 246 ms
46,036 KB
testcase_51 AC 246 ms
46,384 KB
testcase_52 AC 245 ms
46,196 KB
testcase_53 AC 844 ms
51,948 KB
testcase_54 AC 725 ms
52,516 KB
testcase_55 AC 780 ms
52,024 KB
testcase_56 AC 811 ms
52,028 KB
testcase_57 AC 766 ms
51,964 KB
testcase_58 AC 797 ms
52,336 KB
testcase_59 AC 761 ms
52,340 KB
testcase_60 AC 884 ms
51,940 KB
testcase_61 AC 754 ms
52,044 KB
testcase_62 AC 741 ms
52,192 KB
testcase_63 AC 853 ms
53,412 KB
testcase_64 AC 964 ms
52,644 KB
testcase_65 AC 749 ms
52,420 KB
testcase_66 AC 864 ms
53,228 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