結果
| 問題 | No.583 鉄道同好会 |
| ユーザー |
 sekiya9311
|
| 提出日時 | 2017-10-27 23:09:37 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 168 ms / 2,000 ms |
| コード長 | 7,537 bytes |
| コンパイル時間 | 2,865 ms |
| コンパイル使用メモリ | 110,848 KB |
| 実行使用メモリ | 25,984 KB |
| 最終ジャッジ日時 | 2024-05-01 17:36:00 |
| 合計ジャッジ時間 | 4,673 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 28 ms
20,096 KB |
| testcase_01 | AC | 28 ms
20,224 KB |
| testcase_02 | AC | 28 ms
20,352 KB |
| testcase_03 | AC | 27 ms
20,096 KB |
| testcase_04 | AC | 28 ms
20,352 KB |
| testcase_05 | AC | 28 ms
20,224 KB |
| testcase_06 | AC | 29 ms
20,224 KB |
| testcase_07 | AC | 30 ms
20,224 KB |
| testcase_08 | AC | 29 ms
20,352 KB |
| testcase_09 | AC | 29 ms
20,096 KB |
| testcase_10 | AC | 29 ms
20,480 KB |
| testcase_11 | AC | 62 ms
24,228 KB |
| testcase_12 | AC | 76 ms
24,832 KB |
| testcase_13 | AC | 75 ms
24,576 KB |
| testcase_14 | AC | 72 ms
24,576 KB |
| testcase_15 | AC | 87 ms
24,832 KB |
| testcase_16 | AC | 138 ms
25,728 KB |
| testcase_17 | AC | 154 ms
25,984 KB |
| testcase_18 | AC | 168 ms
25,856 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ProgrammingContest
{
class MainClass : IDisposable
{
Scanner sc;
Writer wr;
string backPath = "..";
char dirSep = System.IO.Path.DirectorySeparatorChar;
string inFilePath = null;
string outFilePath = null;
public MainClass()
{
this.inFilePath = this.backPath
+ this.dirSep
+ this.backPath
+ this.dirSep
+ "in.txt";
this.outFilePath = this.backPath
+ this.dirSep
+ this.backPath
+ this.dirSep
+ "out.txt";
}
static void Main(string[] args)
{
using (var mainClass = new MainClass())
{
//mainClass.MakeTestCase();
mainClass.Solve();
}
}
public void Dispose()
{
if (this.sc != null)
{
this.sc.Dispose();
this.sc = null;
}
if (this.wr != null)
{
this.wr.Dispose();
this.wr = null;
}
}
void MakeTestCase()
{
Random rand = new Random();
this.wr = new Writer(inFilePath);
}
void Solve()
{
this.wr = new Writer(this.isReactive);
//this.wr = new Writer(this.outFilePath);
#if DEBUG
if (!this.isReactive)
this.sc = new Scanner(this.inFilePath);
else
this.sc = new Scanner();
#else
this.sc = new Scanner();
#endif
int N = sc.NextInt;
int M = sc.NextInt;
UnionFind uf = new UnionFind(N);
List<int>[] G = new List<int>[N].Select(e => new List<int>()).ToArray();
for (int i = 0; i < M; i++)
{
int a = sc.NextInt;
int b = sc.NextInt;
G[a].Add(b);
G[b].Add(a);
uf.Unite(a, b);
}
int odd = 0;
for (int i = 0; i < N; i++)
{
odd += G[i].Count % 2;
}
HashSet<int> set = new HashSet<int>();
int cnt = 0;
for (int i = 0; i < N; i++)
{
if (!set.Contains(uf.Find(i)))
{
set.Add(uf.Find(i));
if (uf.Count(i) > 1)
{
cnt++;
}
}
}
wr.WriteLine((odd == 0 || odd == 2) && cnt <= 1 ? "YES" : "NO");
}
bool isReactive = false; // TODO: reactive check !!
}
class UnionFind
{
private int[] uni;
int count_;
public UnionFind(int n)
{
this.uni = new int[n];
for (int i = 0; i < n; i++)
{
this.uni[i] = -1;
}
}
public int Count()
{
return this.count_;
}
public int Count(int n)
{
return -this.uni[this.Find(n)];
}
public int Find(int n)
{
return (this.uni[n] < 0 ? n : this.uni[n] = this.Find(this.uni[n]));
}
public bool Unite(int a, int b)
{
a = this.Find(a);
b = this.Find(b);
if (a == b)
{
return false;
}
if (this.uni[a] > this.uni[b])
{
int t = a;
a = b;
b = t;
}
this.uni[a] += this.uni[b];
this.uni[b] = a;
this.count_--;
return true;
}
public bool Same(int a, int b)
{
return this.Find(a) == this.Find(b);
}
}
class Writer : IDisposable
{
private System.IO.TextWriter writer;
private StringBuilder sb;
private bool isReactive;
public Writer(string path) : this(new System.IO.StreamWriter(path))
{
}
public Writer(bool isReactive) : this(null, isReactive)
{
}
public Writer(System.IO.TextWriter writer = null, bool isReactive = false)
{
this.writer = (writer ?? Console.Out);
this.isReactive = isReactive;
if (!this.isReactive)
this.sb = new StringBuilder();
}
public void Dispose()
{
if (!this.isReactive)
this.writer.Write(sb.ToString());
if (!this.writer.Equals(Console.Out))
this.writer.Dispose();
}
public void Write(object val)
{
if (this.isReactive)
{
this.writer.Write(val.ToString());
this.writer.Flush();
}
else
this.sb.Append(val.ToString());
}
public void Write(string format, params object[] vals)
{
if (this.isReactive)
{
this.writer.Write(format, vals);
this.writer.Flush();
}
else
this.sb.AppendFormat(format, vals);
}
public void WriteLine(object val)
{
this.Write(val.ToString() + System.Environment.NewLine);
}
public void WriteLine(string format, params object[] vals)
{
this.Write(format + System.Environment.NewLine, vals);
}
}
class Scanner : IDisposable
{
private Queue<string> buffer;
private char[] sep;
private System.IO.TextReader reader;
public Scanner(string path) : this(new System.IO.StreamReader(path))
{
}
public Scanner(System.IO.TextReader reader = null)
{
this.buffer = new Queue<string>();
this.sep = new char[] { ' ' };
this.reader = (reader ?? Console.In);
}
private void CheckBuffer()
{
if (this.buffer.Count == 0)
{
string str = string.Empty;
while (string.IsNullOrEmpty(str))
str = this.reader.ReadLine();
str.Split(this.sep).ToList()
.ForEach(el => this.buffer.Enqueue(el));
}
}
public void Dispose()
{
if (!this.reader.Equals(Console.In))
this.reader.Dispose();
}
public string Next
{
get
{
this.CheckBuffer();
return this.buffer.Dequeue();
}
}
public int NextInt
{
get
{
return int.Parse(this.Next);
}
}
public double NextDouble
{
get
{
return double.Parse(this.Next);
}
}
public long NextLong
{
get
{
return long.Parse(this.Next);
}
}
public bool IsEnd
{
get
{
this.CheckBuffer();
return this.buffer.Count == 0;
}
}
}
}