結果

問題 No.1150 シュークリームゲーム（Easy）
ユーザー ひばちひばち
提出日時 2020-08-07 22:24:31
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,379 bytes
コンパイル時間 955 ms
コンパイル使用メモリ 118,592 KB
実行使用メモリ 44,300 KB
最終ジャッジ日時 2024-09-24 20:51:54
合計ジャッジ時間 4,514 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
25,388 KB
testcase_01 AC 31 ms
25,372 KB
testcase_02 AC 31 ms
25,684 KB
testcase_03 AC 31 ms
25,392 KB
testcase_04 AC 31 ms
25,136 KB
testcase_05 AC 30 ms
23,608 KB
testcase_06 WA -
testcase_07 AC 30 ms
25,640 KB
testcase_08 AC 32 ms
27,352 KB
testcase_09 AC 31 ms
25,264 KB
testcase_10 AC 30 ms
25,692 KB
testcase_11 AC 31 ms
25,264 KB
testcase_12 AC 31 ms
27,488 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 30 ms
25,636 KB
testcase_16 AC 32 ms
25,248 KB
testcase_17 AC 31 ms
27,348 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 66 ms
34,460 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 67 ms
34,280 KB
testcase_26 AC 70 ms
35,736 KB
testcase_27 AC 70 ms
35,668 KB
testcase_28 AC 73 ms
37,620 KB
testcase_29 AC 66 ms
34,172 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 64 ms
36,456 KB
testcase_33 WA -
testcase_34 AC 68 ms
35,480 KB
testcase_35 AC 70 ms
35,168 KB
testcase_36 AC 72 ms
35,388 KB
testcase_37 WA -
testcase_38 AC 65 ms
36,708 KB
testcase_39 AC 65 ms
34,476 KB
testcase_40 AC 69 ms
35,000 KB
testcase_41 WA -
testcase_42 AC 67 ms
36,172 KB
testcase_43 AC 67 ms
34,560 KB
testcase_44 AC 81 ms
44,300 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.Threading;
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;

class Solver
{
    public Scanner sc;
    public void Solve()
    {
        var N = sc.Int;
        int s, t;
        sc.Make(out s, out t);
        var A = sc.ArrLong;
        s--;t--;
        var res = A[s]-A[t];
        var r = new List<long>();
        var p = new List<long>();
        for (int i = s + 1; i < t; i++) r.Add(A[i]);
        for (int i = s - 1; i >= 0; i--)
        {
            p.Add(A[i]);
        }
        for (int i = N - 1; i > t; i--)
        {
            p.Add(A[i]);
        }
        if (r.Count % 2 == 1 && p.Count % 2 == 1)
        {
            res += 2 * r.Take(r.Count / 2).Sum() - r.Sum()+r[r.Count/2];
            res += 2 * p.Take(p.Count / 2).Sum() - p.Sum() + p[p.Count / 2];
            res += Abs(r[r.Count / 2]-p[p.Count / 2]);
        }
        else
        {
            res += 2 * r.Take(r.Count / 2).Sum() - r.Sum();
            res += 2 * p.Take(p.Count / 2).Sum() - p.Sum();
            if (r.Count % 2 == 1) res += 2 * r[r.Count / 2];
            if (p.Count % 2 == 1) res += 2 * p[p.Count / 2];
        }
        Console.WriteLine(res);
    }
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        //Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver() { sc = new Scanner() };
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        sol.Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { 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) < 0) { 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 void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    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 ArgMax<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 void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    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); }
}

#endregion
0