結果

問題 No.101 ぐるぐる！あみだくじ！
ユーザー uwiuwi
提出日時 2014-12-15 02:29:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 81 ms / 5,000 ms
コード長 4,065 bytes
コンパイル時間 2,704 ms
コンパイル使用メモリ 88,468 KB
実行使用メモリ 38,508 KB
最終ジャッジ日時 2024-06-11 21:11:11
合計ジャッジ時間 6,188 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
38,192 KB
testcase_01 AC 74 ms
38,340 KB
testcase_02 AC 72 ms
38,132 KB
testcase_03 AC 69 ms
38,060 KB
testcase_04 AC 70 ms
37,820 KB
testcase_05 AC 73 ms
37,996 KB
testcase_06 AC 69 ms
37,996 KB
testcase_07 AC 81 ms
38,044 KB
testcase_08 AC 69 ms
38,004 KB
testcase_09 AC 68 ms
38,124 KB
testcase_10 AC 76 ms
38,224 KB
testcase_11 AC 76 ms
38,188 KB
testcase_12 AC 80 ms
38,096 KB
testcase_13 AC 78 ms
38,192 KB
testcase_14 AC 78 ms
38,148 KB
testcase_15 AC 77 ms
38,268 KB
testcase_16 AC 66 ms
38,128 KB
testcase_17 AC 65 ms
38,188 KB
testcase_18 AC 65 ms
38,196 KB
testcase_19 AC 66 ms
38,100 KB
testcase_20 AC 66 ms
37,868 KB
testcase_21 AC 69 ms
38,272 KB
testcase_22 AC 66 ms
38,164 KB
testcase_23 AC 66 ms
38,268 KB
testcase_24 AC 64 ms
38,268 KB
testcase_25 AC 66 ms
38,508 KB
testcase_26 AC 67 ms
38,032 KB
testcase_27 AC 74 ms
37,992 KB
testcase_28 AC 66 ms
38,200 KB
testcase_29 AC 62 ms
37,992 KB
testcase_30 AC 72 ms
38,228 KB
testcase_31 AC 70 ms
38,348 KB
testcase_32 AC 63 ms
38,128 KB
testcase_33 AC 66 ms
37,804 KB
testcase_34 AC 62 ms
38,120 KB
testcase_35 AC 62 ms
38,252 KB
testcase_36 AC 62 ms
38,188 KB
testcase_37 AC 69 ms
38,116 KB
testcase_38 AC 61 ms
38,356 KB
testcase_39 AC 62 ms
38,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni();
		int K = ni();
		int[] f = new int[n];
		for(int i = 0;i < n;i++)f[i] = i;
		for(int i = 0;i < K;i++){
			int p = ni(); ni();
			int d = f[p-1]; f[p-1] = f[p]; f[p] = d;
		}
		
		boolean[] ved = new boolean[n];
		boolean[] freq = new boolean[n+1];
		for(int i = 0;i < n;i++){
			if(!ved[i]){
				int cy = 0;
				for(int x = i;!ved[x];x = f[x]){
					ved[x] = true;
					cy++;
				}
				freq[cy] = true;
			}
		}
		BigInteger b = BigInteger.ONE;
		for(int i = 1;i <= n;i++){
			if(freq[i]){
				BigInteger c = BigInteger.valueOf(i);
				b = b.divide(b.gcd(c)).multiply(c);
			}
		}
		out.println(b);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static 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 static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0