#149255 (Java21) No.483 マッチ並べ

提出ソース

結果

問題	No.483 マッチ並べ
ユーザー	Grenache
提出日時	2017-02-10 23:25:29
言語	Java21 (openjdk 21)
結果	AC
実行時間	58 ms / 2,000 ms
コード長	6,360 bytes
コンパイル時間	4,083 ms
コンパイル使用メモリ	81,024 KB
実行使用メモリ	37,500 KB
最終ジャッジ日時	2024-06-09 07:48:47
合計ジャッジ時間	8,453 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 37,280 KB
testcase_01	AC	53 ms 37,248 KB
testcase_02	AC	53 ms 37,192 KB
testcase_03	AC	52 ms 36,824 KB
testcase_04	AC	53 ms 37,220 KB
testcase_05	AC	53 ms 37,216 KB
testcase_06	AC	54 ms 37,112 KB
testcase_07	AC	54 ms 37,104 KB
testcase_08	AC	54 ms 37,016 KB
testcase_09	AC	54 ms 37,140 KB
testcase_10	AC	53 ms 36,908 KB
testcase_11	AC	50 ms 36,844 KB
testcase_12	AC	51 ms 37,192 KB
testcase_13	AC	52 ms 37,368 KB
testcase_14	AC	53 ms 37,104 KB
testcase_15	AC	52 ms 37,372 KB
testcase_16	AC	53 ms 37,160 KB
testcase_17	AC	55 ms 37,176 KB
testcase_18	AC	55 ms 37,308 KB
testcase_19	AC	56 ms 37,072 KB
testcase_20	AC	52 ms 37,116 KB
testcase_21	AC	51 ms 36,832 KB
testcase_22	AC	55 ms 37,084 KB
testcase_23	AC	53 ms 37,192 KB
testcase_24	AC	51 ms 37,280 KB
testcase_25	AC	53 ms 37,056 KB
testcase_26	AC	55 ms 37,436 KB
testcase_27	AC	57 ms 37,300 KB
testcase_28	AC	58 ms 37,468 KB
testcase_29	AC	56 ms 37,352 KB
testcase_30	AC	55 ms 37,108 KB
testcase_31	AC	56 ms 37,068 KB
testcase_32	AC	55 ms 36,932 KB
testcase_33	AC	57 ms 36,940 KB
testcase_34	AC	53 ms 36,844 KB
testcase_35	AC	53 ms 37,076 KB
testcase_36	AC	55 ms 37,104 KB
testcase_37	AC	53 ms 37,192 KB
testcase_38	AC	55 ms 36,824 KB
testcase_39	AC	56 ms 37,500 KB
testcase_40	AC	55 ms 36,808 KB
testcase_41	AC	53 ms 37,204 KB
testcase_42	AC	57 ms 37,324 KB
testcase_43	AC	56 ms 37,268 KB
testcase_44	AC	55 ms 37,080 KB
testcase_45	AC	53 ms 37,160 KB
testcase_46	AC	53 ms 36,804 KB
testcase_47	AC	54 ms 37,332 KB
testcase_48	AC	55 ms 37,240 KB
testcase_49	AC	54 ms 37,180 KB
testcase_50	AC	57 ms 37,172 KB
testcase_51	AC	55 ms 37,368 KB
testcase_52	AC	55 ms 37,408 KB
testcase_53	AC	54 ms 37,276 KB
testcase_54	AC	55 ms 37,048 KB
testcase_55	AC	54 ms 36,924 KB

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

ソースコード

raw source code

import java.io.*;
import java.util.*;


public class Main_yukicoder483 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		long[] rc0 = new long[n];
		long[] rc1 = new long[n];
		for (int i = 0; i < n; i++) {
			long r0 = sc.nextInt();
			long c0 = sc.nextInt();
			rc0[i] = r0 << 32 | c0;
			long r1 = sc.nextInt();
			long c1 = sc.nextInt();
			rc1[i] = r1 << 32 | c1;
		}

		int V = n * 2;
		SCC scc = new SCC(V);

		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				if (rc0[i] == rc0[j]) {
					scc.add_edge(i + n, j);
					scc.add_edge(j + n, i);
				}
				if (rc1[i] == rc1[j]) {
					scc.add_edge(i, j + n);
					scc.add_edge(j, i + n);
				}
				if (rc0[i] == rc1[j]) {
					scc.add_edge(i + n, j + n);
					scc.add_edge(j, i);
				}
				if (rc1[i] == rc0[j]) {
					scc.add_edge(i, j);
					scc.add_edge(j + n, i + n);
				}
			}
		}

		scc.scc();

		for (int i = 0; i < n; i++) {
			if (scc.cmp[i] == scc.cmp[i + n]) {
				pr.println("NO");
				return;
			}
		}

		pr.println("YES");
	}

	private static class SCC {
		private int V;
		private List<List<Integer>> edges;
		private List<List<Integer>> redges;
		private List<Integer> vs;
		private boolean[] used;
		private int[] cmp;

		private SCC(int V) {
			this.V = V;

			edges = new ArrayList<>();
			redges = new ArrayList<>();
			for (int i = 0; i < V; i++) {
				edges.add(new ArrayList<>());
				redges.add(new ArrayList<>());
			}
			vs = new ArrayList<>();
			used = new boolean[V];
			cmp = new int[V];
		}

		private void add_edge(int from, int to) {
			edges.get(from).add(to);
			redges.get(to).add(from);
		}

		private int scc() {
			// dfs
			for (int v = 0; v < V; v++) {
				if (used[v]) {
					continue;
				}

				Deque<Integer> st = new ArrayDeque<>();
				st.push(v);
				while (!st.isEmpty()) {
					int e = st.peek();

					if (used[e]) {
						st.pop();
					} else {
						for (int next : edges.get(e)) {
							if (used[next]) {
								continue;
							}

							st.push(next);
						}
						used[e] = true;
						vs.add(e);
					}
				}
			}

			Arrays.fill(used, false);

			// rdfs
			int k = 0;
			for (int i = vs.size() - 1; i >= 0; i--) {
				int v = vs.get(i);

				if (used[v]) {
					continue;
				}

				Deque<Integer> st = new ArrayDeque<>();
				st.push(v);
				while (!st.isEmpty()) {
					int e = st.peek();

					if (used[e]) {
						st.pop();
					} else {
						for (int next : redges.get(e)) {
							if (used[next]) {
								continue;
							}

							st.push(next);
						}
						used[e] = true;
						cmp[e] = k;
					}
				}

				k++;
			}

			return k;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}