結果
問題 | No.1012 荷物収集 |
ユーザー | ひばち |
提出日時 | 2020-03-20 22:16:36 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 326 ms / 2,000 ms |
コード長 | 6,085 bytes |
コンパイル時間 | 5,477 ms |
コンパイル使用メモリ | 114,740 KB |
実行使用メモリ | 42,272 KB |
最終ジャッジ日時 | 2023-08-21 16:58:01 |
合計ジャッジ時間 | 15,278 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
21,836 KB |
testcase_01 | AC | 65 ms
21,840 KB |
testcase_02 | AC | 65 ms
21,796 KB |
testcase_03 | AC | 65 ms
23,784 KB |
testcase_04 | AC | 275 ms
42,212 KB |
testcase_05 | AC | 275 ms
42,272 KB |
testcase_06 | AC | 278 ms
36,112 KB |
testcase_07 | AC | 276 ms
36,048 KB |
testcase_08 | AC | 276 ms
36,260 KB |
testcase_09 | AC | 277 ms
36,172 KB |
testcase_10 | AC | 280 ms
36,160 KB |
testcase_11 | AC | 276 ms
36,164 KB |
testcase_12 | AC | 274 ms
36,268 KB |
testcase_13 | AC | 277 ms
36,044 KB |
testcase_14 | AC | 74 ms
15,940 KB |
testcase_15 | AC | 74 ms
16,052 KB |
testcase_16 | AC | 73 ms
15,996 KB |
testcase_17 | AC | 73 ms
16,040 KB |
testcase_18 | AC | 73 ms
16,044 KB |
testcase_19 | AC | 72 ms
16,084 KB |
testcase_20 | AC | 66 ms
15,784 KB |
testcase_21 | AC | 72 ms
15,984 KB |
testcase_22 | AC | 71 ms
16,032 KB |
testcase_23 | AC | 72 ms
16,096 KB |
testcase_24 | AC | 236 ms
31,036 KB |
testcase_25 | AC | 294 ms
34,568 KB |
testcase_26 | AC | 203 ms
27,184 KB |
testcase_27 | AC | 102 ms
21,024 KB |
testcase_28 | AC | 297 ms
34,192 KB |
testcase_29 | AC | 217 ms
27,208 KB |
testcase_30 | AC | 306 ms
34,468 KB |
testcase_31 | AC | 144 ms
26,656 KB |
testcase_32 | AC | 139 ms
23,380 KB |
testcase_33 | AC | 174 ms
28,268 KB |
testcase_34 | AC | 179 ms
28,936 KB |
testcase_35 | AC | 257 ms
31,708 KB |
testcase_36 | AC | 165 ms
28,500 KB |
testcase_37 | AC | 209 ms
26,676 KB |
testcase_38 | AC | 243 ms
31,684 KB |
testcase_39 | AC | 151 ms
23,536 KB |
testcase_40 | AC | 157 ms
24,412 KB |
testcase_41 | AC | 326 ms
35,832 KB |
testcase_42 | AC | 181 ms
27,284 KB |
testcase_43 | AC | 234 ms
29,900 KB |
testcase_44 | AC | 63 ms
15,732 KB |
コンパイルメッセージ
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, Q; sc.Make(out N, out Q); var XW = sc.ArrInt2D(N); var X = sc.ArrInt; Array.Sort(XW, (a, b) => a[0] - b[0]); long[] Lw = new long[N + 1], Rw = new long[N + 1], Sl = new long[N + 1], Sr = new long[N + 1]; for (int i = 0; i < N; i++) { //Lx[i + 1] = Lx[i] + XW[i][0]; Lw[i + 1] = Lw[i] + XW[i][1]; Sl[i + 1] = Sl[i] + (long)XW[i][0] * XW[i][1]; } for (var i = N - 1; i >= 0; i--) { //Rx[i] = Rx[i + 1] + XW[i][0]; Rw[i] = Rw[i + 1] + XW[i][1]; Sr[i] = Sr[i + 1] +(long) XW[i][0] * XW[i][1]; } foreach(var x in X) { int r = N, l = -1; while (r - l > 1) { var m = (r + l) >> 1; if (XW[m][0] >= x) r = m; else l = m; } var res = Sr[r] - Sl[r]; res += x * Lw[r]; res -= x * Rw[r]; WriteLine(res); } } } #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