結果
問題 | No.1261 数字集め |
ユーザー | uwi |
提出日時 | 2020-10-17 00:59:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,884 ms / 8,000 ms |
コード長 | 14,356 bytes |
コンパイル時間 | 4,930 ms |
コンパイル使用メモリ | 85,392 KB |
実行使用メモリ | 102,616 KB |
最終ジャッジ日時 | 2023-09-28 10:47:03 |
合計ジャッジ時間 | 131,409 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,784 ms
101,944 KB |
testcase_01 | AC | 701 ms
89,892 KB |
testcase_02 | AC | 1,322 ms
97,996 KB |
testcase_03 | AC | 1,312 ms
97,876 KB |
testcase_04 | AC | 882 ms
92,432 KB |
testcase_05 | AC | 1,685 ms
96,660 KB |
testcase_06 | AC | 974 ms
92,204 KB |
testcase_07 | AC | 1,316 ms
98,320 KB |
testcase_08 | AC | 768 ms
90,288 KB |
testcase_09 | AC | 977 ms
91,956 KB |
testcase_10 | AC | 281 ms
83,152 KB |
testcase_11 | AC | 1,707 ms
96,288 KB |
testcase_12 | AC | 1,548 ms
96,692 KB |
testcase_13 | AC | 1,392 ms
100,100 KB |
testcase_14 | AC | 336 ms
81,376 KB |
testcase_15 | AC | 757 ms
90,260 KB |
testcase_16 | AC | 1,379 ms
97,828 KB |
testcase_17 | AC | 1,103 ms
93,868 KB |
testcase_18 | AC | 736 ms
89,704 KB |
testcase_19 | AC | 1,306 ms
98,108 KB |
testcase_20 | AC | 412 ms
81,828 KB |
testcase_21 | AC | 1,718 ms
101,884 KB |
testcase_22 | AC | 1,693 ms
101,956 KB |
testcase_23 | AC | 1,840 ms
101,972 KB |
testcase_24 | AC | 1,884 ms
102,052 KB |
testcase_25 | AC | 1,752 ms
101,980 KB |
testcase_26 | AC | 1,771 ms
102,072 KB |
testcase_27 | AC | 1,727 ms
102,356 KB |
testcase_28 | AC | 1,732 ms
102,272 KB |
testcase_29 | AC | 1,697 ms
102,280 KB |
testcase_30 | AC | 1,691 ms
102,256 KB |
testcase_31 | AC | 1,713 ms
102,260 KB |
testcase_32 | AC | 1,690 ms
102,016 KB |
testcase_33 | AC | 1,741 ms
101,960 KB |
testcase_34 | AC | 1,766 ms
101,916 KB |
testcase_35 | AC | 1,775 ms
102,320 KB |
testcase_36 | AC | 1,746 ms
102,080 KB |
testcase_37 | AC | 1,767 ms
102,308 KB |
testcase_38 | AC | 1,838 ms
102,184 KB |
testcase_39 | AC | 1,809 ms
102,336 KB |
testcase_40 | AC | 1,840 ms
102,304 KB |
testcase_41 | AC | 1,773 ms
99,928 KB |
testcase_42 | AC | 1,846 ms
101,884 KB |
testcase_43 | AC | 1,804 ms
101,828 KB |
testcase_44 | AC | 1,582 ms
97,348 KB |
testcase_45 | AC | 498 ms
81,704 KB |
testcase_46 | AC | 894 ms
92,292 KB |
testcase_47 | AC | 687 ms
88,840 KB |
testcase_48 | AC | 1,300 ms
97,628 KB |
testcase_49 | AC | 1,530 ms
96,852 KB |
testcase_50 | AC | 1,373 ms
99,820 KB |
testcase_51 | AC | 527 ms
83,716 KB |
testcase_52 | AC | 283 ms
83,308 KB |
testcase_53 | AC | 529 ms
83,652 KB |
testcase_54 | AC | 594 ms
86,036 KB |
testcase_55 | AC | 395 ms
81,324 KB |
testcase_56 | AC | 446 ms
81,408 KB |
testcase_57 | AC | 1,240 ms
98,076 KB |
testcase_58 | AC | 499 ms
79,688 KB |
testcase_59 | AC | 1,623 ms
97,160 KB |
testcase_60 | AC | 592 ms
86,304 KB |
testcase_61 | AC | 711 ms
89,700 KB |
testcase_62 | AC | 1,452 ms
96,464 KB |
testcase_63 | AC | 423 ms
81,924 KB |
testcase_64 | AC | 1,758 ms
102,048 KB |
testcase_65 | AC | 1,141 ms
96,072 KB |
testcase_66 | AC | 956 ms
92,196 KB |
testcase_67 | AC | 1,518 ms
96,584 KB |
testcase_68 | AC | 1,003 ms
92,228 KB |
testcase_69 | AC | 977 ms
92,048 KB |
testcase_70 | AC | 802 ms
89,904 KB |
testcase_71 | AC | 1,442 ms
98,320 KB |
testcase_72 | AC | 611 ms
87,952 KB |
testcase_73 | AC | 686 ms
88,772 KB |
testcase_74 | AC | 468 ms
81,396 KB |
testcase_75 | AC | 906 ms
92,244 KB |
testcase_76 | AC | 1,288 ms
97,684 KB |
testcase_77 | AC | 1,503 ms
96,320 KB |
testcase_78 | AC | 248 ms
82,412 KB |
testcase_79 | AC | 1,572 ms
97,464 KB |
testcase_80 | AC | 285 ms
83,296 KB |
testcase_81 | AC | 353 ms
81,284 KB |
testcase_82 | AC | 1,175 ms
96,040 KB |
testcase_83 | AC | 619 ms
88,340 KB |
testcase_84 | AC | 1,794 ms
101,688 KB |
testcase_85 | AC | 1,795 ms
100,352 KB |
testcase_86 | AC | 1,874 ms
102,188 KB |
testcase_87 | AC | 1,848 ms
102,404 KB |
testcase_88 | AC | 1,832 ms
102,064 KB |
testcase_89 | AC | 1,827 ms
102,616 KB |
testcase_90 | AC | 1,827 ms
102,248 KB |
testcase_91 | AC | 1,778 ms
100,564 KB |
testcase_92 | AC | 1,829 ms
102,128 KB |
testcase_93 | AC | 1,833 ms
101,904 KB |
ソースコード
package contest201016; import java.io.*; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; public class F2 { InputStream is; FastWriter out; String INPUT = ""; final int mod = 1000000007; long[] m3; long[] m2; long[] m1; int[] invs; public static long[] enumPowsUnderConstE(int e, int n, int[] lpf, int mod) { long[] ret = new long[n+1]; for(int i = 1;i <= n;i++){ if(i == lpf[i] || i == 1){ ret[i] = pow(i, e, mod); }else{ ret[i] = ret[i/lpf[i]] * ret[lpf[i]] % mod; } } return ret; } public void solve() { int n = ni(), m = ni(); int[] a = new int[n+1]; for(int i = 1;i < n;i++)a[i+1] = ni(); long ans = 0; long[] plus = new long[n+1]; invs = enumInvs(1000007, mod); int[] lpf = enumLowestPrimeFactors(1000000); m3 = enumPowsUnderConstE(m-3, 1000000, lpf, mod); m2 = new long[1000005]; m1 = new long[1000005]; for(int i = 0;i < 1000001;i++){ m2[i] = m3[i] * i % mod; m1[i] = m2[i] * i % mod; } for(int l = 2;l < n;l++){ for(int u = 2*l;u < n;u+=l){ long v = calc(a[l]-1, a[u]-1, a[n]-1, m-3); plus[u] += v; if(plus[u] >= mod)plus[u] -= mod; } } boolean[] valid = new boolean[n+1]; for(int i = 2;i < n;i++){ if(n % i == 0){ valid[i] = true; ans += plus[i]; plus[i] = 0; } } ans %= mod; out.println(ans); for(int Q = ni();Q > 0;Q--){ int x = ni(), y = ni(); if(y < n){ long v = calc(a[x]-1, a[y]-1, a[n]-1, m-3); if(valid[y]){ ans += v; if(ans >= mod)ans -= mod; }else{ plus[y] += v; if(plus[y] >= mod)plus[y] -= mod; } }else{ valid[x] = true; ans += plus[x]; if(ans >= mod)ans -= mod; plus[x] = 0; } out.println(ans); } } public static int[] enumInvs(int n, int mod) { int[] inv = new int[n + 1]; inv[1] = 1; for (int i = 2; i <= n; i++) { inv[i] = (int) (inv[mod % i] * (long) (mod - mod / i) % mod); } return inv; } private long calc(long a, long b, long c, long x) { if(a > b){ long d = a; a = b; b = d; } if(b > c){ long d = b; b = c; c = d; } if(a > b){ long d = a; a = b; b = d; } if(a < b && b < c){ long num = m1[(int)a] * (c-b) + m1[(int)b] * (a-c) + m1[(int)c] * (b-a); num %= mod; if(num < 0)num += mod; return (num) * invs[(int)(b-a)] % mod * invs[(int)(c-b)] % mod * invs[(int)(c-a)] % mod; }else if(a < b){ long num = m1[(int)a] - a*(x+2) % mod * m2[(int)b] + (x+1) * m1[(int)b]; num %= mod; if(num < 0)num += mod; return num * invs[(int)(b-a)] % mod * invs[(int)(b-a)] % mod; }else if(b < c){ a = c; long num = m1[(int)a] - a*(x+2) % mod * m2[(int)b] + (x+1) * m1[(int)b]; num %= mod; if(num < 0)num += mod; return num * invs[Math.abs((int)(b-a))] % mod * invs[Math.abs((int)(b-a))] % mod; }else{ return (x+1)*(x+2)/2%mod * m3[(int)b] % mod; } } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } public static long pow(long a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } public static int[] enumLowestPrimeFactors(int n) { int tot = 0; int[] lpf = new int[n+1]; int u = n+32; double lu = Math.log(u); int[] primes = new int[(int)(u/lu+u/lu/lu*1.5)]; for(int i = 2;i <= n;i++)lpf[i] = i; for(int p = 2;p <= n;p++){ if(lpf[p] == p)primes[tot++] = p; int tmp; for(int i = 0;i < tot && primes[i] <= lpf[p] && (tmp = primes[i]*p) <= n;i++){ lpf[tmp] = primes[i]; } } return lpf; } public static void main(String[] args) { new F2().run(); } public void run() { // int n = 1000000, m = 99999; // Random gen = new Random(); // StringBuilder sb = new StringBuilder(); // sb.append(n + " "); // sb.append(1000000 + " "); // for (int i = 0; i < n-1; i++) { // sb.append(gen.nextInt(200000)+2 + " "); // } // sb.append(0 + " "); // INPUT = sb.toString(); long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new FastWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-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(); } private boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){ 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 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[] 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 int ni() { int num = 0, 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 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(); } } public static class FastWriter { private static final int BUF_SIZE = 1<<13; private final byte[] buf = new byte[BUF_SIZE]; private final OutputStream out; private int ptr = 0; private FastWriter(){out = null;} public FastWriter(OutputStream os) { this.out = os; } public FastWriter(String path) { try { this.out = new FileOutputStream(path); } catch (FileNotFoundException e) { throw new RuntimeException("FastWriter"); } } public FastWriter write(byte b) { buf[ptr++] = b; if(ptr == BUF_SIZE)innerflush(); return this; } public FastWriter write(char c) { return write((byte)c); } public FastWriter write(char[] s) { for(char c : s){ buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); } return this; } public FastWriter write(String s) { s.chars().forEach(c -> { buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); }); return this; } private static int countDigits(int l) { if (l >= 1000000000) return 10; if (l >= 100000000) return 9; if (l >= 10000000) return 8; if (l >= 1000000) return 7; if (l >= 100000) return 6; if (l >= 10000) return 5; if (l >= 1000) return 4; if (l >= 100) return 3; if (l >= 10) return 2; return 1; } public FastWriter write(int x) { if(x == Integer.MIN_VALUE){ return write((long)x); } if(ptr + 12 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } private static int countDigits(long l) { if (l >= 1000000000000000000L) return 19; if (l >= 100000000000000000L) return 18; if (l >= 10000000000000000L) return 17; if (l >= 1000000000000000L) return 16; if (l >= 100000000000000L) return 15; if (l >= 10000000000000L) return 14; if (l >= 1000000000000L) return 13; if (l >= 100000000000L) return 12; if (l >= 10000000000L) return 11; if (l >= 1000000000L) return 10; if (l >= 100000000L) return 9; if (l >= 10000000L) return 8; if (l >= 1000000L) return 7; if (l >= 100000L) return 6; if (l >= 10000L) return 5; if (l >= 1000L) return 4; if (l >= 100L) return 3; if (l >= 10L) return 2; return 1; } public FastWriter write(long x) { if(x == Long.MIN_VALUE){ return write("" + x); } if(ptr + 21 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } public FastWriter write(double x, int precision) { if(x < 0){ write('-'); x = -x; } x += Math.pow(10, -precision)/2; // if(x < 0){ x = 0; } write((long)x).write("."); x -= (long)x; for(int i = 0;i < precision;i++){ x *= 10; write((char)('0'+(int)x)); x -= (int)x; } return this; } public FastWriter writeln(char c){ return write(c).writeln(); } public FastWriter writeln(int x){ return write(x).writeln(); } public FastWriter writeln(long x){ return write(x).writeln(); } public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); } public FastWriter write(int... xs) { boolean first = true; for(int x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter write(long... xs) { boolean first = true; for(long x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter writeln() { return write((byte)'\n'); } public FastWriter writeln(int... xs) { return write(xs).writeln(); } public FastWriter writeln(long... xs) { return write(xs).writeln(); } public FastWriter writeln(char[] line) { return write(line).writeln(); } public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln(); return this; } public FastWriter writeln(String s) { return write(s).writeln(); } private void innerflush() { try { out.write(buf, 0, ptr); ptr = 0; } catch (IOException e) { throw new RuntimeException("innerflush"); } } public void flush() { innerflush(); try { out.flush(); } catch (IOException e) { throw new RuntimeException("flush"); } } public FastWriter print(byte b) { return write(b); } public FastWriter print(char c) { return write(c); } public FastWriter print(char[] s) { return write(s); } public FastWriter print(String s) { return write(s); } public FastWriter print(int x) { return write(x); } public FastWriter print(long x) { return write(x); } public FastWriter print(double x, int precision) { return write(x, precision); } public FastWriter println(char c){ return writeln(c); } public FastWriter println(int x){ return writeln(x); } public FastWriter println(long x){ return writeln(x); } public FastWriter println(double x, int precision){ return writeln(x, precision); } public FastWriter print(int... xs) { return write(xs); } public FastWriter print(long... xs) { return write(xs); } public FastWriter println(int... xs) { return writeln(xs); } public FastWriter println(long... xs) { return writeln(xs); } public FastWriter println(char[] line) { return writeln(line); } public FastWriter println(char[]... map) { return writeln(map); } public FastWriter println(String s) { return writeln(s); } public FastWriter println() { return writeln(); } } public static void trnz(int... o) { for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" "); System.out.println(); } // print ids which are 1 public static void trt(long... o) { Queue<Integer> stands = new ArrayDeque<>(); for(int i = 0;i < o.length;i++){ for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x)); } System.out.println(stands); } public static void tf(boolean... r) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } public static void tf(boolean[]... b) { for(boolean[] r : b) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } System.out.println(); } public void tf(long[]... b) { if(INPUT.length() != 0) { for (long[] r : b) { for (long x : r) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } System.out.println(); } } public void tf(long... b) { if(INPUT.length() != 0) { for (long x : b) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } } private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }