#64331 (C#(csc)) No.317 辺の追加

• 問題: No.317 辺の追加
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-12-10 00:29:50
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 306 ms / 2,000 ms
• コード長: 7,391 bytes
• コンパイル時間: 2,222 ms
• コンパイル使用メモリ: 119,696 KB
• 実行使用メモリ: 32,512 KB
• 最終ジャッジ日時: 2024-09-15 06:55:09
• 合計ジャッジ時間: 11,553 ms
• ジャッジサーバーID （参考情報）: judge6 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	115 ms; 27,264 KB
testcase_01	AC	121 ms; 27,264 KB
testcase_02	AC	169 ms; 31,360 KB
testcase_03	AC	162 ms; 30,464 KB
testcase_04	AC	207 ms; 31,744 KB
testcase_05	AC	156 ms; 29,312 KB
testcase_06	AC	168 ms; 30,208 KB
testcase_07	AC	136 ms; 28,416 KB
testcase_08	AC	280 ms; 32,256 KB
testcase_09	AC	186 ms; 32,256 KB
testcase_10	AC	182 ms; 32,128 KB
testcase_11	AC	178 ms; 32,512 KB
testcase_12	AC	183 ms; 32,512 KB
testcase_13	AC	198 ms; 32,512 KB
testcase_14	AC	183 ms; 32,384 KB
testcase_15	AC	186 ms; 32,128 KB
testcase_16	AC	210 ms; 32,256 KB
testcase_17	AC	186 ms; 32,256 KB
testcase_18	AC	187 ms; 32,256 KB
testcase_19	AC	186 ms; 32,384 KB
testcase_20	AC	229 ms; 32,256 KB
testcase_21	AC	136 ms; 29,440 KB
testcase_22	AC	127 ms; 28,928 KB
testcase_23	AC	133 ms; 28,928 KB
testcase_24	AC	148 ms; 31,744 KB
testcase_25	AC	140 ms; 30,208 KB
testcase_26	AC	143 ms; 30,464 KB
testcase_27	AC	138 ms; 29,696 KB
testcase_28	AC	128 ms; 28,800 KB
testcase_29	AC	121 ms; 27,648 KB
testcase_30	AC	301 ms; 32,384 KB
testcase_31	AC	270 ms; 32,384 KB
testcase_32	AC	269 ms; 32,384 KB
testcase_33	AC	272 ms; 32,128 KB
testcase_34	AC	270 ms; 32,384 KB
testcase_35	AC	276 ms; 32,256 KB
testcase_36	AC	274 ms; 32,384 KB
testcase_37	AC	271 ms; 32,512 KB
testcase_38	AC	306 ms; 32,128 KB
testcase_39	AC	278 ms; 32,256 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.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var m = sc.Integer();
            var set = new DisjointSet(n);
            for (int i = 0; i < m; i++)
            {
                var u = sc.Integer() - 1;
                var v = sc.Integer() - 1;
                set.Unite(u, v);
            }
            var a = new HashMap<int, int>();
            for (int i = 0; i < n; i++) if (set[i] == i) a[set.Size(i)]++;
            var dp = Enumerate(3 * n, x => 10000000);
            foreach (var kv in a)
            {
                var x = kv.Key;
                var B = kv.Value;


                for (int i = n; i >= 0; i--)
                {
                    dp[i + x] = Math.Min(dp[i + x], dp[i] + 1);
                }
                dp[x] = 0;
                if (B == 0)
                    continue;
                B--;
                var A = new List<int>();
                for (int k = 1; k <= B; k += k)
                {
                    A.Add(k);
                    B -= k;
                }
                if (B > 0) A.Add(B);
                A.Sort();
                foreach (var k in A)
                {
                    for (int i = n; i >= 0; i--)
                    {
                        dp[i + k * x] = Math.Min(dp[i + k * x], dp[i] + k);
                    }
                }
                Debug.WriteLine(dp.AsJoinedString());


            }
            for (int i = 1; i <= n; i++)
            {
                if (dp[i] < 10000000)
                    IO.Printer.Out.WriteLine(dp[i]);
                else IO.Printer.Out.WriteLine(-1);

            }

        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++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(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        Debug.Listeners.Add(new TextWriterTraceListener(Program.IO.Printer.Out));
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    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;
        public bool IsEndOfStream { get { return isEof; } }
        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 = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion

#region DisjointSet
public class DisjointSet
{
    public int[] par, ranks, count;
    public DisjointSet(int n)
    {
        par = new int[n];
        count = new int[n];
        for (int i = 0; i < n; i++)
        {
            par[i] = i;
            count[i] = 1;
        }
        ranks = new int[n];
    }
    public int this[int id] { get { return (par[id] == id) ? id : this[par[id]]; } }
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (ranks[x] < ranks[y])
        {
            par[x] = y;
            count[y] += count[x];
        }
        else
        {
            par[y] = x;
            count[x] += count[y];
            if (ranks[x] == ranks[y])
                ranks[x]++;
        }
        return true;
    }
    public int Size(int x) { return count[this[x]]; }
    public bool IsUnited(int x, int y) { return this[x] == this[y]; }

}
#endregion

#region HashMap
public class HashMap<K, V> : Dictionary<K, V>
//where V : new()
{
    public HashMap() : base() { }
    public HashMap(int cap) : base(cap) { }
    new public V this[K i]
    {
        get
        {
            V v;
            return TryGetValue(i, out v) ? v :
                base[i] = default(V);
            //base[i] = new V();
        }
        set { base[i] = value; }
    }
}
#endregion