結果

問題 No.1008 Bench Craftsman
ユーザー ひばちひばち
提出日時 2020-04-27 19:28:38
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,869 bytes
コンパイル時間 1,055 ms
コンパイル使用メモリ 114,944 KB
実行使用メモリ 56,168 KB
最終ジャッジ日時 2024-11-22 05:04:19
合計ジャッジ時間 12,239 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 30 ms
19,328 KB
testcase_02 AC 28 ms
19,200 KB
testcase_03 AC 29 ms
19,200 KB
testcase_04 AC 29 ms
19,072 KB
testcase_05 AC 598 ms
56,168 KB
testcase_06 AC 269 ms
50,104 KB
testcase_07 AC 29 ms
19,328 KB
testcase_08 AC 51 ms
21,492 KB
testcase_09 AC 257 ms
28,160 KB
testcase_10 AC 580 ms
55,452 KB
testcase_11 AC 594 ms
55,448 KB
testcase_12 AC 600 ms
55,312 KB
testcase_13 AC 610 ms
55,448 KB
testcase_14 AC 592 ms
55,188 KB
testcase_15 AC 191 ms
38,784 KB
testcase_16 AC 592 ms
55,576 KB
testcase_17 AC 195 ms
39,168 KB
testcase_18 AC 607 ms
55,316 KB
testcase_19 AC 598 ms
55,576 KB
testcase_20 AC 241 ms
47,608 KB
testcase_21 AC 236 ms
46,620 KB
testcase_22 AC 301 ms
48,072 KB
testcase_23 AC 430 ms
50,884 KB
testcase_24 AC 400 ms
49,556 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 260 ms
39,700 KB
testcase_28 AC 374 ms
49,540 KB
testcase_29 AC 542 ms
53,024 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.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int N, M;
        sc.Make(out N, out M);
        var A = sc.ArrLong;
        var XW = new long[M][];
        var sum = new long[N];
        for (int i = 0; i < M; i++)
        {
            int x, w;
            sc.Make(out x, out w);x--;
            sum[x] += w;
            if (sum[x] >= A[x]) Fail(-1);
            XW[i] = new[] { (long)x, w };
        }
        int l = -1, r = 1000000007;
        while (r - l > 1)
        {
            var m = (r + l) / 2;
            if (m == 0) { r = m;break; }
            var all = new long[N+1];
            var left = new long[N + 1];
            var right = new long[N + 1];
            var lct = new long[N + 1];
            var rct = new long[N + 1];
            foreach (var xw in XW)
            {
                long x = xw[0], w = xw[1];
                long le = x - (w-1) / m, ri = x + (w-1) / m;
                chmax(ref le, 0);
                chmin(ref ri, N - 1);
                all[le] += w;
                all[ri+1] -= w;
                right[x + 1] += m;
                right[ri + 1] -= m;
                rct[ri + 1] += -m * (ri - x);
                if (x == 0) continue;
                left[x - 1] += m;
                if (le > 0)
                {
                    left[le - 1] -= m;
                    lct[le - 1] += -m * (x - le);
                }
            }
            for (var i = 0; i < N; i++) right[i + 1] += right[i];
            for (int i = N - 1; i >= 0; i--)
            {
                left[i] += left[i + 1];
            }
            for (int i = 0; i < N+1; i++)
            {
                left[i] += lct[i];
                right[i] += rct[i];
            }
            for (var i = 0; i < N; i++) right[i + 1] += right[i];
            for (int i = N - 1; i >= 0; i--)
            {
                left[i] += left[i + 1];
            }
            for (var i = 0; i < N; i++) all[i + 1] += all[i];
            for (int i = 0; i < N; i++)
            {
                if (all[i] - left[i] - right[i] >= A[i])
                {
                    l = m;goto END;
                }
            }
            r = m;
        END:;
        }
        WriteLine(r);
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion
0