結果
問題 | No.723 2つの数の和 |
ユーザー | AreTrash |
提出日時 | 2019-01-17 16:05:08 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 211 ms / 2,000 ms |
コード長 | 3,718 bytes |
コンパイル時間 | 3,361 ms |
コンパイル使用メモリ | 110,748 KB |
実行使用メモリ | 41,544 KB |
最終ジャッジ日時 | 2023-09-14 01:59:41 |
合計ジャッジ時間 | 7,597 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
21,712 KB |
testcase_01 | AC | 69 ms
21,832 KB |
testcase_02 | AC | 68 ms
21,768 KB |
testcase_03 | AC | 172 ms
37,136 KB |
testcase_04 | AC | 205 ms
37,564 KB |
testcase_05 | AC | 192 ms
36,656 KB |
testcase_06 | AC | 199 ms
39,072 KB |
testcase_07 | AC | 129 ms
32,952 KB |
testcase_08 | AC | 136 ms
33,700 KB |
testcase_09 | AC | 207 ms
37,856 KB |
testcase_10 | AC | 128 ms
30,708 KB |
testcase_11 | AC | 87 ms
26,816 KB |
testcase_12 | AC | 145 ms
34,228 KB |
testcase_13 | AC | 211 ms
38,360 KB |
testcase_14 | AC | 106 ms
28,472 KB |
testcase_15 | AC | 130 ms
31,092 KB |
testcase_16 | AC | 161 ms
35,312 KB |
testcase_17 | AC | 188 ms
38,300 KB |
testcase_18 | AC | 182 ms
37,940 KB |
testcase_19 | AC | 192 ms
41,544 KB |
testcase_20 | AC | 66 ms
21,772 KB |
testcase_21 | AC | 67 ms
21,764 KB |
testcase_22 | AC | 67 ms
21,716 KB |
testcase_23 | AC | 199 ms
40,416 KB |
testcase_24 | AC | 113 ms
31,168 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.IO; using System.Collections.Generic; using System.Linq; namespace No723 { public class Program { void Solve(StreamScanner ss, StreamWriter sw) { //--------------------------------- var N = ss.Next(int.Parse); var X = ss.Next(long.Parse); var A = ss.Next(long.Parse, N).OrderBy(x => x).ToArray(); var ret = 0L; for (var i = 0; i < N; i++) ret += BinarySearch.Range(x => A[i] + A[x], X, X, 0, N); sw.WriteLine(ret); //--------------------------------- } static void Main() { var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput())); var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false}; new Program().Solve(ss, sw); sw.Flush(); } } public static partial class BinarySearch { static long BoundToTheRight(Func<long, bool> pred, long left, long right) { if (left > right) throw new ArgumentException("left must <= right"); while (true) { if (left == right) return right; var mid = (left + right - 1) >> 1; if (pred(mid)) right = mid; else left = mid + 1; } } public static long LowerBound<T>(Func<long, T> func, T value, long left, long right) where T : IComparable<T> { return BoundToTheRight(x => func(x).CompareTo(value) >= 0, left, right); } public static long UpperBound<T>(Func<long, T> func, T value, long left, long right) where T : IComparable<T> { return BoundToTheRight(x => func(x).CompareTo(value) > 0, left, right); } public static long Range<T>(Func<long, T> func, T vLeft, T vRight, long inLeft, long inRight) where T : IComparable<T> { return UpperBound(func, vRight, inLeft, inRight) - LowerBound(func, vLeft, inLeft, inRight); } public static int LowerBound<T>(this T[] source, T value) where T : IComparable<T> { return (int)LowerBound(x => source[x], value, 0, source.Length); } public static int UpperBound<T>(this T[] source, T value) where T : IComparable<T> { return (int)UpperBound(x => source[x], value, 0, source.Length); } public static int Range<T>(this T[] source, T vLeft, T vRight) where T : IComparable<T> { return source.UpperBound(vRight) - source.LowerBound(vLeft); } } public class StreamScanner { static readonly char[] Sep = {' '}; readonly Queue<string> buffer = new Queue<string>(); readonly TextReader textReader; public StreamScanner(TextReader textReader) { this.textReader = textReader; } public T Next<T>(Func<string, T> parser) { if (buffer.Count != 0) return parser(buffer.Dequeue()); var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries); foreach (var nextString in nextStrings) buffer.Enqueue(nextString); return Next(parser); } public T[] Next<T>(Func<string, T> parser, int x) { var ret = new T[x]; for (var i = 0; i < x; ++i) ret[i] = Next(parser); return ret; } public T[][] Next<T>(Func<string, T> parser, int x, int y) { var ret = new T[y][]; for (var i = 0; i < y; ++i) ret[i] = Next(parser, x); return ret; } } }