結果
| 問題 | No.1303 Inconvenient Kingdom |
| ユーザー |
 uwi
|
| 提出日時 | 2020-11-27 23:18:52 |
| 言語 | Java (openjdk 23) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 16,551 bytes |
| コンパイル時間 | 5,842 ms |
| コンパイル使用メモリ | 95,292 KB |
| 実行使用メモリ | 51,304 KB |
| 最終ジャッジ日時 | 2024-09-13 01:00:01 |
| 合計ジャッジ時間 | 11,276 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 5 TLE * 1 -- * 28 |
ソースコード
package contest201127;import java.io.*;import java.util.ArrayDeque;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Queue;// O(n^5)から落ちない・・public class FFN {InputStream is;FastWriter out;String INPUT = "";public void solve(){int n = ni(), m = ni();int[] from = new int[m];int[] to = new int[m];for(int i = 0;i < m;i++){from[i] = ni()-1;to[i] = ni()-1;}DJSet ds = new DJSet(n);for(int i = 0;i < m;i++){ds.union(from[i], to[i]);}int[] ns = new int[n];int p = 0;for(int i = 0;i < n;i++){if(ds.upper[i] < 0){ns[p++] = -ds.upper[i];}}ns = Arrays.copyOf(ns, p);Arrays.sort(ns);final int mod = 998244353;if(ns.length == 1){boolean[][] h = new boolean[n][n];for(int i = 0;i < m;i++){h[from[i]][to[i]] = h[to[i]][from[i]] = true;}long base = 0;{int[][] mat = new int[n-1][n-1];for(int j = 0;j < m;j++){int f = from[j], t = to[j];if(f < n-1 && t < n-1) {mat[f][t]--;mat[t][f]--;}if(f < n-1)mat[f][f]++;if(t < n-1)mat[t][t]++;}base = det(mat, mod);}long ans = base;for(int k = 0;k < n;k++){for(int l = k+1;l < n;l++){if(!h[k][l]){int[][] mat = new int[n-1][n-1];for(int j = 0;j < m;j++){int f = from[j], t = to[j];if(f < n-1 && t < n-1) {mat[f][t]--;mat[t][f]--;}if(f < n-1)mat[f][f]++;if(t < n-1)mat[t][t]++;}{int f = k, t = l;if(f < n-1 && t < n-1) {mat[f][t]--;mat[t][f]--;}if(f < n-1)mat[f][f]++;if(t < n-1)mat[t][t]++;}// tr(det(mat, mod), mat, base);ans += det(mat, mod) - base;}}}ans %= mod;if(ans < 0)ans += mod;out.println(0);out.println(ans);}else{int[][] b = ds.toBucket();long ans = 1;long ansn = 0;for(int i = 0;i < n;i++){if(b[i] != null){ansn += (b[i].length) * (b[i].length-1)/2;int q = b[i].length;int[][] mat = new int[q-1][q-1];for(int j = 0;j < m;j++){if(ds.equiv(i, from[j])) {int f = Arrays.binarySearch(b[i], from[j]);int t = Arrays.binarySearch(b[i], to[j]);if(t < q-1 && f < q-1) {mat[f][t]--;mat[t][f]--;}if(f < q-1)mat[f][f]++;if(t < q-1)mat[t][t]++;}}ans = ans * det(mat, mod) % mod;}}ansn -= ns[ns.length-2] * (ns[ns.length-2]-1) / 2;ansn -= ns[ns.length-1] * (ns[ns.length-1]-1) / 2;ansn += (ns[ns.length-1] + ns[ns.length-2]) * (ns[ns.length-1]+ns[ns.length-2]-1) / 2;long ct = 0;for(int i = 0;i < ns.length;i++){for(int j = i+1;j < ns.length;j++){if(ns[i] == ns[ns.length-2] && ns[j] == ns[ns.length-1]){ct += (long)ns[i] * ns[j];}}}ans = ans * ct % mod;out.println((n*(n-1)/2-ansn)*2);out.println(ans);}}public static int[] decomposeToLUP(int[][] a, int mod){int n = a.length;int[] row = new int[n];for(int i = 0;i < n;i++)row[i] = i;for(int i = 0;i < n;i++){int j = -1;for(j = i;j < n && a[j][i] == 0;j++);if(j == n)break;// swap rowsif(i != j){{int[] d = a[i]; a[i] = a[j]; a[j] = d;}{int d = row[i]; row[i] = row[j]; row[j] = d;}}long inv = invl(a[i][i], mod);for(int r = i+1;r < n;r++){a[r][i] = (int)(a[r][i] * inv % mod);if(a[r][i] != 0){long mul = -a[r][i];if(mul < 0)mul += mod;for(int c = i+1;c < n;c++){a[r][c] = (int)((a[r][c] + a[i][c] * mul) % mod);}}}}return row;}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 int[][] copy(int[][] a){int[][] ret = new int[a.length][];for(int i = 0;i < a.length;i++)ret[i] = Arrays.copyOf(a[i], a[i].length);return ret;}public static int det(int[][] A, int mod){for(int i = 0;i < A.length;i++){for(int j = 0;j < A[i].length;j++){if(A[i][j] < 0)A[i][j] += mod;}}int[][] LU = copy(A);int[] f = decomposeToLUP(LU, mod);long det = numSwap(f) % 2 == 0 ? 1 : mod-1;for(int i = 0;i < A.length;i++){det = det * LU[i][i] % mod;}return (int)det;}public static int numSwap(int[] f){int n = f.length;boolean[] ved = new boolean[n];int cycle = 0;for(int i = 0;i < n;i++){if(!ved[i]){cycle++;for(int j = i;!ved[j];j = f[j])ved[j] = true;}}return n-cycle;}public static int[][] enumFIF(int n, int mod) {int[] f = new int[n + 1];int[] invf = new int[n + 1];f[0] = 1;for (int i = 1; i <= n; i++) {f[i] = (int) ((long) f[i - 1] * i % mod);}long a = f[n];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;}invf[n] = (int) (p < 0 ? p + mod : p);for (int i = n - 1; i >= 0; i--) {invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);}return new int[][]{f, invf};}public static long C(int n, int r, int mod, int[][] fif) {if (n < 0 || r < 0 || r > n) return 0;return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;}public static class DJSet {public int[] upper;public DJSet(int n) {upper = new int[n];Arrays.fill(upper, -1);}public int root(int x) {return upper[x] < 0 ? x : (upper[x] = root(upper[x]));}public boolean equiv(int x, int y) {return root(x) == root(y);}public boolean union(int x, int y) {x = root(x);y = root(y);if (x != y) {if (upper[y] < upper[x]) {int d = x;x = y;y = d;}upper[x] += upper[y];upper[y] = x;}return x == y;}public int count() {int ct = 0;for (int u : upper) if (u < 0) ct++;return ct;}public int[][] toBucket() {int n = upper.length;int[][] ret = new int[n][];int[] rp = new int[n];for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];for (int i = 0; i < n; i++) {int r = root(i);ret[r][rp[r]++] = i;}return ret;}}public static void main(String[] args) {new FFN().run();}public void run(){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)); }}