結果

問題 No.871 かえるのうた
ユーザー ひばちひばち
提出日時 2019-12-31 02:49:35
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 5,150 bytes
コンパイル時間 3,355 ms
コンパイル使用メモリ 113,656 KB
実行使用メモリ 49,964 KB
最終ジャッジ日時 2023-08-10 19:03:40
合計ジャッジ時間 10,531 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
21,848 KB
testcase_01 WA -
testcase_02 AC 63 ms
21,852 KB
testcase_03 AC 64 ms
23,900 KB
testcase_04 AC 63 ms
23,956 KB
testcase_05 AC 63 ms
23,988 KB
testcase_06 WA -
testcase_07 AC 63 ms
19,812 KB
testcase_08 AC 73 ms
22,400 KB
testcase_09 AC 73 ms
22,536 KB
testcase_10 AC 72 ms
24,140 KB
testcase_11 AC 72 ms
24,256 KB
testcase_12 AC 83 ms
25,760 KB
testcase_13 AC 74 ms
20,716 KB
testcase_14 AC 170 ms
46,648 KB
testcase_15 AC 172 ms
46,960 KB
testcase_16 AC 174 ms
49,964 KB
testcase_17 AC 159 ms
45,304 KB
testcase_18 AC 86 ms
26,232 KB
testcase_19 WA -
testcase_20 AC 76 ms
23,032 KB
testcase_21 AC 110 ms
36,424 KB
testcase_22 AC 64 ms
23,896 KB
testcase_23 AC 64 ms
22,024 KB
testcase_24 AC 64 ms
21,944 KB
testcase_25 AC 72 ms
22,316 KB
testcase_26 AC 76 ms
20,948 KB
testcase_27 AC 79 ms
23,052 KB
testcase_28 AC 62 ms
21,948 KB
testcase_29 AC 112 ms
37,444 KB
testcase_30 AC 130 ms
39,860 KB
testcase_31 AC 74 ms
22,488 KB
testcase_32 AC 125 ms
40,340 KB
testcase_33 WA -
testcase_34 AC 87 ms
26,484 KB
testcase_35 AC 119 ms
37,716 KB
testcase_36 AC 134 ms
43,748 KB
testcase_37 AC 112 ms
38,692 KB
testcase_38 AC 162 ms
46,536 KB
testcase_39 WA -
testcase_40 AC 101 ms
28,992 KB
testcase_41 AC 64 ms
21,956 KB
testcase_42 AC 103 ms
28,984 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 AC 64 ms
21,952 KB
testcase_47 AC 66 ms
21,928 KB
testcase_48 AC 65 ms
25,992 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 static Template;
using static System.Console;
using static System.Convert;
using static System.Math;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int N, K;
        sc.Make(out N, out K); K--;
        var X = sc.ArrLong;
        var A = sc.ArrLong;
        int min = K - 1, max = K + 1;
        long maxl = X[K] + A[K], minl = X[K] - A[K];
        while (max != N && X[max] <= maxl) { chmax(ref maxl, X[max] + A[max]); max++; }
        while (min != -1 && X[min] >= minl) { chmin(ref minl, X[min] - A[min]); min--; }
        WriteLine(max - min - 1);
    }
}

#region Template
public 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 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 => 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);
    public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());
    public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());
    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 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 Tie(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 Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }
}
#endregion
0