結果
問題 | No.168 ものさし |
ユーザー | eitaho |
提出日時 | 2015-03-20 02:14:17 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 307 ms / 2,000 ms |
コード長 | 4,215 bytes |
コンパイル時間 | 2,634 ms |
コンパイル使用メモリ | 112,080 KB |
実行使用メモリ | 35,152 KB |
最終ジャッジ日時 | 2023-08-25 20:48:47 |
合計ジャッジ時間 | 6,912 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
24,024 KB |
testcase_01 | AC | 63 ms
23,536 KB |
testcase_02 | AC | 64 ms
21,740 KB |
testcase_03 | AC | 66 ms
21,500 KB |
testcase_04 | AC | 66 ms
21,668 KB |
testcase_05 | AC | 65 ms
23,728 KB |
testcase_06 | AC | 68 ms
21,728 KB |
testcase_07 | AC | 65 ms
21,664 KB |
testcase_08 | AC | 65 ms
21,496 KB |
testcase_09 | AC | 67 ms
21,584 KB |
testcase_10 | AC | 71 ms
21,704 KB |
testcase_11 | AC | 109 ms
24,080 KB |
testcase_12 | AC | 216 ms
33,488 KB |
testcase_13 | AC | 282 ms
31,012 KB |
testcase_14 | AC | 279 ms
35,152 KB |
testcase_15 | AC | 67 ms
21,696 KB |
testcase_16 | AC | 68 ms
23,784 KB |
testcase_17 | AC | 72 ms
21,784 KB |
testcase_18 | AC | 79 ms
21,836 KB |
testcase_19 | AC | 296 ms
34,904 KB |
testcase_20 | AC | 306 ms
35,132 KB |
testcase_21 | AC | 301 ms
33,360 KB |
testcase_22 | AC | 307 ms
33,176 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.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { void Solve() { int N = reader.Int(); var P = reader.IntGrid(N); var Es = new List<Edge>(); Func<long, long> Sq = n => n * n; Func<int, int, int> Cost = (a, b) => { long sq = Sq(P[a][0] - P[b][0]) + Sq(P[a][1] - P[b][1]); long len = (long)Math.Sqrt(sq) / 10 * 10; for (; ; len += 10) if (len * len >= sq) return (int)len; }; for (int a = 0; a < N; a++) for (int b = 0; b < a; b++) Es.Add(new Edge(a, b, Cost(a, b))); Es.Sort(); var uf = new UnionFind(N); int ans = 0; foreach (var e in Es) if (uf.Unite(e.a, e.b) && uf.Same(0, N - 1)) { ans = e.cost; break; } Console.WriteLine(ans); } struct Edge : IComparable<Edge> { public int a, b; public int cost; public Edge(int a, int b, int c) { this.a = a; this.b = b; this.cost = c; } public int CompareTo(Edge other) { return cost.CompareTo(other.cost); } } class UnionFind { private int[] parent; private int[] rank; private int[] numElements; public UnionFind(int N) { parent = new int[N]; rank = new int[N]; numElements = new int[N]; for (int i = 0; i < N; i++) { parent[i] = i; numElements[i] = 1; } } public int Root(int x) { if (parent[x] == x) return x; return parent[x] = Root(parent[x]); } public bool Same(int x, int y) { return Root(x) == Root(y); } public int NumElements(int x) { return numElements[Root(x)]; } public bool Unite(int x, int y) { x = Root(x); y = Root(y); if (x == y) return false; if (rank[x] < rank[y]) { parent[x] = y; numElements[y] += numElements[x]; } else { parent[y] = x; if (rank[x] == rank[y]) { rank[x]++; } numElements[x] += numElements[y]; } return true; } } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public Reader(string file) { reader = new StreamReader(file); } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }