結果
問題 | No.752 mod数列 |
ユーザー | 37zigen |
提出日時 | 2018-11-09 22:17:19 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,126 bytes |
コンパイル時間 | 2,300 ms |
コンパイル使用メモリ | 74,464 KB |
実行使用メモリ | 214,712 KB |
最終ジャッジ日時 | 2023-08-13 11:39:45 |
合計ジャッジ時間 | 9,601 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 314 ms
212,336 KB |
testcase_01 | AC | 313 ms
209,956 KB |
testcase_02 | AC | 313 ms
210,452 KB |
testcase_03 | AC | 314 ms
210,460 KB |
testcase_04 | AC | 315 ms
209,496 KB |
testcase_05 | AC | 314 ms
210,024 KB |
testcase_06 | AC | 317 ms
209,976 KB |
testcase_07 | AC | 313 ms
211,060 KB |
testcase_08 | AC | 315 ms
210,004 KB |
testcase_09 | AC | 312 ms
209,900 KB |
testcase_10 | TLE | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(); long P = sc.nextLong(); int Q = sc.nextInt(); int[] L = new int[Q]; int[] R = new int[Q]; for (int i = 0; i < Q; ++i) { L[i] = sc.nextInt(); R[i] = sc.nextInt(); } PrintWriter pw = new PrintWriter(System.out); long[] sum = new long[20000000]; for (int i = 1; i < sum.length; ++i) { sum[i] = P % i + (i > 0 ? sum[i - 1] : 0); } for (int i = 0; i < Q; ++i) { int l = L[i]; int r = R[i]; long ans = 0; if (l < sum.length) { ans = sum[Math.min(sum.length - 1, r)] - sum[l - 1]; l = Math.min(sum.length, r + 1); } if (l > r) { pw.println(ans); } else { for (long cur = l; cur <= r;) { long q = P / cur; if (q == 0) break; long res = P % cur; long x = Math.min((long) ((P - cur * q - 1) / q), r - cur); // l,l+1,..,l+xが商が同じ ans = res * (x + 1) - q * x * (x + 1) / 2 + ans; cur = cur + x + 1; } pw.println(ans); } } pw.close(); } static long gcd(long a, long b) { if (a > b) return gcd(b, a); if (a == 0) return b; return gcd(b % a, a); } static class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int) nextLong(); } } public static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }