結果
問題 | No.752 mod数列 |
ユーザー | uwi |
提出日時 | 2018-11-09 21:44:50 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 620 ms / 2,000 ms |
コード長 | 4,120 bytes |
コンパイル時間 | 7,686 ms |
コンパイル使用メモリ | 89,908 KB |
実行使用メモリ | 74,516 KB |
最終ジャッジ日時 | 2023-08-13 11:24:22 |
合計ジャッジ時間 | 18,589 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,508 KB |
testcase_01 | AC | 43 ms
49,600 KB |
testcase_02 | AC | 42 ms
49,304 KB |
testcase_03 | AC | 43 ms
49,356 KB |
testcase_04 | AC | 43 ms
49,592 KB |
testcase_05 | AC | 42 ms
49,564 KB |
testcase_06 | AC | 43 ms
49,328 KB |
testcase_07 | AC | 44 ms
49,608 KB |
testcase_08 | AC | 42 ms
49,448 KB |
testcase_09 | AC | 42 ms
49,592 KB |
testcase_10 | AC | 67 ms
51,372 KB |
testcase_11 | AC | 62 ms
49,944 KB |
testcase_12 | AC | 66 ms
50,492 KB |
testcase_13 | AC | 68 ms
51,340 KB |
testcase_14 | AC | 68 ms
50,444 KB |
testcase_15 | AC | 413 ms
68,476 KB |
testcase_16 | AC | 507 ms
71,104 KB |
testcase_17 | AC | 585 ms
74,328 KB |
testcase_18 | AC | 502 ms
71,604 KB |
testcase_19 | AC | 535 ms
71,444 KB |
testcase_20 | AC | 578 ms
71,524 KB |
testcase_21 | AC | 589 ms
71,152 KB |
testcase_22 | AC | 593 ms
71,464 KB |
testcase_23 | AC | 579 ms
71,464 KB |
testcase_24 | AC | 620 ms
74,124 KB |
testcase_25 | AC | 238 ms
57,548 KB |
testcase_26 | AC | 470 ms
65,244 KB |
testcase_27 | AC | 352 ms
63,096 KB |
testcase_28 | AC | 420 ms
62,788 KB |
testcase_29 | AC | 491 ms
73,892 KB |
testcase_30 | AC | 572 ms
74,516 KB |
testcase_31 | AC | 44 ms
49,448 KB |
testcase_32 | AC | 44 ms
49,452 KB |
testcase_33 | AC | 47 ms
49,648 KB |
ソースコード
package contest181109; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int P = ni(), Q = ni(); int s = (int)Math.sqrt(P); int[][] qs = new int[Q][]; for(int i = 0;i < Q;i++) { qs[i] = new int[] {ni(), ni()}; } int[][] es = new int[2*Q][]; int p = 0; for(int i = 0;i < Q;i++) { es[p++] = new int[] {qs[i][0]-1, i, -1}; es[p++] = new int[] {qs[i][1], i, 1}; } Arrays.sort(es, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); long[] anss = new long[Q]; p = 0; while(p < 2*Q && es[p][0] == 0) { p++; } long val = 0; for(int i = 1;i <= P/s;i++){ val += P%i; while(p < 2*Q && es[p][0] == i) { anss[es[p][1]] += es[p][2] * val; p++; } } int pk = s-1; int px = P/s; for(;p < 2*Q;p++) { int x = es[p][0]; for(int i = pk;i >= P/x;i--) { pk = i; int lx = px + 1; int rx = Math.min(x, i <= 0 ? Integer.MAX_VALUE : P/i); // tr(lx, P%lx, rx, P%rx, i); val += (long)(rx-lx+1)*(P%lx+P%rx)/2; px = rx; } anss[es[p][1]] += es[p][2] * val; } for(long v : anss) { out.println(v); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }