結果

問題 No.241 出席番号(1)
ユーザー threepipes_sthreepipes_s
提出日時 2015-07-10 23:01:04
言語 Java21
(openjdk 21)
結果
AC  
実行時間 91 ms / 2,000 ms
コード長 4,349 bytes
コンパイル時間 2,536 ms
コンパイル使用メモリ 79,940 KB
実行使用メモリ 38,692 KB
最終ジャッジ日時 2024-11-30 21:24:01
合計ジャッジ時間 6,082 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,284 KB
testcase_01 AC 54 ms
37,008 KB
testcase_02 AC 56 ms
37,012 KB
testcase_03 AC 53 ms
37,212 KB
testcase_04 AC 60 ms
37,352 KB
testcase_05 AC 53 ms
37,096 KB
testcase_06 AC 53 ms
36,968 KB
testcase_07 AC 53 ms
36,888 KB
testcase_08 AC 54 ms
36,664 KB
testcase_09 AC 54 ms
36,956 KB
testcase_10 AC 55 ms
37,200 KB
testcase_11 AC 53 ms
37,224 KB
testcase_12 AC 53 ms
37,008 KB
testcase_13 AC 56 ms
37,188 KB
testcase_14 AC 82 ms
38,136 KB
testcase_15 AC 72 ms
37,816 KB
testcase_16 AC 54 ms
37,212 KB
testcase_17 AC 53 ms
37,224 KB
testcase_18 AC 53 ms
37,084 KB
testcase_19 AC 54 ms
37,200 KB
testcase_20 AC 54 ms
37,184 KB
testcase_21 AC 54 ms
37,216 KB
testcase_22 AC 55 ms
37,212 KB
testcase_23 AC 60 ms
37,108 KB
testcase_24 AC 83 ms
38,196 KB
testcase_25 AC 81 ms
38,592 KB
testcase_26 AC 84 ms
38,600 KB
testcase_27 AC 81 ms
37,876 KB
testcase_28 AC 84 ms
38,648 KB
testcase_29 AC 86 ms
38,376 KB
testcase_30 AC 91 ms
38,464 KB
testcase_31 AC 88 ms
38,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.Comparator;
import java.util.HashSet;

public class Main {
	static HashSet<String> set = new HashSet<String>();
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		Solve solve = new Solve();
		solve.solve();
	}
}
class Solve{
	ContestScanner in;
	Solve() throws FileNotFoundException{
		in = new ContestScanner();
	}
	
	final static int[] dx = {-2, -2, -1, -1, 1, 1, 2, 2};
	final static int[] dy = {-1, 1, -2, 2, -2, 2, -1, 1};
	int s, t;
	int[][] cap;
	void solve() throws IOException{
		int n = in.nextInt();
		Node[] node = new Node[n*2+2];
		int size = n*2+2;
		for(int i=0; i<size; i++){
			node[i] = new Node(i);
		}
		cap = new int[size][size];
		for(int i=0; i<n; i++){
			node[n*2].createEdge(node[i]);
			node[i].createEdge(node[n*2]);
			cap[n*2][i] = 1;
		}
		s = n*2;
		t = n*2+1;
		for(int i=n; i<n*2; i++){
			node[t].createEdge(node[i]);
			node[i].createEdge(node[t]);
			cap[i][t] = 1;
		}
		for(int i=0; i<n; i++){
			int a = in.nextInt();
			for(int j=n; j<n*2; j++){
				int id = j-n;
				if(id == a) continue;
				node[i].createEdge(node[j]);
				node[j].createEdge(node[i]);
				cap[i][j] = 1;
			}
		}
		used = new BitSet(size);
		int res = 0;
		while(true){
			used.clear();
			int flow = flow(node[s], 1);
			if(flow == 0) break;
			res += flow;
		}
		if(res != n){
			System.out.println(-1);
			return;
		}
		for(int i=0; i<n; i++){
			for(int j=n; j<n*2; j++){
				if(cap[j][i] == 1){
					System.out.println(j-n);
					break;
				}
			}
		}
	}
	
	BitSet used;
	int flow(Node from, int flow){
		if(from.id == t) return flow;
		if(used.get(from.id)) return 0;
		used.set(from.id);
		for(Node v: from.edge){
			if(cap[from.id][v.id] == 0) continue;
			int f = flow(v, Math.min(flow, cap[from.id][v.id]));
			if(f == 0) continue;
			cap[from.id][v.id] -= f;
			cap[v.id][from.id] += f;
			return f;
		}
		return 0;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

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

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

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


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	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