結果

問題 No.748 yuki国のお財布事情
ユーザー ひばちひばち
提出日時 2019-11-16 12:42:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 217 ms / 2,000 ms
コード長 6,308 bytes
コンパイル時間 3,765 ms
コンパイル使用メモリ 118,960 KB
実行使用メモリ 36,596 KB
最終ジャッジ日時 2024-09-24 23:18:45
合計ジャッジ時間 8,072 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
27,240 KB
testcase_01 AC 31 ms
24,944 KB
testcase_02 AC 32 ms
27,332 KB
testcase_03 AC 31 ms
23,224 KB
testcase_04 AC 32 ms
26,988 KB
testcase_05 AC 32 ms
27,368 KB
testcase_06 AC 32 ms
27,208 KB
testcase_07 AC 31 ms
25,076 KB
testcase_08 AC 32 ms
27,464 KB
testcase_09 AC 31 ms
25,204 KB
testcase_10 AC 31 ms
25,176 KB
testcase_11 AC 31 ms
27,336 KB
testcase_12 AC 31 ms
25,292 KB
testcase_13 AC 54 ms
31,404 KB
testcase_14 AC 68 ms
29,720 KB
testcase_15 AC 57 ms
31,460 KB
testcase_16 AC 101 ms
28,908 KB
testcase_17 AC 181 ms
33,816 KB
testcase_18 AC 199 ms
34,380 KB
testcase_19 AC 217 ms
34,660 KB
testcase_20 AC 200 ms
31,852 KB
testcase_21 AC 193 ms
34,220 KB
testcase_22 AC 28 ms
26,088 KB
testcase_23 AC 31 ms
25,284 KB
testcase_24 AC 32 ms
27,212 KB
testcase_25 AC 182 ms
34,012 KB
testcase_26 AC 197 ms
36,596 KB
testcase_27 AC 193 ms
36,084 KB
testcase_28 AC 157 ms
32,452 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;
using Number = System.Int64;

class Solver
{
    Scanner sc = new Scanner();
    //

    public void Solve()
    {
        int N, M, K;
        sc.Make(out N, out M, out K);
        var uf = new UnionFind(N);
        var es = sc.ArrInt2D(M);var res = 0L;
        foreach (var e in es)
        {
            e[0]--;e[1]--;
            res += e[2];
        }
        for(var i = 0; i < K; i++)
        {
            var e = sc.Int-1;
            uf.Union(es[e][0], es[e][1]);
            res -= es[e][2];
        }
        Array.Sort(es, (a, b) => a[2] - b[2]);
        foreach (var e in es)
            if (uf.Union(e[0], e[1])) res -= e[2];
        WriteLine(res);
    }
}
public class UnionFind
{
    protected int[] parent;
    public virtual int this[int i] { get { return Find(i); } }
    public UnionFind(int num)
    {
        parent = new int[num];
        for (var i = 0; i < num; i++)
            parent[i] = -1;
    }
    protected int Find(int i)
        => parent[i] < 0 ? i : (parent[i] = Find(parent[i]));
    public int Size(int i)
        => -parent[Find(i)];
    public virtual bool Union(int v1, int v2)
    {
        v1 = Find(v1); v2 = Find(v2);
        if (v1 == v2) return false;
        if (parent[v1] > parent[v2])
            swap(ref v1, ref v2);
        parent[v1] += parent[v2];
        parent[v2] = v1;
        return true;
    }
}

#region Template
public class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == 1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T num, T val) where T : IComparable<T>
    { if (num.CompareTo(val) == -1) { num = val; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T v1, ref T v2)
    { var t = v2; v2 = v1; v1 = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f();
        return rt;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T[] Create<T>(int n, Func<int, T> f)
    {
        var rt = new T[n];
        for (var i = 0; i < rt.Length; ++i)
            rt[i] = f(i);
        return rt;
    }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}

public class Scanner
{
    StreamReader sr;
    public Scanner() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scanner(string path) { sr = new StreamReader(path); }
    public string Str => sr.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>()
    {
        if (q.Count == 0)
            foreach (var item in Str.Split(' ')) q.Enqueue(item);
        return (T)Convert.ChangeType(q.Dequeue(), typeof(T));
    }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2)
    { v1 = Next<T1>();  v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3)
    { Make(out v1, out v2); v3 = Next<T3>();}
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4)
    { Make(out v1, out v2, out v3); v4 = Next<T4>();}
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5)
    { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>();}
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6)
    { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>();}
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString()
        => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b,out T3 c) { Deconstruct(out a, out b);c = v3; }
}
#endregion
0