結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー hiromi_ayase
提出日時 2020-05-29 22:41:38
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,547 ms / 2,000 ms
コード長 3,627 bytes
コンパイル時間 4,684 ms
コンパイル使用メモリ 89,812 KB
実行使用メモリ 367,480 KB
最終ジャッジ日時 2024-11-06 06:33:44
合計ジャッジ時間 17,740 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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

import java.util.Arrays;
public class Main {
  private static void solve() {
    int n = ni();
    int q = ni();
    int[] a = na(n);
    int mod = 998244353;
    Arrays.sort(a);
    for (int i = 0, j = n - 1; i < j; i ++ , j --) {
      int tmp = a[i];
      a[i] = a[j];
      a[j] = tmp;
    }
    long[][] dp = new long[n + 1][n + 2];
    dp[0][0] = 1;
    for (int i = 0; i < n; i ++) {
      for (int j = 0; j <= n; j ++) {
        dp[i + 1][j] = dp[i][j] * (a[i]-1) % mod;
        if (j > 0)
          dp[i + 1][j] += dp[i][j - 1];
        dp[i + 1][j] %= mod;
      }
    }
    long[] sum = new long[n + 1];
    sum[n] = 1;
    for (int i = n; i > 0; i --) {
      sum[i-1] = sum[i] * a[i-1] % mod;
    }
    for (int i = 0; i < q; i ++){ 
      int l = ni();
      int r = ni();
      int p = ni();
      long ret = 0;
      for (int k = l; k <= r; k ++) {
        int idx = bisect(k, a);
        long now = dp[idx + 1][p] * sum[idx + 1] % mod;
        ret ^= now;
      }
      out.println(ret);
    }
  }
  private static int bisect(int k, int[] a) {
    int n = a.length;
    int ok = 0;
    int ng = n;
    while (ng - ok > 1) {
      int v = (ng + ok) / 2;
      if (a[v] >= k) {
        ok = v;
      } else {
        ng = v;
      }
    }
    return ok;
  }
  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));
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0