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

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	uwi
提出日時	2020-10-09 22:07:02
言語	Java21 (openjdk 21)
結果	AC
実行時間	329 ms / 2,000 ms
コード長	4,895 bytes
コンパイル時間	5,685 ms
コンパイル使用メモリ	82,692 KB
実行使用メモリ	52,812 KB
最終ジャッジ日時	2024-07-20 11:39:06
合計ジャッジ時間	26,665 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	61 ms 37,312 KB
testcase_01	AC	59 ms 37,844 KB
testcase_02	AC	61 ms 37,592 KB
testcase_03	AC	58 ms 37,424 KB
testcase_04	AC	62 ms 37,964 KB
testcase_05	AC	62 ms 37,820 KB
testcase_06	AC	61 ms 37,896 KB
testcase_07	AC	61 ms 37,744 KB
testcase_08	AC	61 ms 37,676 KB
testcase_09	AC	61 ms 37,820 KB
testcase_10	AC	59 ms 37,428 KB
testcase_11	AC	59 ms 36,980 KB
testcase_12	AC	59 ms 37,660 KB
testcase_13	AC	61 ms 37,596 KB
testcase_14	AC	58 ms 37,844 KB
testcase_15	AC	65 ms 37,852 KB
testcase_16	AC	65 ms 37,872 KB
testcase_17	AC	59 ms 37,392 KB
testcase_18	AC	59 ms 37,540 KB
testcase_19	AC	59 ms 37,324 KB
testcase_20	AC	62 ms 36,820 KB
testcase_21	AC	60 ms 37,716 KB
testcase_22	AC	63 ms 37,864 KB
testcase_23	AC	59 ms 37,552 KB
testcase_24	AC	70 ms 37,616 KB
testcase_25	AC	61 ms 37,336 KB
testcase_26	AC	64 ms 37,448 KB
testcase_27	AC	58 ms 36,804 KB
testcase_28	AC	61 ms 37,464 KB
testcase_29	AC	68 ms 37,496 KB
testcase_30	AC	58 ms 37,360 KB
testcase_31	AC	62 ms 37,828 KB
testcase_32	AC	61 ms 37,524 KB
testcase_33	AC	65 ms 37,468 KB
testcase_34	AC	59 ms 37,596 KB
testcase_35	AC	58 ms 37,400 KB
testcase_36	AC	61 ms 37,648 KB
testcase_37	AC	67 ms 37,664 KB
testcase_38	AC	67 ms 37,472 KB
testcase_39	AC	69 ms 37,724 KB
testcase_40	AC	63 ms 37,516 KB
testcase_41	AC	59 ms 37,800 KB
testcase_42	AC	59 ms 37,688 KB
testcase_43	AC	63 ms 37,792 KB
testcase_44	AC	60 ms 37,864 KB
testcase_45	AC	61 ms 37,676 KB
testcase_46	AC	72 ms 37,720 KB
testcase_47	AC	59 ms 37,480 KB
testcase_48	AC	61 ms 37,376 KB
testcase_49	AC	59 ms 37,696 KB
testcase_50	AC	71 ms 37,900 KB
testcase_51	AC	68 ms 37,968 KB
testcase_52	AC	66 ms 37,908 KB
testcase_53	AC	71 ms 37,760 KB
testcase_54	AC	65 ms 38,108 KB
testcase_55	AC	68 ms 37,856 KB
testcase_56	AC	63 ms 37,468 KB
testcase_57	AC	71 ms 37,756 KB
testcase_58	AC	62 ms 37,476 KB
testcase_59	AC	61 ms 37,788 KB
testcase_60	AC	63 ms 37,468 KB
testcase_61	AC	63 ms 37,352 KB
testcase_62	AC	64 ms 37,844 KB
testcase_63	AC	88 ms 38,820 KB
testcase_64	AC	69 ms 37,984 KB
testcase_65	AC	80 ms 38,320 KB
testcase_66	AC	76 ms 38,180 KB
testcase_67	AC	66 ms 38,120 KB
testcase_68	AC	77 ms 37,996 KB
testcase_69	AC	79 ms 38,412 KB
testcase_70	AC	80 ms 38,016 KB
testcase_71	AC	68 ms 37,824 KB
testcase_72	AC	79 ms 38,336 KB
testcase_73	AC	71 ms 38,100 KB
testcase_74	AC	80 ms 38,108 KB
testcase_75	AC	80 ms 38,172 KB
testcase_76	AC	66 ms 37,808 KB
testcase_77	AC	74 ms 37,736 KB
testcase_78	AC	85 ms 38,692 KB
testcase_79	AC	86 ms 38,904 KB
testcase_80	AC	84 ms 38,888 KB
testcase_81	AC	85 ms 38,912 KB
testcase_82	AC	82 ms 38,748 KB
testcase_83	AC	226 ms 47,168 KB
testcase_84	AC	235 ms 47,968 KB
testcase_85	AC	163 ms 46,588 KB
testcase_86	AC	224 ms 47,020 KB
testcase_87	AC	224 ms 47,724 KB
testcase_88	AC	106 ms 40,316 KB
testcase_89	AC	226 ms 47,324 KB
testcase_90	AC	160 ms 47,108 KB
testcase_91	AC	158 ms 46,772 KB
testcase_92	AC	122 ms 41,212 KB
testcase_93	AC	213 ms 47,528 KB
testcase_94	AC	206 ms 46,920 KB
testcase_95	AC	203 ms 46,808 KB
testcase_96	AC	226 ms 47,788 KB
testcase_97	AC	142 ms 43,004 KB
testcase_98	AC	234 ms 47,808 KB
testcase_99	AC	164 ms 46,616 KB
testcase_100	AC	225 ms 47,920 KB
testcase_101	AC	127 ms 41,052 KB
testcase_102	AC	99 ms 39,984 KB
testcase_103	AC	122 ms 41,292 KB
testcase_104	AC	139 ms 41,820 KB
testcase_105	AC	212 ms 47,412 KB
testcase_106	AC	142 ms 43,352 KB
testcase_107	AC	239 ms 48,012 KB
testcase_108	AC	236 ms 47,948 KB
testcase_109	AC	217 ms 46,700 KB
testcase_110	AC	207 ms 47,160 KB
testcase_111	AC	219 ms 47,180 KB
testcase_112	AC	138 ms 42,508 KB
testcase_113	AC	187 ms 46,856 KB
testcase_114	AC	151 ms 43,584 KB
testcase_115	AC	105 ms 40,128 KB
testcase_116	AC	140 ms 45,660 KB
testcase_117	AC	127 ms 41,832 KB
testcase_118	AC	222 ms 47,760 KB
testcase_119	AC	160 ms 46,504 KB
testcase_120	AC	217 ms 46,800 KB
testcase_121	AC	119 ms 41,540 KB
testcase_122	AC	158 ms 45,408 KB
testcase_123	AC	57 ms 37,600 KB
testcase_124	AC	329 ms 52,812 KB
testcase_125	AC	287 ms 51,016 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.*;

public class F2 {
	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[] par = split(g)[0];
		List<Integer> ret = new ArrayList<>();
		for(int i = 0;i < m;i++){
			if(par[from[i]] == -1 && par[to[i]] == -1)ret.add(i+1);
		}
		out.println(ret.size());
		for(int v : ret){
			out.print(v + " ");
		}
		out.println();
	}

	public static int[][] split(int[][] g)
	{
		int n = g.length;
		int[] deg = new int[n];
		int[] par = new int[n];
		Arrays.fill(par, -1);
		for(int i = 0;i < n;i++){
			deg[i] = g[i].length;
		}
		Queue<Integer> q = new ArrayDeque<Integer>();
		for(int i = 0;i < n;i++){
			if(deg[i] == 1){
				q.add(i);
			}
		}
		while(!q.isEmpty()){
			int cur = q.poll();
			deg[cur] = -9999999;
			for(int e : g[cur]){
				deg[e]--;
				if(deg[e] >= 0){
					par[cur] = e;
				}
				if(deg[e] >= 0 && deg[e] <= 1){
					q.add(e);
				}
			}
		}
		boolean[] ved = new boolean[n];
		int[] next = new int[n];
		Arrays.fill(next, -1);
		for(int i = 0;i < n;i++){
			if(!ved[i] && deg[i] == 2){
				ved[i] = true;
				int cur = i;
				outer:
				while(true){
					for(int e : g[cur]){
						if(deg[e] == 2 && !ved[e]){
							next[cur] = e;
							ved[e] = true;
							cur = e;
							continue outer;
						}
					}
					next[cur] = i;
					break;
				}
			}
		}

		return new int[][]{par, next};
	}

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

	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 F2().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

結果

テストケース

ソースコード