結果

問題 No.1254 補強への架け橋
ユーザー uwiuwi
提出日時 2020-10-09 21:51:33
言語 Java19
(openjdk 21)
結果
AC  
実行時間 347 ms / 2,000 ms
コード長 5,425 bytes
コンパイル時間 4,685 ms
コンパイル使用メモリ 87,432 KB
実行使用メモリ 61,328 KB
最終ジャッジ日時 2023-09-27 16:29:46
合計ジャッジ時間 25,314 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,964 KB
testcase_01 AC 56 ms
50,592 KB
testcase_02 AC 57 ms
50,628 KB
testcase_03 AC 58 ms
50,544 KB
testcase_04 AC 56 ms
50,448 KB
testcase_05 AC 55 ms
51,140 KB
testcase_06 AC 55 ms
48,652 KB
testcase_07 AC 57 ms
50,740 KB
testcase_08 AC 57 ms
50,548 KB
testcase_09 AC 56 ms
50,512 KB
testcase_10 AC 57 ms
50,916 KB
testcase_11 AC 58 ms
50,420 KB
testcase_12 AC 58 ms
52,756 KB
testcase_13 AC 57 ms
50,760 KB
testcase_14 AC 59 ms
50,752 KB
testcase_15 AC 57 ms
50,468 KB
testcase_16 AC 57 ms
50,604 KB
testcase_17 AC 56 ms
50,556 KB
testcase_18 AC 59 ms
50,804 KB
testcase_19 AC 58 ms
50,564 KB
testcase_20 AC 58 ms
48,732 KB
testcase_21 AC 57 ms
50,452 KB
testcase_22 AC 56 ms
50,660 KB
testcase_23 AC 56 ms
50,716 KB
testcase_24 AC 56 ms
50,560 KB
testcase_25 AC 56 ms
50,692 KB
testcase_26 AC 57 ms
50,844 KB
testcase_27 AC 57 ms
50,532 KB
testcase_28 AC 57 ms
50,772 KB
testcase_29 AC 57 ms
50,428 KB
testcase_30 AC 57 ms
50,956 KB
testcase_31 AC 54 ms
50,636 KB
testcase_32 AC 56 ms
50,548 KB
testcase_33 AC 56 ms
50,756 KB
testcase_34 AC 56 ms
50,544 KB
testcase_35 AC 56 ms
50,840 KB
testcase_36 AC 55 ms
50,716 KB
testcase_37 AC 56 ms
50,640 KB
testcase_38 AC 57 ms
50,676 KB
testcase_39 AC 58 ms
50,548 KB
testcase_40 AC 57 ms
50,536 KB
testcase_41 AC 55 ms
50,696 KB
testcase_42 AC 55 ms
50,440 KB
testcase_43 AC 57 ms
50,572 KB
testcase_44 AC 59 ms
50,636 KB
testcase_45 AC 58 ms
50,832 KB
testcase_46 AC 59 ms
50,564 KB
testcase_47 AC 57 ms
50,908 KB
testcase_48 AC 60 ms
50,776 KB
testcase_49 AC 58 ms
50,816 KB
testcase_50 AC 60 ms
50,748 KB
testcase_51 AC 57 ms
50,688 KB
testcase_52 AC 59 ms
50,472 KB
testcase_53 AC 59 ms
50,636 KB
testcase_54 AC 57 ms
50,480 KB
testcase_55 AC 60 ms
50,344 KB
testcase_56 AC 57 ms
50,468 KB
testcase_57 AC 58 ms
50,632 KB
testcase_58 AC 60 ms
50,460 KB
testcase_59 AC 57 ms
50,648 KB
testcase_60 AC 58 ms
50,764 KB
testcase_61 AC 58 ms
50,940 KB
testcase_62 AC 57 ms
50,608 KB
testcase_63 AC 87 ms
52,588 KB
testcase_64 AC 63 ms
50,464 KB
testcase_65 AC 71 ms
50,676 KB
testcase_66 AC 67 ms
50,464 KB
testcase_67 AC 63 ms
50,488 KB
testcase_68 AC 69 ms
50,748 KB
testcase_69 AC 71 ms
50,440 KB
testcase_70 AC 64 ms
50,552 KB
testcase_71 AC 61 ms
50,516 KB
testcase_72 AC 71 ms
50,452 KB
testcase_73 AC 64 ms
50,644 KB
testcase_74 AC 71 ms
50,628 KB
testcase_75 AC 70 ms
50,456 KB
testcase_76 AC 61 ms
50,340 KB
testcase_77 AC 68 ms
50,572 KB
testcase_78 AC 76 ms
50,692 KB
testcase_79 AC 82 ms
51,700 KB
testcase_80 AC 74 ms
50,856 KB
testcase_81 AC 79 ms
51,992 KB
testcase_82 AC 77 ms
52,256 KB
testcase_83 AC 219 ms
57,984 KB
testcase_84 AC 221 ms
58,144 KB
testcase_85 AC 154 ms
58,832 KB
testcase_86 AC 206 ms
56,040 KB
testcase_87 AC 227 ms
59,808 KB
testcase_88 AC 92 ms
52,492 KB
testcase_89 AC 219 ms
58,180 KB
testcase_90 AC 144 ms
57,936 KB
testcase_91 AC 126 ms
55,756 KB
testcase_92 AC 112 ms
55,008 KB
testcase_93 AC 198 ms
58,172 KB
testcase_94 AC 181 ms
58,380 KB
testcase_95 AC 177 ms
58,192 KB
testcase_96 AC 204 ms
58,468 KB
testcase_97 AC 140 ms
56,560 KB
testcase_98 AC 228 ms
58,320 KB
testcase_99 AC 154 ms
58,668 KB
testcase_100 AC 223 ms
58,560 KB
testcase_101 AC 109 ms
55,240 KB
testcase_102 AC 88 ms
52,536 KB
testcase_103 AC 103 ms
55,328 KB
testcase_104 AC 122 ms
56,812 KB
testcase_105 AC 218 ms
58,264 KB
testcase_106 AC 131 ms
56,028 KB
testcase_107 AC 224 ms
60,304 KB
testcase_108 AC 228 ms
58,272 KB
testcase_109 AC 188 ms
58,028 KB
testcase_110 AC 192 ms
58,180 KB
testcase_111 AC 196 ms
58,112 KB
testcase_112 AC 119 ms
55,572 KB
testcase_113 AC 216 ms
59,524 KB
testcase_114 AC 129 ms
55,840 KB
testcase_115 AC 99 ms
53,420 KB
testcase_116 AC 131 ms
58,168 KB
testcase_117 AC 122 ms
55,772 KB
testcase_118 AC 226 ms
57,868 KB
testcase_119 AC 157 ms
59,280 KB
testcase_120 AC 217 ms
59,756 KB
testcase_121 AC 115 ms
56,016 KB
testcase_122 AC 129 ms
55,716 KB
testcase_123 AC 56 ms
50,700 KB
testcase_124 AC 334 ms
61,036 KB
testcase_125 AC 347 ms
61,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest201009;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int m = n;
		int[] from = new int[m];
		int[] to = new int[m];
		for(int i = 0;i < m;i++){
		    from[i] = ni()-1;
		    to[i] = ni()-1;
		}
		int[][] g = packU(n, from, to);
		int[] clus = decomposeToBECCNoRec(g);
		List<Integer> ret = new ArrayList<>();
		for(int i = 0;i < m;i++){
			if(clus[from[i]] == clus[to[i]])ret.add(i+1);
		}
		out.println(ret.size());
		for(int v : ret){
			out.print(v + " ");
		}
		out.println();
	}

	public static int[][] packU(int n, int[] from, int[] to) {
		return packU(n, from, to, from.length);
	}

	public static int[][] packU(int n, int[] from, int[] to, int sup) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int i = 0; i < sup; i++) p[from[i]]++;
		for (int i = 0; i < sup; i++) p[to[i]]++;
		for (int i = 0; i < n; i++) g[i] = new int[p[i]];
		for (int i = 0; i < sup; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}


	public static int[] decomposeToBECCNoRec(int[][] g)
	{
		int n = g.length;
		boolean[] visited = new boolean[n];
		int[] ord = new int[n];
		int[] low = new int[n];

		int[] ids = new int[n];
		int[] inds = new int[n];
		int[] parct = new int[n];
		int pos = 0;
		for(int i = 0;i < n;i++){
			if(!visited[i]){
				ids[0] = i;
				inds[0] = 0;
				int sp = 1;
				while(sp > 0){
					int cur = ids[sp-1];
					if(inds[sp-1] == 0){
						visited[cur] = true;
						ord[cur] = low[cur] = pos++;
						parct[sp-1] = 0;
					}
					if(inds[sp-1] == g[cur].length){
						if(sp-2 >= 0)low[ids[sp-2]] = Math.min(low[ids[sp-2]], low[cur]);
						sp--;
						continue;
					}
					int next = g[cur][inds[sp-1]];
					if(!visited[next]){
						ids[sp] = next;
						inds[sp] = 0;
						inds[sp-1]++;
						sp++;
						continue;
					}else if(sp-2 >= 0 && (next != ids[sp-2] || ++parct[sp-1] >= 2)){
						low[cur] = Math.min(low[cur], ord[next]);
					}
					inds[sp-1]++;
				}
			}
		}

		int[] clus = new int[n];
		Arrays.fill(clus, -1);
		int[] q = new int[n];
		int cnum = 0;
		for(int i = 0;i < n;i++){
			if(clus[i] == -1){
				int p = 0;
				q[p++] = i;
				clus[i] = cnum++;
				for(int r = 0;r < p;r++){
					int cur = q[r];
					for(int next : g[cur]){
						if(clus[next] == -1){
							clus[next] = ord[cur] < low[next] ? cnum++ : clus[cur];
							q[p++] = next;
						}
					}
				}
			}
		}
		return clus;
	}


	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new F().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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