結果
問題 | No.583 鉄道同好会 |
ユーザー | chocorusk |
提出日時 | 2020-10-04 15:24:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 561 ms / 2,000 ms |
コード長 | 3,246 bytes |
コンパイル時間 | 3,766 ms |
コンパイル使用メモリ | 75,412 KB |
実行使用メモリ | 64,216 KB |
最終ジャッジ日時 | 2023-09-26 23:19:27 |
合計ジャッジ時間 | 10,185 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
55,584 KB |
testcase_01 | AC | 130 ms
55,592 KB |
testcase_02 | AC | 129 ms
53,908 KB |
testcase_03 | AC | 129 ms
55,760 KB |
testcase_04 | AC | 129 ms
55,548 KB |
testcase_05 | AC | 132 ms
55,916 KB |
testcase_06 | AC | 134 ms
55,796 KB |
testcase_07 | AC | 133 ms
55,600 KB |
testcase_08 | AC | 135 ms
55,504 KB |
testcase_09 | AC | 135 ms
55,936 KB |
testcase_10 | AC | 184 ms
56,820 KB |
testcase_11 | AC | 341 ms
60,684 KB |
testcase_12 | AC | 384 ms
60,844 KB |
testcase_13 | AC | 377 ms
60,704 KB |
testcase_14 | AC | 378 ms
60,392 KB |
testcase_15 | AC | 411 ms
60,756 KB |
testcase_16 | AC | 533 ms
63,588 KB |
testcase_17 | AC | 561 ms
64,032 KB |
testcase_18 | AC | 558 ms
64,216 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); //FastScanner scanner=new FastScanner(); PrintWriter out = new PrintWriter(System.out); int n=scanner.nextInt(); int m=scanner.nextInt(); int[] deg=new int[n]; UnionFind uf=new UnionFind(n); for(int i=0; i<m; i++) { int sa=Integer.parseInt(scanner.next()); int sb=Integer.parseInt(scanner.next()); uf.unite(sa, sb); deg[sa]++; deg[sb]++; } int z=0; for(int i=0; i<n; i++) { if(deg[i]==0) { z++; } } if(uf.cmp-z>1) { out.println("NO"); out.close(); scanner.close(); return; } int c=0; for(int i=0; i<n; i++) { if(deg[i]%2==1) c++; } if(c==0 || c==2) { out.println("YES"); }else { out.println("NO"); } out.close(); scanner.close(); } } class UnionFind{ int n; int[] par; int cmp; public UnionFind(int n) { this.n=n; this.par=new int[n]; Arrays.fill(this.par, -1); this.cmp=n; } public int find(int x) { if(par[x]<0) return x; return par[x]=find(par[x]); } public boolean unite(int x, int y) { x=find(x); y=find(y); if(x==y) { return false; } cmp--; if(par[x]>par[y]) { int tmp=x; x=y; y=tmp; } par[x]+=par[y]; par[y]=x; return true; } public boolean same(int x, int y) { return find(x)==find(y); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }