結果

問題 No.261 ぐるぐるぐるぐる！あみだくじ！
コンテスト
ユーザー uwi
提出日時 2015-08-01 16:17:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 53 ms / 5,000 ms
コード長 5,417 bytes
コンパイル時間 3,560 ms
コンパイル使用メモリ 85,852 KB
実行使用メモリ 37,232 KB
最終ジャッジ日時 2024-07-18 00:31:10
合計ジャッジ時間 6,608 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q6xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q655 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] f = new int[n];
		for(int i = 0;i < n;i++){
			f[i] = i;
		}
		int K = ni();
		for(int i = 0;i < K;i++){
			int x = ni()-1, y = ni()-1;
			int d = f[x]; f[x] = f[y]; f[y] = d;
		}
		
		int[][] sf = splitIntoCycleProfs(f);
		int[] clus = sf[0];
		int[] ind = sf[1];
		int[] pe = sf[2];
		
		inner:
		for(int Q = ni();Q > 0;Q--){
			int[] a = na(n);
			for(int i = 0;i < n;i++)a[i]--;
			
			int[] ofs = new int[n];
			Arrays.fill(ofs, -9999);
			for(int i = 0;i < n;i++){
				if(clus[i] != clus[a[i]]){
					out.println(-1);
					continue inner;
				}
				int lofs = (ind[a[i]] - ind[i] + pe[clus[i]]) % pe[clus[i]];
				if(ofs[clus[i]] < 0 || ofs[clus[i]] == lofs){
					ofs[clus[i]] = lofs;
				}else{
					out.println(-1);
					continue inner;
				}
			}
			
			long[] pv = new long[]{1, 0};
			for(int i = 0;i < n;i++){
				if(ofs[i] >= 0){
					pv = crt(pv, pe[i], ofs[i]);
					if(pv == null){
						out.println(-1);
						continue inner;
					}
				}
			}
			if(pv[1] == 0)pv[1] += pv[0];
			out.println(pv[1]);
		}
	}
	
	public static long[] crt(long[] pm, long q, long n)
	{
		long[] apr = exgcd(pm[0], q);
		if((n - pm[1]) % apr[0] != 0)return null;
		long mod = pm[0] * (q / apr[0]);
		long a = (apr[1] * ((n - pm[1]) / apr[0]) * pm[0] + pm[1]) % mod;
		if(a < 0)a += mod;
		pm[0] = mod; pm[1] = a;
		return pm;
	}
	
	public static long[] exgcd(long a, long b) {
		long p = 1, q = 0, r = 0, s = 1;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
			d = r;
			r = s;
			s = d - c * s;
		}
		return new long[] { a, p, r };
	}
	
	public static long mul(long a, long b, long mod)
	{
		a %= mod; if(a < 0)a += mod;
		b %= mod; if(b < 0)b += mod;
		long ret = 0;
		int x = 63-Long.numberOfLeadingZeros(b);
		for(;x >= 0;x--){
			ret += ret;
			if(ret >= mod)ret -= mod;
			if(b<<~x<0){
				ret += a;
				if(ret >= mod)ret -= mod;
			}
		}
		return ret;
	}
	
	public static int[][] splitIntoCycleProfs(int[] f)
	{
		int n = f.length;
		int[] ved = new int[n];
		int[] clus = new int[n];
		Arrays.fill(clus, -1);
		int[] ncyc = new int[n];
		int ncy = 0;
		int[] cind = new int[n];
		Arrays.fill(cind, -1);
		for(int i = 0;i < n;i++){
			int cur = i;
			int p = 0;
			while(ved[cur] == 0){
				ved[cur] = i+1; 
				cind[cur] = p++;
				cur = f[cur];
			}
			if(ved[cur] == i+1){
				// cycle
				int o = cur;
				cur = f[cur];
				clus[o] = ncy;
				int cy = 1;
				while(cur != o){
					clus[cur] = ncy;
					cur = f[cur];
					cy++;
				}
				ncyc[ncy] = cy;
				ncy++;
			}
		}
		return new int[][]{clus, cind, Arrays.copyOf(ncyc, ncy)};
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q655().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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 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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0