結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー EmKjpEmKjp
提出日時 2019-12-13 00:46:47
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 5,465 bytes
コンパイル時間 3,196 ms
コンパイル使用メモリ 106,196 KB
実行使用メモリ 70,484 KB
最終ジャッジ日時 2023-09-08 08:26:59
合計ジャッジ時間 9,838 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
20,732 KB
testcase_01 AC 58 ms
22,680 KB
testcase_02 AC 57 ms
22,868 KB
testcase_03 AC 56 ms
20,708 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 222 ms
52,908 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 166 ms
42,412 KB
testcase_16 AC 244 ms
56,224 KB
testcase_17 AC 99 ms
28,280 KB
testcase_18 AC 288 ms
66,792 KB
testcase_19 AC 163 ms
40,316 KB
testcase_20 AC 90 ms
27,728 KB
testcase_21 AC 69 ms
23,628 KB
testcase_22 AC 73 ms
24,464 KB
testcase_23 AC 65 ms
21,260 KB
testcase_24 AC 186 ms
47,036 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 236 ms
59,200 KB
testcase_28 AC 286 ms
68,972 KB
testcase_29 AC 205 ms
47,312 KB
testcase_30 AC 113 ms
28,744 KB
testcase_31 AC 66 ms
21,432 KB
testcase_32 AC 252 ms
61,172 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;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var N = ni();
        var A = ni(N + 1);
        var B = ni(N + 1);
        var D = ni(N);
        Array.Sort(D);
        Array.Reverse(D);
        memo = new int?[N + 1, N + 1];
        cout.WriteLine(Dfs(A, B, D, 0, 0));
    }

    int?[,] memo;

    private int Dfs(int[] a, int[] b, int[] d, int v1, int v2, int p = 0) {
        if (p == d.Length) return 0;
        if (!memo[v1, v2].HasValue) {
            int val = 0;
            {
                var after = a[v1 + 1] + b[v2];
                var nextP = p;
                while (nextP < d.Length && d[nextP] > after) {
                    nextP++;
                }
                if (nextP < d.Length) {
                    val = Math.Max(val, Dfs(a, b, d, v1 + 1, v2, nextP + 1) + 1);
                }
            }
            {
                var after = a[v1] + b[v2 + 1];
                var nextP = p;
                while (nextP < d.Length && d[nextP] > after) {
                    nextP++;
                }
                if (nextP < d.Length) {
                    val = Math.Max(val, Dfs(a, b, d, v1, v2 + 1, nextP + 1) + 1);
                }
            }

            memo[v1, v2] = val;
        }
        return memo[v1, v2].Value;
    }
}


// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0