結果
| 問題 | No.1261 数字集め |
| ユーザー |
 uwi
|
| 提出日時 | 2020-10-17 00:59:18 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,983 ms / 8,000 ms |
| コード長 | 14,356 bytes |
| コンパイル時間 | 5,414 ms |
| コンパイル使用メモリ | 93,032 KB |
| 実行使用メモリ | 85,200 KB |
| 最終ジャッジ日時 | 2024-07-21 05:28:58 |
| 合計ジャッジ時間 | 140,921 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 94 |
ソースコード
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 1public 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)); }}