#686422 (Java21) No.1640 簡単な色塗り

提出ソース

結果

問題	No.1640 簡単な色塗り
ユーザー	uwi
提出日時	2021-08-06 21:48:51
言語	Java21 (openjdk 21)
結果	AC
実行時間	267 ms / 2,000 ms
コード長	14,569 bytes
コンパイル時間	4,918 ms
コンパイル使用メモリ	87,516 KB
実行使用メモリ	61,760 KB
最終ジャッジ日時	2023-09-12 01:48:56
合計ジャッジ時間	21,989 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	76 ms 51,276 KB
testcase_01	AC	77 ms 51,116 KB
testcase_02	AC	79 ms 51,112 KB
testcase_03	AC	80 ms 51,200 KB
testcase_04	AC	200 ms 56,780 KB
testcase_05	AC	207 ms 61,760 KB
testcase_06	AC	77 ms 51,456 KB
testcase_07	AC	77 ms 50,972 KB
testcase_08	AC	78 ms 51,068 KB
testcase_09	AC	77 ms 51,004 KB
testcase_10	AC	228 ms 59,860 KB
testcase_11	AC	201 ms 57,252 KB
testcase_12	AC	189 ms 55,796 KB
testcase_13	AC	233 ms 59,648 KB
testcase_14	AC	267 ms 59,180 KB
testcase_15	AC	177 ms 56,268 KB
testcase_16	AC	184 ms 56,836 KB
testcase_17	AC	209 ms 59,640 KB
testcase_18	AC	105 ms 50,920 KB
testcase_19	AC	192 ms 57,028 KB
testcase_20	AC	194 ms 59,376 KB
testcase_21	AC	202 ms 56,952 KB
testcase_22	AC	95 ms 52,740 KB
testcase_23	AC	202 ms 59,732 KB
testcase_24	AC	137 ms 53,596 KB
testcase_25	AC	181 ms 55,500 KB
testcase_26	AC	198 ms 59,588 KB
testcase_27	AC	171 ms 56,144 KB
testcase_28	AC	212 ms 59,576 KB
testcase_29	AC	239 ms 59,136 KB
testcase_30	AC	102 ms 53,172 KB
testcase_31	AC	138 ms 55,104 KB
testcase_32	AC	138 ms 55,708 KB
testcase_33	AC	127 ms 55,344 KB
testcase_34	AC	143 ms 56,200 KB
testcase_35	AC	131 ms 55,724 KB
testcase_36	AC	103 ms 52,888 KB
testcase_37	AC	108 ms 53,360 KB
testcase_38	AC	135 ms 55,084 KB
testcase_39	AC	125 ms 53,652 KB
testcase_40	AC	116 ms 53,052 KB
testcase_41	AC	144 ms 56,048 KB
testcase_42	AC	114 ms 53,544 KB
testcase_43	AC	125 ms 53,324 KB
testcase_44	AC	115 ms 53,460 KB
testcase_45	AC	118 ms 53,440 KB
testcase_46	AC	104 ms 52,932 KB
testcase_47	AC	100 ms 52,860 KB
testcase_48	AC	137 ms 55,452 KB
testcase_49	AC	86 ms 51,336 KB
testcase_50	AC	79 ms 51,040 KB
testcase_51	AC	78 ms 51,160 KB
testcase_52	AC	238 ms 61,300 KB
testcase_53	AC	257 ms 61,624 KB
07_evil_01.txt	AC	389 ms 67,616 KB
07_evil_02.txt	AC	479 ms 78,476 KB

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

ソースコード

raw source code

package contest210806;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class E {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve() {
		int n = ni();
		int[] from = new int[n];
		int[] to = new int[n];
		for (int i = 0; i < n; i++) {
			from[i] = ni() - 1;
			to[i] = ni() - 1;
		}
		boolean[] isspe = new boolean[n];
		DJSet ds = new DJSet(n);
		int[] ff = new int[n];
		int[] ft = new int[n];
		int[] speto = new int[n];
		Arrays.fill(speto, -1);
		int p = 0;
		for(int i = 0;i < n;i++){
			if(!ds.union(from[i], to[i])){
				ff[p] = from[i];
				ft[p] = to[i];
				p++;
			}else{
				if(speto[from[i]] != -1){
					out.println("No");
					return;
				}
				isspe[i] = true;
				speto[from[i]] = to[i];
			}
		}
		int[] hasc = new int[n];
		for(int i = 0;i < n;i++){
			if(speto[i] != -1){
				hasc[ds.root(i)]++;
			}
		}
		for(int i = 0;i < n;i++){
			if(ds.upper[i] < 0 && hasc[i] != 1){
				out.println("No");
				return;
			}
		}

		int[][] g = packU(n, ff, ft, p);
		int[][] pars = parents(g, from, isspe);

		int[] par = pars[0];
		out.println("Yes");
		int[] ord = pars[1];
		int[] iord = new int[n];
		for(int i = 0;i < n;i++){
			iord[ord[i]] = i;
		}
		for(int i = 0;i < n;i++){
			if(!isspe[i]){
				if(par[from[i]] == to[i]){
					out.println(from[i]+1);
				}else{
					out.println(to[i]+1);
				}
			}else{
				if(iord[from[i]] < iord[to[i]]){
					out.println(from[i]+1);
				}else{
					out.println(to[i]+1);
				}
			}
		}
	}

	public static int[][] parents(int[][] g, int[] from, boolean[] isspe)
	{
		int n = g.length;
		int[] par = new int[n];
		Arrays.fill(par, -1);

		int[] q = new int[n];
		int r = 0;
		for(int u = 0;u < n;u++){
			if(isspe[u])q[r++] = from[u];
		}

		for(int p = 0;p < r;p++){
			int cur = q[p];
			for(int nex : g[cur]){
				if(par[cur] != nex){
					q[r++] = nex;
					par[nex] = cur;
				}
			}
		}
		return new int[][] {par, q};
	}

	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 class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper) if (u < 0) ct++;
			return ct;
		}

		public int[][] toBucket() {
			int n = upper.length;
			int[][] ret = new int[n][];
			int[] rp = new int[n];
			for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];
			for (int i = 0; i < n; i++) {
				int r = root(i);
				ret[r][rp[r]++] = i;
			}
			return ret;
		}
	}


	public static void main(String[] args) {
		new E().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-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();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 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[] 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 int ni()
	{
		int num = 0, 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 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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){ return write(c).writeln(); }
		public FastWriter writeln(int x){ return write(x).writeln(); }
		public FastWriter writeln(long x){ return write(x).writeln(); }
		public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(x));
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs) { return write(xs).writeln(); }
		public FastWriter writeln(long... xs) { return write(xs).writeln(); }
		public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(char[] line) { return write(line).writeln(); }
		public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
		public FastWriter writeln(String s) { return write(s).writeln(); }

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード