結果
問題 | No.748 yuki国のお財布事情 |
ユーザー | mnzn |
提出日時 | 2019-12-28 12:03:32 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 262 ms / 2,000 ms |
コード長 | 6,063 bytes |
コンパイル時間 | 4,298 ms |
コンパイル使用メモリ | 114,876 KB |
実行使用メモリ | 29,184 KB |
最終ジャッジ日時 | 2024-10-11 19:13:31 |
合計ジャッジ時間 | 9,126 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
19,072 KB |
testcase_01 | AC | 32 ms
19,072 KB |
testcase_02 | AC | 32 ms
19,200 KB |
testcase_03 | AC | 32 ms
19,200 KB |
testcase_04 | AC | 32 ms
19,200 KB |
testcase_05 | AC | 32 ms
19,456 KB |
testcase_06 | AC | 31 ms
19,200 KB |
testcase_07 | AC | 33 ms
19,328 KB |
testcase_08 | AC | 31 ms
19,200 KB |
testcase_09 | AC | 32 ms
18,944 KB |
testcase_10 | AC | 32 ms
19,072 KB |
testcase_11 | AC | 32 ms
19,328 KB |
testcase_12 | AC | 33 ms
19,200 KB |
testcase_13 | AC | 60 ms
22,944 KB |
testcase_14 | AC | 80 ms
23,552 KB |
testcase_15 | AC | 65 ms
23,680 KB |
testcase_16 | AC | 120 ms
24,832 KB |
testcase_17 | AC | 211 ms
28,416 KB |
testcase_18 | AC | 239 ms
28,672 KB |
testcase_19 | AC | 262 ms
29,184 KB |
testcase_20 | AC | 237 ms
28,416 KB |
testcase_21 | AC | 229 ms
28,544 KB |
testcase_22 | AC | 32 ms
19,200 KB |
testcase_23 | AC | 31 ms
19,328 KB |
testcase_24 | AC | 31 ms
18,944 KB |
testcase_25 | AC | 212 ms
28,288 KB |
testcase_26 | AC | 231 ms
28,544 KB |
testcase_27 | AC | 227 ms
28,544 KB |
testcase_28 | AC | 191 ms
26,880 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; class Program { static void Main(string[] args) { var N = sc.ReadInt(); var M = sc.ReadInt(); var K = sc.ReadInt(); var ABC = new Tuple<int, int, long>[M]; for (int i = 0; i < M; i++) { var a = sc.ReadInt(); var b = sc.ReadInt(); var c = sc.ReadLong(); ABC[i] = Tuple.Create(a, b, c); } var Kx = sc.ReadIntArray(K); var uf = new UnionFind(N); long min = 0; for (int i = 0; i < K; i++) { var j = Kx[i] - 1; var a = ABC[j].Item1 - 1; var b = ABC[j].Item2 - 1; var c = ABC[j].Item3; min += c; uf.Union(a, b); } foreach (var abc in ABC.OrderBy(x => x.Item3)) { var a = abc.Item1 - 1; var b = abc.Item2 - 1; var c = abc.Item3; if (!uf.Same(a, b)) { uf.Union(a, b); min += c; } } var ans = ABC.Sum(x => x.Item3) - min; Console.WriteLine(ans); } class UnionFind { public int[] Parents { get; set; } public UnionFind(int n) { this.Parents = new int[n]; for (int i = 0; i < n; i++) { this.Parents[i] = -1; } } public int Find(int x) { if (this.Parents[x] < 0) return x; this.Parents[x] = Find(this.Parents[x]); return this.Parents[x]; } public int Size(int x) { return -this.Parents[this.Find(x)]; } public bool Same(int x, int y) { return this.Find(x) == this.Find(y); } public bool Union(int x, int y) { x = this.Find(x); y = this.Find(y); if (x == y) return false; if (this.Size(x) < this.Size(y)) { var tmp = x; x = y; y = tmp; } this.Parents[x] += this.Parents[y]; this.Parents[y] = x; return true; } public int GetGroupCount() { return this.Parents.Count(p => p < 0); } } static Scanner sc = new Scanner(); } class Scanner { string[] S = new string[0]; int Index = 0; char[] Separators = new char[] { ' ' }; public string Next() { if (this.Index < this.S.Length) return this.S[this.Index++]; var line = ""; while (line == "") line = Console.ReadLine(); this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries); if (this.S.Length == 0) return this.Next(); this.Index = 0; return this.S[this.Index++]; } public string ReadStr() { return this.Next(); } public char ReadChar() { return this.Next()[0]; } public int ReadInt() { return int.Parse(this.Next()); } public uint ReadUInt() { return uint.Parse(this.Next()); } public long ReadLong() { return long.Parse(this.Next()); } public double ReadDouble() { return double.Parse(this.Next()); } public Tuple<int, int> ReadTup(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add); } public Tuple<long, long> ReadTupLong(int add = 0) { return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add); } public Tuple<int, int, int> ReadTup3(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public Tuple<int, int, int, int> ReadTup4(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public int[] ReadIntArray(int n) { var array = new int[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadInt(); } return array; } public long[] ReadLongArray(int n) { var array = new long[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadLong(); } return array; } public double[] ReadDoubleArray(int n) { var array = new double[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadDouble(); } return array; } public char[] ReadCharArray(int n) { var array = new char[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadChar(); } return array; } public string[] ReadStrArray(int n) { var array = new string[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadStr(); } return array; } public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0) { var array = new Tuple<long, long>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTupLong(add); } return array; } public Tuple<int, int>[] ReadTupArray(int n, int add = 0) { var array = new Tuple<int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup(add); } return array; } public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0) { var array = new Tuple<int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup3(add); } return array; } public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0) { var array = new Tuple<int, int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup4(add); } return array; } }