結果
| 問題 |
No.1008 Bench Craftsman
|
| コンテスト | |
| ユーザー |
 ひばち
|
| 提出日時 | 2020-03-06 23:17:04 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,090 bytes |
| コンパイル時間 | 2,789 ms |
| コンパイル使用メモリ | 119,108 KB |
| 実行使用メモリ | 69,752 KB |
| 最終ジャッジ日時 | 2024-10-14 09:48:01 |
| 合計ジャッジ時間 | 30,664 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 7 WA * 20 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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.ArrInt;
int[] x = new int[M], w = new int[M];
for(int i = 0; i < M; i++)
{
x[i] = sc.Next<int>() - 1;
w[i] = sc.Next<int>();
if (A[x[i]] <= w[i]) Fail(-1);
}
int r = 101010, l = -1;
while (r - l > 1)
{
var c = (r + l) >> 1;
var seg = new DualSegmentTree<long>(N, 0, (a, b) => a + b);
if (c == 0)
{
var sm = 0L;
for(int i=0;i<M;i++)
{
sm += w[i];
}
if (sm >= A.Min()) l = c;
else r = c;
continue;
}
var ev = Create(N+1, () => new int[3]);//0 pl++,1 pl--,mi++,2 mi--
int pl = 0, mi = 0;long sum = 0;
for(int i = 0; i < M; i++)
{
var ct = w[i] / c;
if (0 > x[i] - ct)
{
sum += ct - x[i];
}
else ev[x[i] - ct][0]++;
ev[x[i]][1]++;
if (x[i] + ct + 1 <= N)
ev[x[i]+ct+1][2]++;
seg.Update(Max(x[i] - ct, 0), Min(N, x[i] + ct + 1), w[i] - ct * c);
}
var b = true;
for(int i = 0; i < N; i++)
{
var s = seg.Query(i);
mi -= ev[i][2];
sum += pl;
sum -= mi;
if (s + sum * c >= A[i]) { b = false;break; }
pl += ev[i][0];
pl -= ev[i][1];
mi += ev[i][1];
}
if (b) r = c;
else l = c;
}
WriteLine(r);
}
}
public class DualSegmentTree<T>
{
protected readonly T[] data;
protected readonly int size;
protected readonly Func<T, T, T> merge;
protected readonly T idT;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected int Parent(int i)
=> (i - 1) >> 1;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected int Left(int i)
=> (i << 1) + 1;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected int Right(int i)
=> (i + 1) << 1;
public T this[int i]
{
get { return data[i + size - 1]; }
set { data[i + size - 1] = value; }
}
public DualSegmentTree(int N, T idT, Func<T, T, T> merge)
{
this.merge = merge;
this.size = 1;
this.idT = idT;
while (size < N)
size <<= 1;
data = new T[2 * this.size - 1];
for (var i = 0; i < 2 * size - 1; i++)
data[i] = idT;
}
public void Update(int left, int right, T value, int k = 0, int l = 0, int r = -1)
{
if (r == -1) r = size;
if (r <= left || right <= l) return;
if (left <= l && r <= right) data[k] = merge(data[k], value);
else
{
Update(left, right, value, Left(k), l, (l + r) >> 1);
Update(left, right, value, Right(k), (l + r) >> 1, r);
}
}
public T Query(int i)
{
i += size - 1;
var value = merge(idT, data[i]);
while (i > 0)
{
i = Parent(i);
value = merge(value, data[i]);
}
return value;
}
public int Find(int st, Func<T, bool> check)
{
var x = idT;
return Find(st, check, ref x, 0, 0, size);
}
private int Find(int st, Func<T, bool> check, ref T x, int k, int l, int r)
{
if (l + 1 == r)
{ x = merge(x, data[k]); return check(x) ? k - size + 1 : -1; }
var m = (l + r) >> 1;
if (m <= st) return Find(st, check, ref x, Right(k), m, r);
if (st <= l && !check(merge(x, data[k])))
{ x = merge(x, data[k]); return -1; }
var xl = Find(st, check, ref x, Left(k), l, m);
if (xl >= 0) return xl;
return Find(st, check, ref x, Right(k), m, 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; }
public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
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; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
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 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