結果

問題 No.1008 Bench Craftsman
ユーザー EmKjpEmKjp
提出日時 2020-03-11 00:20:50
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,834 bytes
コンパイル時間 1,202 ms
コンパイル使用メモリ 118,548 KB
実行使用メモリ 24,960 KB
最終ジャッジ日時 2024-11-15 23:52:06
合計ジャッジ時間 6,607 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
18,560 KB
testcase_01 AC 25 ms
18,560 KB
testcase_02 AC 25 ms
18,432 KB
testcase_03 AC 26 ms
18,560 KB
testcase_04 AC 26 ms
18,176 KB
testcase_05 AC 234 ms
24,960 KB
testcase_06 AC 100 ms
23,936 KB
testcase_07 WA -
testcase_08 AC 31 ms
19,200 KB
testcase_09 AC 136 ms
22,912 KB
testcase_10 AC 220 ms
24,832 KB
testcase_11 AC 222 ms
24,832 KB
testcase_12 AC 220 ms
24,704 KB
testcase_13 AC 218 ms
24,832 KB
testcase_14 AC 218 ms
24,960 KB
testcase_15 AC 203 ms
24,704 KB
testcase_16 AC 217 ms
24,960 KB
testcase_17 AC 205 ms
24,960 KB
testcase_18 AC 223 ms
24,960 KB
testcase_19 AC 216 ms
24,960 KB
testcase_20 AC 97 ms
23,040 KB
testcase_21 AC 101 ms
22,912 KB
testcase_22 AC 141 ms
23,296 KB
testcase_23 AC 180 ms
24,192 KB
testcase_24 AC 171 ms
23,680 KB
testcase_25 AC 97 ms
23,424 KB
testcase_26 AC 84 ms
22,016 KB
testcase_27 AC 121 ms
22,784 KB
testcase_28 AC 139 ms
23,936 KB
testcase_29 AC 193 ms
24,448 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 m = ni();
        var a = ni(n);
        var x = new int[m];
        var w = new long[m];
        for (int i = 0; i < m; i++) {
            x[i] = ni() - 1;
            w[i] = nl();
        }

        if (a.Min() >= w.Sum()) {
            cout.WriteLine(0);
            return;
        }

        int lower = 1, upper = 1000000;
        int ans = -1;
        var f0 = new long[n + 2];
        var f1 = new long[n + 2];

        Action<long, long, long, long> add = (long begin, long end, long x0, long d) => {
            if (begin >= end) return;
            if (end > n + 1) end = n + 1;
            if (begin < 0) {
                var slide = -begin;
                begin = 0;
                x0 += slide * d;
            }
            f0[begin] += x0;
            f0[end] -= x0;
            f1[begin + 1] += d;
            f1[end] -= d;
            f0[end] -= 1L * d * (end - begin - 1);
        };

        while (lower <= upper) {
            var mid = (lower + upper) / 2;
            var c = mid;
            Array.Clear(f0, 0, n);
            Array.Clear(f1, 0, n);
            for (int i = 0; i < m; i++) {
                var dx = w[i] / c;
                add(x[i] - dx, x[i], w[i] - dx * c, c);
                add(x[i], x[i] + dx + 1, w[i], -c);
            }

            for (int i = 1; i < f1.Length; i++) f1[i] += f1[i - 1];
            for (int i = 1; i < f1.Length; i++) f1[i] += f1[i - 1];
            for (int i = 1; i < f0.Length; i++) f0[i] += f0[i - 1];

            bool ok = true;

            for (int i = 0; i < n; i++) {
                if (a[i] <= f0[i] + f1[i]) {
                    ok = false;
                    break;
                }
            }

            if (ok) {
                ans = mid;
                upper = mid - 1;
            } else {
                lower = mid + 1;
            }
        }
        cout.WriteLine(ans);
    }
}

// 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 {
    [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 InvalidOperationException();
            }
        }
        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