#564416 (Java21) No.1254 補強への架け橋

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	uwi
提出日時	2020-10-09 21:51:33
言語	Java21 (openjdk 21)
結果	AC
実行時間	370 ms / 2,000 ms
コード長	5,425 bytes
コンパイル時間	5,397 ms
コンパイル使用メモリ	81,140 KB
実行使用メモリ	51,340 KB
最終ジャッジ日時	2024-07-20 10:45:41
合計ジャッジ時間	25,806 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	66 ms 37,988 KB
testcase_01	AC	59 ms 37,792 KB
testcase_02	AC	56 ms 37,580 KB
testcase_03	AC	56 ms 37,724 KB
testcase_04	AC	59 ms 37,812 KB
testcase_05	AC	58 ms 37,744 KB
testcase_06	AC	67 ms 37,496 KB
testcase_07	AC	56 ms 37,356 KB
testcase_08	AC	59 ms 38,052 KB
testcase_09	AC	59 ms 37,952 KB
testcase_10	AC	61 ms 37,924 KB
testcase_11	AC	56 ms 37,672 KB
testcase_12	AC	56 ms 37,668 KB
testcase_13	AC	57 ms 37,480 KB
testcase_14	AC	57 ms 37,848 KB
testcase_15	AC	56 ms 37,548 KB
testcase_16	AC	57 ms 37,484 KB
testcase_17	AC	58 ms 37,228 KB
testcase_18	AC	57 ms 37,652 KB
testcase_19	AC	59 ms 37,616 KB
testcase_20	AC	60 ms 37,908 KB
testcase_21	AC	60 ms 37,736 KB
testcase_22	AC	57 ms 37,888 KB
testcase_23	AC	59 ms 37,964 KB
testcase_24	AC	68 ms 37,624 KB
testcase_25	AC	63 ms 37,952 KB
testcase_26	AC	65 ms 37,820 KB
testcase_27	AC	65 ms 37,820 KB
testcase_28	AC	59 ms 37,872 KB
testcase_29	AC	60 ms 37,860 KB
testcase_30	AC	64 ms 37,592 KB
testcase_31	AC	64 ms 38,244 KB
testcase_32	AC	62 ms 38,080 KB
testcase_33	AC	64 ms 37,868 KB
testcase_34	AC	62 ms 37,860 KB
testcase_35	AC	65 ms 38,076 KB
testcase_36	AC	60 ms 38,032 KB
testcase_37	AC	66 ms 38,236 KB
testcase_38	AC	60 ms 37,796 KB
testcase_39	AC	64 ms 38,052 KB
testcase_40	AC	63 ms 37,764 KB
testcase_41	AC	65 ms 38,056 KB
testcase_42	AC	70 ms 38,056 KB
testcase_43	AC	69 ms 38,232 KB
testcase_44	AC	64 ms 37,968 KB
testcase_45	AC	64 ms 37,864 KB
testcase_46	AC	61 ms 37,580 KB
testcase_47	AC	62 ms 37,220 KB
testcase_48	AC	65 ms 38,108 KB
testcase_49	AC	73 ms 37,484 KB
testcase_50	AC	68 ms 37,844 KB
testcase_51	AC	66 ms 38,184 KB
testcase_52	AC	68 ms 38,108 KB
testcase_53	AC	67 ms 38,100 KB
testcase_54	AC	61 ms 38,096 KB
testcase_55	AC	61 ms 37,852 KB
testcase_56	AC	67 ms 38,164 KB
testcase_57	AC	67 ms 38,308 KB
testcase_58	AC	62 ms 38,124 KB
testcase_59	AC	59 ms 38,016 KB
testcase_60	AC	60 ms 38,008 KB
testcase_61	AC	66 ms 37,988 KB
testcase_62	AC	59 ms 37,476 KB
testcase_63	AC	86 ms 38,832 KB
testcase_64	AC	70 ms 37,864 KB
testcase_65	AC	80 ms 38,696 KB
testcase_66	AC	78 ms 38,124 KB
testcase_67	AC	71 ms 37,736 KB
testcase_68	AC	77 ms 38,492 KB
testcase_69	AC	77 ms 38,116 KB
testcase_70	AC	71 ms 38,328 KB
testcase_71	AC	70 ms 37,868 KB
testcase_72	AC	80 ms 38,388 KB
testcase_73	AC	75 ms 38,092 KB
testcase_74	AC	80 ms 38,488 KB
testcase_75	AC	77 ms 38,200 KB
testcase_76	AC	66 ms 38,108 KB
testcase_77	AC	74 ms 38,416 KB
testcase_78	AC	81 ms 39,020 KB
testcase_79	AC	82 ms 38,756 KB
testcase_80	AC	81 ms 38,876 KB
testcase_81	AC	83 ms 38,772 KB
testcase_82	AC	81 ms 38,724 KB
testcase_83	AC	218 ms 47,336 KB
testcase_84	AC	227 ms 47,248 KB
testcase_85	AC	171 ms 46,712 KB
testcase_86	AC	244 ms 46,712 KB
testcase_87	AC	206 ms 48,108 KB
testcase_88	AC	103 ms 40,576 KB
testcase_89	AC	257 ms 49,188 KB
testcase_90	AC	170 ms 46,488 KB
testcase_91	AC	153 ms 44,108 KB
testcase_92	AC	112 ms 41,376 KB
testcase_93	AC	231 ms 47,224 KB
testcase_94	AC	207 ms 47,080 KB
testcase_95	AC	231 ms 47,908 KB
testcase_96	AC	245 ms 47,332 KB
testcase_97	AC	154 ms 43,444 KB
testcase_98	AC	242 ms 48,364 KB
testcase_99	AC	160 ms 46,368 KB
testcase_100	AC	245 ms 47,712 KB
testcase_101	AC	115 ms 41,256 KB
testcase_102	AC	97 ms 40,332 KB
testcase_103	AC	113 ms 41,300 KB
testcase_104	AC	139 ms 42,440 KB
testcase_105	AC	231 ms 46,904 KB
testcase_106	AC	167 ms 43,560 KB
testcase_107	AC	228 ms 47,556 KB
testcase_108	AC	237 ms 47,508 KB
testcase_109	AC	220 ms 47,036 KB
testcase_110	AC	195 ms 46,844 KB
testcase_111	AC	224 ms 47,496 KB
testcase_112	AC	122 ms 41,712 KB
testcase_113	AC	220 ms 47,556 KB
testcase_114	AC	156 ms 43,680 KB
testcase_115	AC	118 ms 40,568 KB
testcase_116	AC	140 ms 43,292 KB
testcase_117	AC	141 ms 42,316 KB
testcase_118	AC	221 ms 47,332 KB
testcase_119	AC	169 ms 46,904 KB
testcase_120	AC	231 ms 47,120 KB
testcase_121	AC	110 ms 41,384 KB
testcase_122	AC	141 ms 43,312 KB
testcase_123	AC	64 ms 37,812 KB
testcase_124	AC	370 ms 51,340 KB
testcase_125	AC	370 ms 51,232 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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)); }
}

yukicoder

結果

テストケース

ソースコード