結果
問題 | No.590 Replacement |
ユーザー |
|
提出日時 | 2017-11-04 00:40:23 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 393 ms / 2,000 ms |
コード長 | 5,948 bytes |
コンパイル時間 | 4,001 ms |
コンパイル使用メモリ | 83,808 KB |
実行使用メモリ | 56,636 KB |
最終ジャッジ日時 | 2024-11-23 15:33:44 |
合計ジャッジ時間 | 15,396 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 47 |
ソースコード
package contest171104;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 E {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int[] a = na(n);for(int i = 0;i < n;i++)a[i]--;a = invf(a);int[] b = na(n);for(int i = 0;i < n;i++)b[i]--;b = invf(b);int[][] csa = splitIntoCycles(a);int[] csaid = new int[n];int[] csaind = new int[n];for(int i = 0;i < csa.length;i++){for(int j = 0;j < csa[i].length;j++){csaid[csa[i][j]] = i;csaind[csa[i][j]] = j;}}int[][] csb = splitIntoCycles(b);int[] csbid = new int[n];int[] csbind = new int[n];for(int i = 0;i < csb.length;i++){for(int j = 0;j < csb[i].length;j++){csbid[csb[i][j]] = i;csbind[csb[i][j]] = j;}}int[][] qs = new int[n][];for(int i = 0;i < n;i++){int g = gcd(csa[csaid[i]].length, csb[csbid[i]].length);qs[i] = new int[]{csaid[i], csaind[i], csbid[i], csbind[i], (int)((csaind[i] - csbind[i] + g * 9999999999L) % g), g};}long ans = 0;Arrays.sort(qs, new Comparator<int[]>() {public int compare(int[] a, int[] b) {if(a[0] != b[0])return a[0] - b[0];if(a[2] != b[2])return a[2] - b[2];return a[4] - b[4];}});int mod = 1000000007;for(int i = 0;i < n;){int j = i;while(j < n && qs[i][0] == qs[j][0] && qs[i][2] == qs[j][2] && qs[i][4] == qs[j][4])j++;int g = qs[i][5];long p = (long)csa[qs[i][0]].length * csb[qs[i][2]].length / g;long[] poss = new long[j-i];for(int k = i;k < j;k++){poss[k-i] = crt(csa[qs[k][0]].length, qs[k][1],csb[qs[k][2]].length, qs[k][3] + qs[i][4]);}Arrays.sort(poss);for(int k = 1;k < j-i;k++){long ch = poss[k] - poss[k-1];ch %= mod;ans += (ch-1)*ch/2;ans %= mod;}long ch = poss[0] - poss[j-i-1] + p;ch %= mod;ans += (ch-1)*ch/2;ans %= mod;i = j;}out.println(ans);}public static long crt(long p, long m, long q, long n){long a = p, b = q;long pp = 1, qq = 0;while(b > 0){long c = a / b;long d;d = a; a = b; b = d % b;d = pp; pp = qq; qq = d - c * qq;}if((n - m) % a != 0)return -1;long mod = p / a * q;long ret = (p * pp % mod * ((n - m) / a) + m) % mod;// long ret = (mul(mul(p, pp, mod), (n-m)/a, mod)+m)%mod;if(ret < 0)ret += mod;return ret;}public static int gcd(int a, int b) {while (b > 0) {int c = a;a = b;b = c % b;}return a;}static int[] invf(int[] f){int n = f.length;int[] u = new int[n];for(int i = 0;i < n;i++){u[f[i]] = i;}return u;}public static int[][] splitIntoCycles(int[] f){int n = f.length;int[][] cycles = new int[n][];boolean[] ved = new boolean[n];int[] row = new int[n];int q = 0;for(int i = 0;i < n;i++){if(!ved[i]){int p = 0;for(int cur = i;!ved[cur];cur = f[cur]){ved[cur] = true;row[p++] = cur;}cycles[q++] = Arrays.copyOf(row, p);}}return Arrays.copyOf(cycles, q);}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 E().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)); }}