結果

問題 No.752 mod数列
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-11-11 04:58:13
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,908 bytes
コンパイル時間 2,802 ms
コンパイル使用メモリ 82,028 KB
実行使用メモリ 91,304 KB
最終ジャッジ日時 2023-08-18 08:40:29
合計ジャッジ時間 19,771 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 456 ms
62,832 KB
testcase_16 AC 723 ms
66,144 KB
testcase_17 AC 995 ms
81,776 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 961 ms
89,908 KB
testcase_21 AC 1,055 ms
91,304 KB
testcase_22 AC 1,007 ms
90,560 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

public class Main {


  private static void solve() {
    int p = ni();
    int q = ni();
    int[][] range = ntable(q, 2);
    
    Map<Long, Long> dic = new HashMap<>();
    long[] a = new long[q * 2 + 1];
    int ptr = 0;
    a[ptr ++] = p - 1;
    a[ptr ++] = p;
    for (int[] v : range) {
      for (int i = 0; i < 2; i ++) {
        if (v[i] < p && !dic.containsKey((long)v[i] + i)) {
          a[ptr ++] = v[i] + i;
          dic.put((long)v[i] + i, 0L);
        }
      }
    }
    a = Arrays.copyOf(a, ptr);
    Arrays.sort(a);
    int s = ptr;
    long sum = 0;
    ptr = 0;
    for  (long n = 1; n < p;) {
      long v = p / n;

      long left = 0;
      long right = Long.MAX_VALUE / 2;
      while (right - left > 1) {
        long k = (right + left) / 2;
        
        if (p / (n + k) == v) {
          left = k;
        } else {
          right = k;
        }
      }
      long to = right;
      long mod = p % n;
      
      while (ptr < s && n <= a[ptr] && a[ptr] < n + to) {
        long y = (a[ptr] - n);
        dic.put(a[ptr], sum + y * mod - v * y * (y - 1) / 2);
        ptr ++;
      }
      sum += to * mod - v * to * (to - 1) / 2;
      n += to;
    }

    for (int[] v : range) {
      long l = Math.min(p - 1, v[0]);
      long r = Math.min(p, v[1] + 1);
      
      long el = Math.max(p, v[0]);
      long er = Math.max(p, v[1] + 1);
      
      long ret = dic.get(r) - dic.get(l);
      ret += Math.max(er - el, 0) * p;
      out.println(ret);
    }
  }

  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