結果

問題 No.200 カードファイト！
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-04-29 03:20:07
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,673 bytes
コンパイル時間 3,485 ms
コンパイル使用メモリ 116,584 KB
実行使用メモリ 24,516 KB
最終ジャッジ日時 2023-09-19 04:00:47
合計ジャッジ時間 5,818 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
20,448 KB
testcase_01 WA -
testcase_02 AC 55 ms
20,532 KB
testcase_03 AC 54 ms
20,436 KB
testcase_04 AC 54 ms
20,504 KB
testcase_05 AC 54 ms
22,472 KB
testcase_06 AC 56 ms
24,516 KB
testcase_07 AC 57 ms
20,432 KB
testcase_08 AC 56 ms
22,472 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 54 ms
20,504 KB
testcase_14 AC 54 ms
20,424 KB
testcase_15 AC 53 ms
20,520 KB
testcase_16 AC 54 ms
22,592 KB
testcase_17 AC 52 ms
18,464 KB
testcase_18 AC 56 ms
20,480 KB
testcase_19 AC 54 ms
20,456 KB
testcase_20 AC 55 ms
20,632 KB
testcase_21 AC 54 ms
22,452 KB
testcase_22 AC 53 ms
18,384 KB
testcase_23 AC 55 ms
18,468 KB
testcase_24 AC 55 ms
20,512 KB
testcase_25 AC 54 ms
18,548 KB
testcase_26 AC 54 ms
20,508 KB
testcase_27 AC 55 ms
22,632 KB
testcase_28 AC 61 ms
20,464 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

using Point = System.Numerics.Complex;

namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer();
            var b = sc.Integer(a);
            Array.Sort(b);
            Array.Reverse(b);
            var c = sc.Integer();
            var d = sc.Integer(c);
            Array.Sort(d);
            var G = Enumerate(a + c + 2, x => new List<Edge<int, int>>());
            for (int i = 0; i < a; i++)
            {
                var k = n / a;
                if (n % a > i) k++;
                G.AddDirectedEdge(a + c, i, k, 0);
            }
            for (int i = 0; i < c; i++)
            {
                var k = n / c;
                if (n % c > i) k++;
                G.AddDirectedEdge(a + i, a + c + 1, k, 0);
            }
            for (int i = 0; i < a; i++)
                for (int j = 0; j < c; j++)
                {
                    if (b[i] > d[j]) G.AddDirectedEdge(i, a + j, 100, 0);
                    else G.AddDirectedEdge(i, a + j, 100, 1);
                }
            var ans = Flow.GetMinCostFlow(G, a + c, a + c + 1, n);
            IO.Printer.Out.WriteLine(n - ans);
        }
        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 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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<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); 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 long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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); }
    }
}
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()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion

#region CostEdge
static public class Edge
{
    static public Edge<C, V> Create<C, V>(int t, int r, C _cap, V _cost) { return new Edge<C, V>(t, r, _cap, _cost); }
}
public class Edge<C, V>
{
    public int to, rev;
    public C cap;
    public V cost;
    public Edge(int t, int r, C _cap, V _cost) { to = t; rev = r; cap = _cap; cost = _cost; }
    public override string ToString() { return string.Format("{0}: Capacity {1}, Cost{2}", to, cap, cost); }
}
#endregion

#region AddCostEdge
static public partial class Flow
{
    static public void AddDirectedEdge(this List<Edge<int, int>>[] G, int from, int to, int cap, int cost)
    {
        G[from].Add(Edge.Create(to, G[to].Count, cap, cost));
        G[to].Add(Edge.Create(from, G[from].Count - 1, 0, -cost));
    }
    static public void AddDirectedEdge(this List<Edge<int, double>>[] G, int from, int to, int cap, double cost)
    {
        G[from].Add(Edge.Create(to, G[to].Count, cap, cost));
        G[to].Add(Edge.Create(from, G[from].Count - 1, 0, -cost));
    }

}
#endregion

#region Integer MinCostFlow
static public partial class Flow
{
    static public int GetMinCostFlow(List<Edge<int, int>>[] G, int s, int t, int f, int INF = 1<<30)
    {
        var res = 0;
        var n = G.Length;
        var dist = new int[n];
        var prevV = new int[n];
        var prevE = new int[n];
        while (f > 0)
        {
            for (int i = 0; i < n; i++)
                dist[i] = INF;
            dist[s] = 0;
            var update = true;
            while (update)
            {
                update = false;
                for (int v = 0; v < n; v++)
                {
                    if (dist[v] == INF) continue;
                    for (int i = 0; i < G[v].Count; i++)
                    {
                        var e = G[v][i];
                        if (e.cap <= 0 || dist[e.to] <= dist[v] + e.cost)
                            continue;
                        dist[e.to] = dist[v] + e.cost;
                        prevV[e.to] = v;
                        prevE[e.to] = i;
                        update = true;

                    }
                }
            }
            if (dist[t] == INF)
                return -1;
            var d = f;
            for (int v = t; v != s; v = prevV[v])
                d = Math.Min(d, G[prevV[v]][prevE[v]].cap);
            f -= d;
            res += d * dist[t];
            for (int v = t; v != s; v = prevV[v])
            {
                var e = G[prevV[v]][prevE[v]];
                e.cap -= d;
                G[v][e.rev].cap += d;
            }
        }
        return res;
    }
}
#endregion
0