結果

問題 No.1015 おつりは要らないです
ユーザー EmKjpEmKjp
提出日時 2020-05-17 15:24:37
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,117 bytes
コンパイル時間 963 ms
コンパイル使用メモリ 114,888 KB
実行使用メモリ 29,660 KB
最終ジャッジ日時 2024-09-25 07:39:38
合計ジャッジ時間 4,586 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
23,656 KB
testcase_01 AC 25 ms
23,476 KB
testcase_02 AC 26 ms
25,568 KB
testcase_03 AC 25 ms
23,532 KB
testcase_04 AC 25 ms
23,788 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 25 ms
21,304 KB
testcase_08 AC 26 ms
23,596 KB
testcase_09 AC 24 ms
23,320 KB
testcase_10 AC 98 ms
25,700 KB
testcase_11 AC 100 ms
25,584 KB
testcase_12 AC 94 ms
25,568 KB
testcase_13 AC 97 ms
25,696 KB
testcase_14 AC 101 ms
25,824 KB
testcase_15 AC 95 ms
23,540 KB
testcase_16 AC 99 ms
25,576 KB
testcase_17 AC 98 ms
27,616 KB
testcase_18 AC 97 ms
25,576 KB
testcase_19 AC 96 ms
25,688 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 23 ms
23,532 KB
testcase_31 AC 60 ms
25,448 KB
testcase_32 AC 59 ms
25,448 KB
testcase_33 AC 83 ms
27,892 KB
testcase_34 AC 24 ms
23,448 KB
testcase_35 AC 24 ms
23,316 KB
testcase_36 AC 23 ms
23,536 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.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var x = ni();
        var y = ni();
        var z = ni();
        var a = ni(n);
        Array.Sort(a);
        bool ans = true;
        for (int i = 0; i < n; i++) {
            a[i]++;
        }

        for (int i = 0; i < n; i++) {
            var canUse = Math.Min(a[i] / 10000, z);
            a[i] -= canUse * 10000;
            z -= canUse;
        }

        for (int i = 0; i < n; i++) {
            var canUse = Math.Min(a[i] / 5000, y);
            a[i] -= canUse * 5000;
            y -= canUse;
        }

        Array.Sort(a, (x1, x2) => -x1.CompareTo(x2));

        //a.Dump();
        //new { x, y, z }.Dump();

        foreach (var p in a) {
            if (p == 0) continue;
            var rem = p;
            if (z > 0) {
                z--;
                rem -= 10000;
            }
            if (rem <= 0) continue;
            if (y > 0) {
                y--;
                rem -= 5000;
            }
            if (rem <= 0) continue;
            var need = (rem - 1) / 1000 + 1;
            if (x - need >= 0) {
                x -= need;
            } else {
                ans = false;
            }
        }

        cout.WriteLine(ans ? "Yes" : "No");
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#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 {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

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

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

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    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 (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}
0