結果
問題 | No.1021 Children in Classrooms |
ユーザー |
![]() |
提出日時 | 2020-04-15 08:32:50 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 149 ms / 2,000 ms |
コード長 | 8,025 bytes |
コンパイル時間 | 1,176 ms |
コンパイル使用メモリ | 120,388 KB |
実行使用メモリ | 40,448 KB |
最終ジャッジ日時 | 2024-10-01 18:38:51 |
合計ジャッジ時間 | 3,820 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
コンパイルメッセージ
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 deq = new Deque<int>();for (int i = 0; i < N; i++){deq.PushTail(sc.Next<int>());}var S = ReadLine();for (int i = 0; i < M; i++){if (S[i] == 'L'){deq.PushHead(deq.PopHead() + deq.PopHead());deq.PushTail(0);}else{deq.PushTail(deq.PopTail() + deq.PopTail());deq.PushHead(0);}}Console.WriteLine(string.Join(" ", deq.ToArray()));}}public class Deque<T>{private T[] data;int offset, sz;public int Count { get; private set; }public Deque() { data = new T[sz = 16]; }public T this[int i]{[MethodImpl(MethodImplOptions.AggressiveInlining)]get { return data[MOD(i + offset)]; }[MethodImpl(MethodImplOptions.AggressiveInlining)]set { data[MOD(i + offset)] = value; }}[MethodImpl(MethodImplOptions.AggressiveInlining)]public int MOD(int v) => v & (sz - 1);private void Extend(){var t = new T[sz << 1];for (var i = 0; i < sz; i++)t[i] = data[MOD(offset + i)];offset = 0;data = t;sz <<= 1;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public void PushHead(T item){if (Count == sz) Extend();data[MOD(--offset)] = item;Count++;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public T PopHead(){if (Count == 0) return default(T);Count--;return data[MOD(offset++)];}[MethodImpl(MethodImplOptions.AggressiveInlining)]public void PushTail(T item){if (Count == sz) Extend();data[MOD(Count++ + offset)] = item;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public T PopTail(){if (Count == 0) return default(T);return data[MOD(--Count + offset)];}[MethodImpl(MethodImplOptions.AggressiveInlining)]public bool Any() => Count > 0;public T[] ToArray(){var rt = new T[Count];for (int i = 0; i < Count; i++)rt[i] = this[i];return rt;}}#region Templatepublic 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; }[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[] 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; }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 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 MaxElement<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 void PopBack<T>(this List<T> A) => A.RemoveAt(A.Count - 1);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