結果

問題 No.812 Change of Class
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2019-04-14 16:08:30
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 772 ms / 4,000 ms
コード長 4,582 bytes
コンパイル時間 4,001 ms
コンパイル使用メモリ 120,736 KB
実行使用メモリ 59,056 KB
最終ジャッジ日時 2024-06-12 20:45:20
合計ジャッジ時間 22,605 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 60
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
//using System.Numerics;
using static System.Math;
using Number = System.Int64;
namespace Program {
public class Solver {
Random rnd = new Random(0);
public void Solve() {
var n = ri;
var m = ri;
var G = Enumerate(n, x => new List<int>());
foreach (var i in Rep(m)) {
var u = ri - 1;
var v = ri - 1;
G[u].Add(v);
G[v].Add(u);
}
var q = ri;
foreach (var i in Rep(q)) {
var s = ri - 1;
var dist = Enumerate(n, x => 1 << 30);
dist[s] = 0;
var pq = new Queue<int>();
pq.Enqueue(s);
while (pq.Count > 0) {
var u = pq.Dequeue();
foreach (var t in G[u]) {
if (dist[t] > dist[u] + 1) {
dist[t] = dist[u] + 1;
pq.Enqueue(t);
}
}
}
Debug.WriteLine(dist.AsJoinedString());
var cnt = dist.Count(x => x != 1 << 30) - 1;
var max = dist.Where(x => x != 1 << 30).Max();
for (int ans = 0; ; ans++)
if (max <= (1 << ans)) {
Console.WriteLine($"{cnt} {ans}");
break;
}
}
}
const long INF = 1L << 60;
int ri => sc.Integer();
long rl => sc.Long();
double rd => sc.Double();
string rs => sc.Scan();
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static IEnumerable<int> Rep(int n) => Enumerable.Range(0, n);
static IEnumerable<int> RRep(int n) => Enumerable.Range(0, n).Reverse();
static T[] Enumerate<T>(int n, Func<int, T> f) {
var a = new T[n];
for (int i = 0; i < a.Length; ++i) a[i] = f(i);
return a;
}
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex {
static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
return string.Join(st, ie);
}
static public void Main() {
Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
var solver = new Program.Solver();
solver.Solve();
Console.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO {
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter {
public override IFormatProvider FormatProvider => CultureInfo.InvariantCulture;
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
}
public class StreamScanner {
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
private byte read() {
if (isEof) return 0;
if (ptr >= len) {
ptr = 0;
if ((len = str.Read(buf, 0, 1024)) <= 0) {
isEof = true;
return 0;
}
}
return buf[ptr++];
}
public char Char() {
byte b = 0;
do b = read(); while ((b < 33 || 126 < b) && !isEof);
return (char)b;
}
public string Scan() {
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
return sb.ToString();
}
public string ScanLine() {
var sb = new StringBuilder();
for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
}
#endregion
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0