結果
| 問題 | No.261 ぐるぐるぐるぐる！あみだくじ！ |
| ユーザー |
 tanzaku
|
| 提出日時 | 2015-08-01 01:06:16 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 59 ms / 5,000 ms |
| コード長 | 8,278 bytes |
| コンパイル時間 | 2,716 ms |
| コンパイル使用メモリ | 89,904 KB |
| 実行使用メモリ | 37,516 KB |
| 最終ジャッジ日時 | 2024-07-18 00:16:57 |
| 合計ジャッジ時間 | 6,716 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 37 |
ソースコード
import java.io.*;import java.math.*;import java.util.*;import static java.util.Arrays.*;public class Main {private static final int mod = (int)1e9+7;final Random random = new Random(0);final IOFast io = new IOFast();/// MAIN CODEpublic void run() throws IOException {// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());int TEST_CASE = 1;while(TEST_CASE-- != 0) {int N = io.nextInt();int K = io.nextInt();int[] tt = new int[N];int[] t = new int[N];for(int i = 0; i < N; i++) {tt[i] = i;}for(int i = 0; i < K; i++) {int x = io.nextInt() - 1;int y = io.nextInt() - 1;swap(tt, x, y);}for(int i = 0; i < N; i++) {t[tt[i]] = i;}int Q = io.nextInt();LOOP: while(Q-- > 0) {UnionFind uf1 = new UnionFind(N);UnionFind uf2 = new UnionFind(N);int[] A = new int[N];for(int i = 0; i < N; i++) {A[i] = io.nextInt() - 1;}for(int i = 0; i < N; i++) {uf1.union(t[i], i);uf2.union(A[i], i);}for(int i = 0; i < N; i++) {if(!uf1.same(i, A[i])) {io.out.println(-1);continue LOOP;}}// System.err.println(Q);int[] cnt = new int[N];int len = 0;for(int i = 0; i < N; i++) {if(cnt[uf1.root(i)] == 0) {len++;int j, k;for(j = t[i], k = 1; A[j] != i; k++) {j = t[j];}cnt[uf1.root(i)] = k;// System.err.println(i + " " + cnt[uf1.root(i)]);continue;}else {int j = t[i];for(int k = cnt[uf1.root(i)] - 1; k > 0; k--) {j = t[j];}// System.err.println(i + " " + cnt[uf1.root(i)] + " " + j);if(i != A[j]) {io.out.println(-1);continue LOOP;}}}long ans = 1;long[] AA = new long[len];long[] BB = new long[len];long[] MM = new long[len];for(int i = 0, j = 0; i < N; i++) {if(cnt[i] != 0) {AA[j] = 1;BB[j] = cnt[i];MM[j] = uf1.size(i);j++;}}io.out.println(chineseReminder(AA, BB, MM));}}}static long chineseReminder(long[] A, long[] B, long[] M) {long x = 0;int m = 1;for(int i = 0; i < A.length; i++) {long a = A[i] * m, b = B[i] - A[i] * x, d = gcd(M[i], a);if(b % d != 0) return -1;long t = (b / d * modInverse(a / d, M[i] / d) % (M[i] / d));x += m * t;m *= M[i] / d;}long res = (x % m + m) % m;if(res == 0) res = m;return res;}static long modInverse(final long n, final long m) {final long[] res = extGcd(n, m);return res[2] != 1 ? -1 : (m + res[0]) % m;}static long[] extGcd(final long a, final long b) {if (b == 0) {return new long[] { 1, 0, a };}final long[] res = extGcd(b, a % b);long y = res[0];final long x = res[1];y -= (a / b) * x;res[0] = x;res[1] = y;return res;}staticclass UnionFind {private int[] data;public UnionFind(int size) {data = new int[size];clear();}public UnionFind(final UnionFind uf) {data = uf.data.clone();}public void clear() {Arrays.fill(data, -1);}public int root(int x) { return data[x] < 0 ? x : (data[x] = root(data[x])); }public void union(int x, int y) {if((x = root(x)) != (y = root(y))) {if(data[y] < data[x]) { final int t = x; x = y; y = t; }data[x] += data[y];data[y] = x;}}public boolean same(int x, int y) { return root(x) == root(y); }public int size(int x) { return -data[root(x)]; }}/// TEMPLATEstatic int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }void main() throws IOException {// IOFast.setFileIO("rle-size.in", "rle-size.out");try { run(); }catch (EndOfFileRuntimeException e) { }io.out.flush();}public static void main(String[] args) throws IOException { new Main().main(); }static class EndOfFileRuntimeException extends RuntimeException {private static final long serialVersionUID = -8565341110209207657L; }staticpublic class IOFast {private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));private PrintWriter out = new PrintWriter(System.out);void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }private static int pos, readLen;private static final char[] buffer = new char[1024 * 8];private static char[] str = new char[500*8*2];private static boolean[] isDigit = new boolean[256];private static boolean[] isSpace = new boolean[256];private static boolean[] isLineSep = new boolean[256];static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] =isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw newEndOfFileRuntimeException(); } } return buffer[pos++]; }public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0]== '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length ==len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } }catch(EndOfFileRuntimeException e) { ; } return len; }int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; }cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r'){ len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }public String nextString() throws IOException { return new String(next()); }public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); }return res; }public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) {res[i] = nextIntArray(k); } return res; }public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i <n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] =nextDouble(); } return res; }}}