結果

問題 No.583 鉄道同好会
ユーザー GrenacheGrenache
提出日時 2017-10-28 11:21:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 265 ms / 2,000 ms
コード長 4,885 bytes
コンパイル時間 3,793 ms
コンパイル使用メモリ 80,188 KB
実行使用メモリ 58,644 KB
最終ジャッジ日時 2024-11-22 03:00:23
合計ジャッジ時間 7,073 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
50,004 KB
testcase_01 AC 55 ms
50,044 KB
testcase_02 AC 54 ms
50,384 KB
testcase_03 AC 55 ms
50,600 KB
testcase_04 AC 56 ms
50,280 KB
testcase_05 AC 55 ms
50,488 KB
testcase_06 AC 56 ms
50,156 KB
testcase_07 AC 56 ms
50,456 KB
testcase_08 AC 54 ms
50,428 KB
testcase_09 AC 53 ms
50,292 KB
testcase_10 AC 58 ms
49,892 KB
testcase_11 AC 163 ms
55,316 KB
testcase_12 AC 181 ms
55,148 KB
testcase_13 AC 165 ms
54,852 KB
testcase_14 AC 173 ms
55,168 KB
testcase_15 AC 200 ms
55,660 KB
testcase_16 AC 235 ms
57,980 KB
testcase_17 AC 263 ms
58,644 KB
testcase_18 AC 265 ms
58,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder583 {

	private static Scanner sc;
	private static Printer pr;

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

		List<List<Integer>> edges = new ArrayList<>(n);
		for (int i = 0; i < n; i++) {
			edges.add(new ArrayList<>());
		}

		Set<Integer> hs = new HashSet<>();
		int root = 0;
		for (int i = 0; i < m; i++) {
			int sa = sc.nextInt();
			int sb = sc.nextInt();

			edges.get(sa).add(sb);
			edges.get(sb).add(sa);

			hs.add(sa);
			hs.add(sb);

			root = sa;
		}

		Queue<Integer> q = new ArrayDeque<>();
		boolean[] used = new boolean[n];
		q.add(root);
		used[root] = true;
		while (!q.isEmpty()) {
			int e = q.remove();

			for (int next : edges.get(e)) {
				if (!used[next]) {
					used[next] = true;
					q.add(next);
				}
			}
		}

		long cnt = 0;
		for (boolean e : used) {
			if (e) {
				cnt++;
			}
		}

		if (cnt == hs.size()) {
			int odd = 0;
			for (int e : hs) {
				if (edges.get(e).size() % 2 == 1) {
					odd++;
				}
			}

			if (odd == 0 || odd == 2) {
				pr.println("YES");
			} else {
				pr.println("NO");
			}
		} else {
			pr.println("NO");
		}

	}

	// ---------------------------------------------------
	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