結果

問題 No.483 マッチ並べ
ユーザー GrenacheGrenache
提出日時 2017-02-10 23:11:56
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,356 bytes
コンパイル時間 5,335 ms
コンパイル使用メモリ 77,576 KB
実行使用メモリ 51,548 KB
最終ジャッジ日時 2023-08-28 12:21:57
合計ジャッジ時間 9,950 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,400 KB
testcase_01 AC 44 ms
49,432 KB
testcase_02 AC 44 ms
49,428 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 44 ms
49,340 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 46 ms
49,664 KB
testcase_12 AC 45 ms
49,460 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 46 ms
49,776 KB
testcase_17 AC 45 ms
49,436 KB
testcase_18 AC 44 ms
49,720 KB
testcase_19 WA -
testcase_20 AC 45 ms
49,384 KB
testcase_21 AC 45 ms
49,392 KB
testcase_22 AC 44 ms
49,924 KB
testcase_23 AC 46 ms
49,848 KB
testcase_24 AC 45 ms
49,336 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 74 ms
51,548 KB
testcase_28 AC 69 ms
51,340 KB
testcase_29 AC 56 ms
50,300 KB
testcase_30 WA -
testcase_31 AC 57 ms
50,440 KB
testcase_32 AC 73 ms
51,536 KB
testcase_33 AC 49 ms
49,412 KB
testcase_34 AC 47 ms
49,616 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 55 ms
49,728 KB
testcase_41 AC 55 ms
49,876 KB
testcase_42 AC 56 ms
49,812 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 AC 44 ms
49,420 KB
testcase_54 AC 45 ms
49,512 KB
testcase_55 AC 45 ms
49,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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++) {
			int r0 = sc.nextInt();
			int c0 = sc.nextInt();
			rc0[i] = r0 << 32 & c0;
			int r1 = sc.nextInt();
			int 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);
		}
	}
}
0