結果

問題 No.101 ぐるぐる！あみだくじ！
ユーザー atn112323atn112323
提出日時 2016-03-23 16:48:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 81 ms / 5,000 ms
コード長 12,527 bytes
コンパイル時間 2,423 ms
コンパイル使用メモリ 82,920 KB
実行使用メモリ 51,604 KB
最終ジャッジ日時 2024-04-09 21:06:12
合計ジャッジ時間 6,451 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,640 KB
testcase_01 AC 80 ms
51,084 KB
testcase_02 AC 73 ms
51,484 KB
testcase_03 AC 54 ms
50,540 KB
testcase_04 AC 51 ms
50,536 KB
testcase_05 AC 71 ms
51,600 KB
testcase_06 AC 53 ms
50,324 KB
testcase_07 AC 68 ms
51,584 KB
testcase_08 AC 75 ms
51,092 KB
testcase_09 AC 63 ms
50,676 KB
testcase_10 AC 71 ms
50,456 KB
testcase_11 AC 62 ms
50,792 KB
testcase_12 AC 78 ms
51,484 KB
testcase_13 AC 70 ms
51,604 KB
testcase_14 AC 63 ms
50,260 KB
testcase_15 AC 76 ms
51,476 KB
testcase_16 AC 70 ms
51,464 KB
testcase_17 AC 79 ms
51,596 KB
testcase_18 AC 61 ms
50,476 KB
testcase_19 AC 71 ms
51,460 KB
testcase_20 AC 62 ms
50,728 KB
testcase_21 AC 77 ms
51,100 KB
testcase_22 AC 73 ms
51,144 KB
testcase_23 AC 81 ms
51,580 KB
testcase_24 AC 57 ms
50,832 KB
testcase_25 AC 70 ms
51,596 KB
testcase_26 AC 69 ms
51,408 KB
testcase_27 AC 81 ms
51,448 KB
testcase_28 AC 75 ms
51,232 KB
testcase_29 AC 73 ms
51,380 KB
testcase_30 AC 78 ms
51,404 KB
testcase_31 AC 75 ms
51,224 KB
testcase_32 AC 77 ms
51,532 KB
testcase_33 AC 74 ms
51,544 KB
testcase_34 AC 51 ms
50,716 KB
testcase_35 AC 52 ms
50,536 KB
testcase_36 AC 51 ms
50,680 KB
testcase_37 AC 54 ms
50,440 KB
testcase_38 AC 52 ms
50,644 KB
testcase_39 AC 53 ms
50,700 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	/**
	 * This class represents a problem setting.
	 */
	class Problem implements IProblem {

		int N;
		int K;
		int[][] XY;
		
		@Override
		public void set(ProblemReader reader) throws IOException {
			N = reader.nextInt();
			K = reader.nextInt();
			XY = reader.nextIntArray2(K);
		}
		
		@Override
		public String toString() {
			// TODO
			return null;
		}
	}
	
	/**
	 * Solver for the problem.
	 * It's the most important part of codes in this file.
	 */
	class Solver implements IProblemSolver<Problem> {

		@Override
		public String solve(Problem problem) {
			int N = problem.N, K = problem.K;
			int[][] XY = problem.XY;
			return StringUtils.toString(solve(N, K, XY));
		}
		
		private long solve(int N, int K, int[][] XY) {
			int[] a = new int[N];
			for (int i = 0; i < N; i++) {
				a[i] = i;
			}
			for (int i = 0; i < K; i++) {
				int x = XY[i][0] - 1, y = XY[i][1] - 1;
				int tmp = a[x]; a[x] = a[y]; a[y] = tmp;
			}
			int[] b = new int[N];
			for (int i = 0; i < N; i++) {
				b[a[i]] = i;
			}
			int[] loops = new int[N + 1];
			boolean[] visited = new boolean[N];
			for (int i = 0; i < N; i++) {
				if (visited[i]) {
					continue;
				}
				visited[i] = true;
				int cnt = 1;
				int idx = b[i];
				while (!visited[idx]) {
					visited[idx] = true;
					cnt++;
					idx = b[idx];
				}
				loops[cnt]++;
			}
			long res = 1;
			for (int i = 1; i <= N; i++) {
				if (loops[i] > 0) {
					res = lcm(res, i);
				}
			}
			return res;
		}
		
		private long gcd(long a, long b) {
			if (a == 0) {
				return b;
			}
			return gcd(b % a, a);
		}
		
		private long lcm(long a, long b) {
			return a * b / gcd(a, b);
		}
	}
	
	/**
	 * This class is a solver to confirm the main solver.
	 * This solver often works only for a problem with a small number setting.
	 */
	class Solver2 implements IProblemSolver<Problem> {

		@Override
		public String solve(Problem problem) {
			// TODO
			return null;
		}
	}
	
	class Factory implements IProblemFactory<Problem> {

		@Override
		public Problem newProblem() {
			// TODO
			return null;
		}

		@Override
		public Problem newProblem(ProblemReader reader) throws IOException {
			Problem problem = new Problem();
			problem.set(reader);
			return problem;
		}
	}
	
	class ResultComparator implements IResultComparator {
		
		@Override
		public boolean same(String res1, String res2) {
			// TODO
			return res1.equals(res2);
		}
	}
	
	ProblemProcessor<Problem> processor;
	
	Main() {
		Init();
	}
	
	void Init() {
		ProblemProcessorConfig<Problem> config = new ProblemProcessorConfig<>();
		
		config.factory = new Factory();
		config.solver = new Solver();
		config.solver2 = new Solver2();
		config.comparator = new ResultComparator();
		
		processor = new ProblemProcessor<Problem>(config);
	}
	
	void process(String mode) throws IOException {
		processor.process(mode);
	}
	
	public static void main(String args[]) throws IOException {
		// "create", "debug", and "solve"
		String mode = "solve";
		new Main().process(mode);
	}
	
/*
	Common library
*/
	
	interface IProblem {
		
		abstract void set(ProblemReader reader) throws IOException;
	}
	
	interface IProblemFactory<P extends IProblem> {
		
		abstract P newProblem();
		abstract P newProblem(ProblemReader reader) throws IOException;
	}
	
	interface IProblemSolver<P extends IProblem> {
		
		abstract String solve(P problem);
	}
	
	interface IResultComparator {
		
		abstract boolean same(String res1, String res2);
	}
	
	class ProblemReader {
		
		BufferedReader br = null;
		
		ProblemReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		int nextInt() throws IOException {
			return StringUtils.toInt(br.readLine());
		}
		
		long nextLong() throws IOException {
			return StringUtils.toLong(br.readLine());
		}
		
		double nextDouble() throws IOException {
			return StringUtils.toDouble(br.readLine());
		}
		
		String nextString() throws IOException {
			return br.readLine();
		}
		
		int[] nextIntArray() throws IOException {
			return StringUtils.toIntArray(br.readLine());
		}
		
		long[] nextLongArray() throws IOException {
			return StringUtils.toLongArray(br.readLine());
		}
		
		double[] nextDoubleArray() throws IOException {
			return StringUtils.toDoubleArray(br.readLine());
		}
		
		String[] nextStringArray() throws IOException {
			return StringUtils.toStringArray(br.readLine());
		}
		
		int[] nextIntArray(int n) throws IOException {
			int[] a = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextInt();
			}
			return a;
		}
		
		long[] nextLongArray(int n) throws IOException {
			long[] a = new long[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextLong();
			}
			return a;
		}
		
		double[] nextDoubleArray(int n) throws IOException {
			double[] a = new double[n];
			for (int i = 0; i < n; i++) {
				a[i] = nextDouble();
			}
			return a;
		}
		
		String[] nextStringArray(int n) throws IOException {
			String[] strs = new String[n];
			for (int i = 0; i < n; i++) {
				strs[i] = nextString();
			}
			return strs;
		}
		
		int[][] nextIntArray2(int n) throws IOException {
			int[][] a = new int[n][];
			for (int i = 0; i < n; i++) {
				a[i] = nextIntArray();
			}
			return a;
		}
		
		long[][] nextLongArray2(int n) throws IOException {
			long[][] a = new long[n][];
			for (int i = 0; i < n; i++) {
				a[i] = nextLongArray();
			}
			return a;
		}
		
		double[][] nextDoubleArray2(int n) throws IOException {
			double[][] a = new double[n][];
			for (int i = 0; i < n; i++) {
				a[i] = nextDoubleArray();
			}
			return a;
		}
		
		String[][] nextStringArray2(int n) throws IOException {
			String[][] strs = new String[n][];
			for (int i = 0; i < n; i++) {
				strs[i] = nextStringArray();
			}
			return strs;
		}
		
		void close() throws IOException {
			if (br != null) {
				br.close();
			}
		}
	}
	
	class ProblemCreator<P extends IProblem> {
		
		IProblemFactory<P> factory;
		
		ProblemCreator(IProblemFactory<P> factory) {
			this.factory = factory;
		}
		
		void create() throws FileNotFoundException {
			P problem = factory.newProblem();
			System.out.println(problem.toString());
		}
	}
	
	class ProblemSolverComparator<P extends IProblem> {
		
		IProblemFactory<P> factory;
		IProblemSolver<P> solver1, solver2;
		IResultComparator comparator;
		
		ProblemSolverComparator(IProblemFactory<P> factory, IProblemSolver<P> solver1, IProblemSolver<P> solver2, IResultComparator comparator) {
			this.factory = factory;
			this.solver1 = solver1;
			this.solver2 = solver2;
			this.comparator = comparator;
		}
		
		void compare() throws IOException {
			ProblemReader reader = null;
			try {
				reader = new ProblemReader();
				P problem = factory.newProblem(reader);
				String res1 = solver1.solve(problem);
				String res2 = solver2.solve(problem);
				if (comparator.same(res1, res2)) {
					System.out.println(res1);
				} else {
					System.err.println(res1 + " " + res2);
				}
			} finally {
				if (reader != null) {
					reader.close();
				}
			}
		}
	}
	
	class ProblemAnswerer<P extends IProblem> {
		
		IProblemFactory<P> factory;
		IProblemSolver<P> solver;
		
		ProblemAnswerer(IProblemFactory<P> factory, IProblemSolver<P> solver) {
			this.factory = factory;
			this.solver = solver;
		}
		
		void answer() throws IOException {
			ProblemReader reader = null;
			try {
				reader = new ProblemReader();
				P problem = factory.newProblem(reader);
				String res = solver.solve(problem);
				System.out.println(res);
			} finally {
				if (reader != null) {
					reader.close();
				}
			}
		}
	}
	
	class ProblemProcessorConfig<P extends IProblem> {
		
		IProblemFactory<P> factory;
		
		IProblemSolver<P> solver, solver2;
		
		IResultComparator comparator;
	}
	
	class ProblemProcessor<P extends IProblem> {
		
		ProblemProcessorConfig<P> config;
		
		ProblemCreator<P> creator;
		ProblemSolverComparator<P> comparator;
		ProblemAnswerer<P> answerer;
		
		ProblemProcessor(ProblemProcessorConfig<P> config) {
			this.config = config;
			creator = new ProblemCreator<P>(config.factory);
			comparator = new ProblemSolverComparator<P>(config.factory, config.solver, config.solver2, config.comparator);
			answerer = new ProblemAnswerer<P>(config.factory, config.solver);
		}
		
		void process(String mode) throws IOException {
			switch (mode) {
			case "create":
				creator.create();
				break;
			case "debug":
				comparator.compare();
				break;
			case "solve":
				answerer.answer();
				break;
			}
		}
	}
	
	static class StringUtils {
		
		static String toString(int a) {
			return String.valueOf(a);
		}
		
		static String toString(long a) {
			return String.valueOf(a);
		}
		
		static String toString(double a) {
			return String.valueOf(a);
		}
		
		static String toString(String str) {
			return str;
		}
		
		static String toString(int[] a, String delimiter) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				if (i < a.length - 1) {
					sb.append(a[i] + delimiter);
				} else {
					sb.append(a[i]);
				}
			}
			return sb.toString();
		}
		
		static String toString(long[] a, String delimiter) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				if (i < a.length - 1) {
					sb.append(a[i] + delimiter);
				} else {
					sb.append(a[i]);
				}
			}
			return sb.toString();
		}
		
		static String toString(double[] a, String delimiter) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				if (i < a.length - 1) {
					sb.append(a[i] + delimiter);
				} else {
					sb.append(a[i]);
				}
			}
			return sb.toString();
		}
		
		static String toString(String[] strs, String delimiter) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < strs.length; i++) {
				if (i < strs.length - 1) {
					sb.append(strs[i] + delimiter);
				} else {
					sb.append(strs[i]);
				}
			}
			return sb.toString();
		}
		
		static String toString(int[][] a) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				for (int j = 0; j < a[i].length; j++) {
					if (j < a[i].length - 1) {
						sb.append(a[i][j] + " ");
					} else {
						sb.append(a[i][j]);
					}
				}
				sb.append("\n");
			}
			sb.setLength(sb.length() - 1);
			return sb.toString();
		}
		
		static String toString(long[][] a) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				for (int j = 0; j < a[i].length; j++) {
					if (j < a[i].length - 1) {
						sb.append(a[i][j] + " ");
					} else {
						sb.append(a[i][j]);
					}
				}
				sb.append("\n");
			}
			sb.setLength(sb.length() - 1);
			return sb.toString();
		}
		
		static String toString(double[][] a) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				for (int j = 0; j < a[i].length; j++) {
					if (j < a[i].length - 1) {
						sb.append(a[i][j] + " ");
					} else {
						sb.append(a[i][j]);
					}
				}
				sb.append("\n");
			}
			sb.setLength(sb.length() - 1);
			return sb.toString();
		}
		
		static String toString(String[][] a) {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < a.length; i++) {
				for (int j = 0; j < a[i].length; j++) {
					if (j < a[i].length - 1) {
						sb.append(a[i][j] + " ");
					} else {
						sb.append(a[i][j]);
					}
				}
				sb.append("\n");
			}
			sb.setLength(sb.length() - 1);
			return sb.toString();
		}
		
		static int toInt(String s) {
			return Integer.parseInt(s);
		}
		
		static long toLong(String s) {
			return Long.parseLong(s);
		}
		
		static double toDouble(String s) {
			return Double.parseDouble(s);
		}
		
		static int[] toIntArray(String s) {
			String[] tokens = s.split(" ");
			int[] a = new int[tokens.length];
			for (int i = 0; i < tokens.length; i++) {
				a[i] = Integer.parseInt(tokens[i]);
			}
			return a;
		}
		
		static long[] toLongArray(String s) {
			String[] tokens = s.split(" ");
			long[] a = new long[tokens.length];
			for (int i = 0; i < tokens.length; i++) {
				a[i] = Long.parseLong(tokens[i]);
			}
			return a;
		}
		
		static double[] toDoubleArray(String s) {
			String[] tokens = s.split(" ");
			double[] a = new double[tokens.length];
			for (int i = 0; i < tokens.length; i++) {
				a[i] = Double.parseDouble(tokens[i]);
			}
			return a;
		}
		
		static String[] toStringArray(String s) {
			return s.split(" ");
		}
	}
}
0