結果

問題 No.101 ぐるぐる！あみだくじ！
ユーザー threepipes_sthreepipes_s
提出日時 2014-12-11 23:43:52
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,811 bytes
コンパイル時間 2,329 ms
コンパイル使用メモリ 83,572 KB
実行使用メモリ 61,424 KB
最終ジャッジ日時 2024-06-11 20:47:17
合計ジャッジ時間 25,315 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,940 KB
testcase_01 AC 74 ms
38,180 KB
testcase_02 AC 75 ms
38,280 KB
testcase_03 AC 52 ms
36,816 KB
testcase_04 AC 52 ms
37,096 KB
testcase_05 AC 80 ms
38,448 KB
testcase_06 AC 48 ms
36,908 KB
testcase_07 AC 60 ms
38,352 KB
testcase_08 AC 58 ms
37,564 KB
testcase_09 AC 55 ms
37,440 KB
testcase_10 AC 59 ms
37,432 KB
testcase_11 AC 253 ms
42,652 KB
testcase_12 AC 253 ms
45,544 KB
testcase_13 AC 218 ms
42,900 KB
testcase_14 AC 327 ms
42,568 KB
testcase_15 AC 126 ms
44,136 KB
testcase_16 AC 104 ms
42,748 KB
testcase_17 AC 137 ms
44,808 KB
testcase_18 AC 108 ms
44,864 KB
testcase_19 AC 119 ms
44,776 KB
testcase_20 AC 81 ms
41,832 KB
testcase_21 AC 105 ms
41,196 KB
testcase_22 AC 163 ms
45,028 KB
testcase_23 AC 112 ms
42,888 KB
testcase_24 AC 497 ms
42,592 KB
testcase_25 AC 368 ms
42,700 KB
testcase_26 AC 307 ms
42,784 KB
testcase_27 AC 3,385 ms
42,856 KB
testcase_28 AC 1,892 ms
42,776 KB
testcase_29 AC 1,978 ms
42,752 KB
testcase_30 AC 1,594 ms
42,736 KB
testcase_31 AC 1,560 ms
42,800 KB
testcase_32 AC 1,609 ms
44,820 KB
testcase_33 TLE -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.TreeSet;
public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		int k = in.nextInt();
		int[] a = new int[n];
		for(int i=0; i<n; i++){
			a[i] = i;
		}
		for(int i=0; i<k; i++){
			int x = in.nextInt()-1;
			int y = in.nextInt()-1;
			int tmp = a[x];
			a[x] = a[y];
			a[y] = tmp;
		}
		int count = 1;
		int[] b = new int[n];
		for(int i=0; i<n; i++){
			b[i] = i;
		}
		while(true){
			int[] c = new int[n];
			for(int i=0; i<n; i++){
				c[a[i]] = b[i];
			}
			b = c;
			boolean ok = true;
			for(int i=0; i<n; i++){
				if(b[i] != i){
					ok = false;
					break;
				}
			}
			if(ok) break;
			count++;
		}
		System.out.println(count);
	}
	
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}


class NodeW{
	int id;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class MyMath{
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}
0