結果

問題 No.1427 Simplified Tetris
ユーザー fairy_lettucefairy_lettuce
提出日時 2021-04-04 18:50:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 21,681 bytes
コンパイル時間 2,739 ms
コンパイル使用メモリ 121,728 KB
実行使用メモリ 23,936 KB
最終ジャッジ日時 2024-06-08 15:34:22
合計ジャッジ時間 5,614 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
19,712 KB
testcase_01 AC 34 ms
19,456 KB
testcase_02 AC 48 ms
23,936 KB
testcase_03 AC 26 ms
19,200 KB
testcase_04 AC 26 ms
19,072 KB
testcase_05 AC 36 ms
19,712 KB
testcase_06 AC 36 ms
20,096 KB
testcase_07 AC 26 ms
19,456 KB
testcase_08 AC 26 ms
19,072 KB
testcase_09 AC 36 ms
20,224 KB
testcase_10 AC 33 ms
19,584 KB
testcase_11 AC 38 ms
21,376 KB
testcase_12 AC 36 ms
19,712 KB
testcase_13 AC 37 ms
19,584 KB
testcase_14 AC 35 ms
19,840 KB
testcase_15 AC 39 ms
20,096 KB
testcase_16 AC 26 ms
19,456 KB
testcase_17 AC 36 ms
19,968 KB
testcase_18 AC 26 ms
19,200 KB
testcase_19 AC 45 ms
23,296 KB
testcase_20 AC 34 ms
19,712 KB
testcase_21 AC 25 ms
19,072 KB
testcase_22 AC 36 ms
19,840 KB
testcase_23 AC 37 ms
20,352 KB
testcase_24 AC 37 ms
20,224 KB
testcase_25 AC 42 ms
22,016 KB
testcase_26 AC 27 ms
19,200 KB
testcase_27 AC 26 ms
19,200 KB
testcase_28 AC 35 ms
19,840 KB
testcase_29 AC 38 ms
20,736 KB
testcase_30 AC 35 ms
19,712 KB
testcase_31 AC 41 ms
21,632 KB
testcase_32 AC 62 ms
23,680 KB
testcase_33 AC 42 ms
21,888 KB
testcase_34 AC 35 ms
19,584 KB
testcase_35 AC 26 ms
19,072 KB
testcase_36 AC 65 ms
23,808 KB
testcase_37 AC 42 ms
21,376 KB
testcase_38 AC 59 ms
23,808 KB
testcase_39 AC 38 ms
21,248 KB
testcase_40 AC 64 ms
23,552 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using AtCoder.Internal;
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Threading;
namespace CpLibrary.Contest
{
	public class SolverA : SolverBase
	{
		Scanner sr;
		bool HasMultipleTestcases { get; }

		public override void Solve()
		{
			var (h, w) = sr.ReadValue<int, int>();
			var s = sr.ReadStringArray(h);
			if (s.Select(p => p.Count(q => q == '#')).Sum() == 0)
			{
				Console.WriteLine("Yes");
				for (int i = 0; i < h; i++)
				{
					Console.WriteLine(s[i]);
				}
				return;
			}
			var empty = 0;
			for (int i = 0; i < h; i++)
			{
				bool ok = true;
				for (int j = 0; j < w; j++)
				{
					if (s[i][j] != '.') ok = false;
				}
				if (!ok) break;
				else empty = i + 1;
			}
			for (int i = empty; i < h; i++)
			{
				var c = s[i].Count(p => p == '#');
				if (c == 0 || c == w)
				{
					Console.WriteLine("No");
					return;
				}
			}
			var all = Enumerable.Repeat('#', w).Join();
			var notall = Enumerable.Repeat('.', w).Join();
			var a = Enumerable.Range(0, h - empty).ToArray();
			do
			{
				for (int r = 0; r <= h - a[a.Length - 1] - 1; r++)
				{
					var news = new List<string>();
					for (int i = 0; i < h; i++)
					{
						if (i < r) news.Add(notall);
						else news.Add(all);
					}
					for (int i = 0; i < h - empty; i++)
					{
						news[h - a[i] - 1] = s[h - 1 - i];
					}
					var block = news.Select(p => p.Count(q => q == '#')).Sum();
					var mf = new AtCoder.MFGraphInt(h * w + 2);
					for (int i = 0; i < h; i++)
					{
						for (int j = 0; j < w - 1; j++)
						{
							if (news[i][j] == '#' && news[i][j + 1] == '#')
							{
								if ((i + j) % 2 == 0) mf.AddEdge(i * w + j, i * w + j + 1, 1);
								else mf.AddEdge(i * w + j + 1, i * w + j, 1);
							}
						}
					}
					for (int i = 0; i < h - 1; i++)
					{
						for (int j = 0; j < w; j++)
						{
							if (news[i][j] == '#' && news[i + 1][j] == '#')
							{
								if ((i + j) % 2 == 0) mf.AddEdge(i * w + j, (i + 1) * w + j, 1);
								else mf.AddEdge((i + 1) * w + j, i * w + j, 1);
							}
						}
					}
					for (int i = 0; i < h; i++)
					{
						for (int j = 0; j < w; j++)
						{
							if ((i + j) % 2 == 0) mf.AddEdge(h * w, i * w + j, 1);
							else mf.AddEdge(i * w + j, h * w + 1, 1);
						}
					}
					var flow = mf.Flow(h * w, h * w + 1);
					if (flow * 2 == block)
					{
						Console.WriteLine("Yes");
						var ans = new char[h][];
						for (int i = 0; i < h; i++)
						{
							ans[i] = Enumerable.Repeat('.', w).ToArray();
						}
						var ch = 'a';
						for (int i = 0; i < mf.Edges().Length; i++)
						{
							var x = Decrypto(mf.GetEdge(i).From, h, w);
							var y = Decrypto(mf.GetEdge(i).To, h, w);
							if (x.h >= h) continue;
							if (y.h >= h) continue;
							if (mf.GetEdge(i).Flow == 1)
							{
								ans[x.h][x.w] = ch;
								ans[y.h][y.w] = ch;
								ch = Next(ch);
							}
						}
						for (int i = 0; i < h; i++)
						{
							Console.WriteLine(ans[i].Join());
						}
						return;
					}
				}
			} while (NextCombination(a, h));
			Console.WriteLine("No");
		}

		public bool NextCombination(int[] a, int max)
		{
			a[a.Length - 1]++;
			var last = a.Length;
			for (int i = a.Length - 1; i >= 1; i--)
			{
				if (a[i] > max - (a.Length - i))
				{
					a[i]++;
					a[i - 1]++;
					last = i;
				}
				else break;
			}
			if (a[0] >= max - a.Length) return false;
			for (int i = last; i < a.Length; i++)
			{
				a[i] = a[i - 1] + 1;
			}
			return true;
		}

		public (int h, int w) Decrypto(int x, int h, int w)
		{
			return (x / w, x % w);
		}

		public char Next(char x)
		{
			if (x == 'z') return 'A';
			return ++x;
		}

		public SolverA(Scanner sr) => this.sr = sr;

		public override void Run()
		{
			var _t = 1;
			if (HasMultipleTestcases) _t = sr.ReadInt();
			while (_t-- > 0) Solve();
		}
	}

	public static partial class Util
	{
		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static int PopCount(uint n)
		{
			n = (n & 0x55555555) + (n >> 1 & 0x55555555);
			n = (n & 0x33333333) + (n >> 2 & 0x33333333);
			n = (n & 0x0f0f0f0f) + (n >> 4 & 0x0f0f0f0f);
			n = (n & 0x00ff00ff) + (n >> 8 & 0x00ff00ff);
			n = (n & 0x0000ffff) + (n >> 16 & 0x0000ffff);
			return (int)n;
		}

		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static int PopCount(int n) => PopCount((uint)n);

		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static int PopCount(ulong n)
		{
			n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
			n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
			n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
			n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
			n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
			n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
			return (int)n;
		}

		[MethodImpl(MethodImplOptions.AggressiveInlining)]
		public static int PopCount(long n) => PopCount((ulong)n);
	}

	public static class ProgramA
	{
		private static bool StartsOnThread = true;

		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var sr = new Scanner(new StreamReader(Console.OpenStandardInput()));
			var solver = new SolverA(sr);
			if (StartsOnThread)
			{
				var thread = new Thread(new ThreadStart(() => solver.Run()), 1 << 27);
				thread.Start();
				thread.Join();
			}
			else solver.Run();
			Console.Out.Flush();
		}

		public static void Expand() => SourceExpander.Expander.Expand();
	}
}
#region Expanded by https://github.com/naminodarie/SourceExpander
namespace AtCoder{public class MFGraph<TValue,TOp>where TValue:struct where TOp:struct,INumOperator<TValue>{static readonly TOp op=default;public MFGraph(int n){_n=n;_g=new SimpleList<EdgeInternal>[n];for(int i=0;i<_g.Length;i++){_g[i]=new SimpleList<EdgeInternal>();}_pos=new SimpleList<(int first,int second)>();}public int AddEdge(int from,int to,TValue cap){int m=_pos.Count;_pos.Add((from,_g[from].Count));int fromId=_g[from].Count;int toId=_g[to].Count;if(from==to)toId++;_g[from].Add(new EdgeInternal(to,toId,cap));_g[to].Add(new EdgeInternal(from,fromId,default));return m;}public Edge GetEdge(int i){var(first,second)=_pos[i];var _e=_g[first][second];var _re=_g[_e.To][_e.Rev];return new Edge(first,_e.To,op.Add(_e.Cap,_re.Cap),_re.Cap);}public Edge[]Edges(){int m=_pos.Count;var result=new Edge[m];for(int i=0;i<m;i++){result[i]=GetEdge(i);}return result;}public void ChangeEdge(int i,TValue newCap,TValue newFlow){var(first,second)=_pos[i];var _e=_g[first][second];_g[first][second].Cap=op.Subtract(newCap,newFlow);_g[_e.To][_e.Rev].Cap=newFlow;}public TValue Flow(int s,int t){return Flow(s,t,op.MaxValue);}public TValue Flow(int s,int t,TValue flowLimit){var level=new int[_n];int[]iter;var que=new Queue<int>();void Bfs(){level.AsSpan().Fill(-1);level[s]=0;que.Clear();que.Enqueue(s);while(que.Count>0){int v=que.Dequeue();foreach(var e in _g[v]){if(EqualityComparer<TValue>.Default.Equals(e.Cap,default)||level[e.To]>=0)continue;level[e.To]=level[v]+1;if(e.To==t)return;que.Enqueue(e.To);}}}TValue Dfs(int v,TValue up){var lastRes=default(TValue);var stack=new Stack<(int v,TValue up,TValue res,bool childOk)>();stack.Push((v,up,default,true));DFS:while(stack.Count>0){TValue res;bool childOk;(v,up,res,childOk)=stack.Pop();if(v==s){lastRes=up;continue;}for(;iter[v]<_g[v].Count;iter[v]++,childOk=true){EdgeInternal e=_g[v][iter[v]];if(childOk){if(level[v]<=level[e.To]||EqualityComparer<TValue>.Default.Equals(_g[e.To][e.Rev].Cap,default))continue;var up1=op.Subtract(up,res);var up2=_g[e.To][e.Rev].Cap;stack.Push((v,up,res,false));stack.Push((e.To,op.LessThan(up1,up2)?up1:up2,default,true));goto DFS;}else{var d=lastRes;if(op.GreaterThan(d,default)){_g[v][iter[v]].Cap=op.Add(_g[v][iter[v]].Cap,d);_g[e.To][e.Rev].Cap=op.Subtract(_g[e.To][e.Rev].Cap,d);res=op.Add(res,d);if(EqualityComparer<TValue>.Default.Equals(res,up)){lastRes=res;goto DFS;}}}}level[v]=_n;lastRes=res;}return lastRes;}TValue flow=default;while(op.LessThan(flow,flowLimit)){Bfs();if(level[t]==-1)break;iter=new int[_n];var f=Dfs(t,op.Subtract(flowLimit,flow));if(EqualityComparer<TValue>.Default.Equals(f,default))break;flow=op.Add(flow,f);}return flow;}public bool[]MinCut(int s){var visited=new bool[_n];var que=new Queue<int>();que.Enqueue(s);while(que.Count>0){int p=que.Dequeue();visited[p]=true;foreach(var e in _g[p]){if(!EqualityComparer<TValue>.Default.Equals(e.Cap,default)&&!visited[e.To]){visited[e.To]=true;que.Enqueue(e.To);}}}return visited;}public struct Edge:IEquatable<Edge>{public int From{get;set;}public int To{get;set;}public TValue Cap{get;set;}public TValue Flow{get;set;}public Edge(int from,int to,TValue cap,TValue flow){From=from;To=to;Cap=cap;Flow=flow;}public override bool Equals(object obj)=>obj is Edge edge&&Equals(edge);public bool Equals(Edge other)=>From==other.From&&To==other.To&&EqualityComparer<TValue>.Default.Equals(Cap,other.Cap)&&EqualityComparer<TValue>.Default.Equals(Flow,other.Flow);public override int GetHashCode()=>HashCode.Combine(From,To,Cap,Flow);public static bool operator==(Edge left,Edge right)=>left.Equals(right);public static bool operator!=(Edge left,Edge right)=>!left.Equals(right);};internal struct EdgeInternal{public int To;public int Rev;public TValue Cap;public EdgeInternal(int to,int rev,TValue cap){To=to;Rev=rev;Cap=cap;}};internal readonly int _n;internal readonly SimpleList<(int first,int second)>_pos;internal readonly SimpleList<EdgeInternal>[]_g;}}
namespace AtCoder{public class MFGraphInt:MFGraph<int,IntOperator>{public MFGraphInt(int n):base(n){}}public class MFGraphLong:MFGraph<long,LongOperator>{public MFGraphLong(int n):base(n){}}}
namespace AtCoder.Internal{public class SimpleList<T>:IList<T>,IReadOnlyList<T>{private T[]data;private const int DefaultCapacity=2;public SimpleList(){data=new T[DefaultCapacity];}public SimpleList(int capacity){data=new T[Math.Max(capacity,DefaultCapacity)];}public SimpleList(IEnumerable<T>collection){if(collection is ICollection<T>col){data=new T[col.Count];col.CopyTo(data,0);Count=col.Count;}else{data=new T[DefaultCapacity];foreach(var item in collection)Add(item);}}public Span<T>AsSpan()=>new Span<T>(data,0,Count);public ref T this[int index]{[MethodImpl(MethodImplOptions.AggressiveInlining)]get{if((uint)index>=(uint)Count)ThrowIndexOutOfRangeException();return ref data[index];}}public int Count{get;private set;}public void Add(T item){if((uint)Count>=(uint)data.Length)Array.Resize(ref data,data.Length<<1);data[Count++]=item;}public void RemoveLast(){if( --Count<0)ThrowIndexOutOfRangeException();}public SimpleList<T>Reverse(){Array.Reverse(data,0,Count);return this;}public SimpleList<T>Reverse(int index,int count){Array.Reverse(data,index,count);return this;}public SimpleList<T>Sort(){Array.Sort(data,0,Count);return this;}public SimpleList<T>Sort(IComparer<T>comparer){Array.Sort(data,0,Count,comparer);return this;}public SimpleList<T>Sort(int index,int count,IComparer<T>comparer){Array.Sort(data,index,count,comparer);return this;}public void Clear()=>Count=0;public bool Contains(T item)=>IndexOf(item)>=0;public int IndexOf(T item)=>Array.IndexOf(data,item,0,Count);public void CopyTo(T[]array,int arrayIndex)=>Array.Copy(data,0,array,arrayIndex,Count);public T[]ToArray()=>AsSpan().ToArray();bool ICollection<T>.IsReadOnly=>false;T IList<T>.this[int index]{get=>data[index];set=>data[index]=value;}T IReadOnlyList<T>.this[int index]{get=>data[index];}void IList<T>.Insert(int index,T item)=>throw new NotSupportedException();bool ICollection<T>.Remove(T item)=>throw new NotSupportedException();void IList<T>.RemoveAt(int index)=>throw new NotSupportedException();IEnumerator IEnumerable.GetEnumerator()=>((IEnumerable<T>)this).GetEnumerator();IEnumerator<T>IEnumerable<T>.GetEnumerator(){for(int i=0;i<Count;i++)yield return data[i];}public Span<T>.Enumerator GetEnumerator()=>AsSpan().GetEnumerator();private static void ThrowIndexOutOfRangeException()=>throw new IndexOutOfRangeException();}}
namespace AtCoder{using static MethodImplOptions;public readonly struct IntOperator:INumOperator<int>,IShiftOperator<int>{public int MinValue=>int.MinValue;public int MaxValue=>int.MaxValue;public int MultiplyIdentity=>1;[MethodImpl(AggressiveInlining)]public int Add(int x,int y)=>x+y;[MethodImpl(AggressiveInlining)]public int Subtract(int x,int y)=>x-y;[MethodImpl(AggressiveInlining)]public int Multiply(int x,int y)=>x*y;[MethodImpl(AggressiveInlining)]public int Divide(int x,int y)=>x/y;[MethodImpl(AggressiveInlining)]public int Modulo(int x,int y)=>x%y;[MethodImpl(AggressiveInlining)]public int Minus(int x)=>-x;[MethodImpl(AggressiveInlining)]public int Increment(int x)=> ++x;[MethodImpl(AggressiveInlining)]public int Decrement(int x)=> --x;[MethodImpl(AggressiveInlining)]public bool GreaterThan(int x,int y)=>x>y;[MethodImpl(AggressiveInlining)]public bool GreaterThanOrEqual(int x,int y)=>x>=y;[MethodImpl(AggressiveInlining)]public bool LessThan(int x,int y)=>x<y;[MethodImpl(AggressiveInlining)]public bool LessThanOrEqual(int x,int y)=>x<=y;[MethodImpl(AggressiveInlining)]public int Compare(int x,int y)=>x.CompareTo(y);[MethodImpl(AggressiveInlining)]public int LeftShift(int x,int y)=>x<<y;[MethodImpl(AggressiveInlining)]public int RightShift(int x,int y)=>x>>y;}}
namespace AtCoder{public interface IAdditionOperator<T>{T Add(T x,T y);T Subtract(T x,T y);}public interface IMultiplicationOperator<T>{T Multiply(T x,T y);T MultiplyIdentity{get;}}public interface IDivisionOperator<T>:IMultiplicationOperator<T>{T Divide(T x,T y);T Modulo(T x,T y);}public interface IUnaryNumOperator<T>{T Minus(T x);T Increment(T x);T Decrement(T x);}public interface IArithmeticOperator<T>:IAdditionOperator<T>,IMultiplicationOperator<T>,IDivisionOperator<T>,IUnaryNumOperator<T>{}public interface ICompareOperator<T>:IComparer<T>{bool GreaterThan(T x,T y);bool GreaterThanOrEqual(T x,T y);bool LessThan(T x,T y);bool LessThanOrEqual(T x,T y);}public interface INumOperator<T>:IArithmeticOperator<T>,ICompareOperator<T>{T MinValue{get;}T MaxValue{get;}}public interface IShiftOperator<T>{T LeftShift(T x,int y);T RightShift(T x,int y);}}
namespace AtCoder{using static MethodImplOptions;public readonly struct LongOperator:INumOperator<long>,IShiftOperator<long>{public long MinValue=>long.MinValue;public long MaxValue=>long.MaxValue;public long MultiplyIdentity=>1L;[MethodImpl(AggressiveInlining)]public long Add(long x,long y)=>x+y;[MethodImpl(AggressiveInlining)]public long Subtract(long x,long y)=>x-y;[MethodImpl(AggressiveInlining)]public long Multiply(long x,long y)=>x*y;[MethodImpl(AggressiveInlining)]public long Divide(long x,long y)=>x/y;[MethodImpl(AggressiveInlining)]public long Modulo(long x,long y)=>x%y;[MethodImpl(AggressiveInlining)]public long Minus(long x)=>-x;[MethodImpl(AggressiveInlining)]public long Increment(long x)=> ++x;[MethodImpl(AggressiveInlining)]public long Decrement(long x)=> --x;[MethodImpl(AggressiveInlining)]public bool GreaterThan(long x,long y)=>x>y;[MethodImpl(AggressiveInlining)]public bool GreaterThanOrEqual(long x,long y)=>x>=y;[MethodImpl(AggressiveInlining)]public bool LessThan(long x,long y)=>x<y;[MethodImpl(AggressiveInlining)]public bool LessThanOrEqual(long x,long y)=>x<=y;[MethodImpl(AggressiveInlining)]public int Compare(long x,long y)=>x.CompareTo(y);[MethodImpl(AggressiveInlining)]public long LeftShift(long x,int y)=>x<<y;[MethodImpl(AggressiveInlining)]public long RightShift(long x,int y)=>x>>y;}}
namespace CpLibrary { public static class Extention { public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x); public static string Join<T>(this IEnumerable<T> x, char separator) => string.Join(separator, x); public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default); public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default); public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer) { var ng = index - 1; var ok = index + length; while (ok - ng > 1) { var mid = ng + (ok - ng) / 2; var res = comparer.Compare(list[mid], value); if (res < 0 || (isUpperBound && res == 0)) ng = mid; else ok = mid; }  return ok; }  public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T> { if (a.CompareTo(b) >= 0) return false; a = b; return true; }  public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T> { if (a.CompareTo(b) <= 0) return false; a = b; return true; } } }
namespace CpLibrary { public class Scanner { public StreamReader sr { get; private set; }  string[] str; int index; char[] separators; public Scanner(StreamReader sr, char[] separators) { this.sr = sr; this.separators = separators; str = new string[0]; index = 0; }  public Scanner(StreamReader sr): this(sr, new char[]{' '}) { }  public Scanner(): this(new StreamReader(Console.OpenStandardInput()), new char[]{' '}) { }  public string Read() { if (index < str.Length) return str[index++]; string s; do s = sr.ReadLine(); while (s == ""); str = s.Split(separators, StringSplitOptions.RemoveEmptyEntries); index = 0; return str[index++]; }  public string ReadString() => Read(); public string[] ReadStringArray(int n) { var arr = new string[n]; for (int i = 0; i < n; i++) { arr[i] = ReadString(); }  return arr; }  public int ReadInt() => int.Parse(ReadString()); public int[] ReadIntArray(int n) => ReadValueArray<int>(n); public long ReadLong() => long.Parse(ReadString()); public long[] ReadLongArray(int n) => ReadValueArray<long>(n); public double ReadDouble() => double.Parse(ReadString()); public double[] ReadDoubleArray(int n) => ReadValueArray<double>(n); public BigInteger ReadBigInteger() => BigInteger.Parse(ReadString()); public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); public T1[] ReadValueArray<T1>(int n) { var arr = new T1[n]; for (int i = 0; i < n; i++) { arr[i] = ReadValue<T1>(); }  return arr; }  public (T1, T2) ReadValue<T1, T2>() => (ReadValue<T1>(), ReadValue<T2>()); public (T1, T2, T3) ReadValue<T1, T2, T3>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>()); public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>()); public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>()); public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>(), ReadValue<T6>()); public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>() => (ReadValue<T1>(), ReadValue<T2>(), ReadValue<T3>(), ReadValue<T4>(), ReadValue<T5>(), ReadValue<T6>(), ReadValue<T7>()); public (T1[], T2[]) ReadValueArray<T1, T2>(int n) { var(v1, v2) = (new T1[n], new T2[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i]) = ReadValue<T1, T2>(); }  return (v1, v2); }  public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int n) { var(v1, v2, v3) = (new T1[n], new T2[n], new T3[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i]) = ReadValue<T1, T2, T3>(); }  return (v1, v2, v3); }  public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int n) { var(v1, v2, v3, v4) = (new T1[n], new T2[n], new T3[n], new T4[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i]) = ReadValue<T1, T2, T3, T4>(); }  return (v1, v2, v3, v4); }  public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int n) { var(v1, v2, v3, v4, v5) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i]) = ReadValue<T1, T2, T3, T4, T5>(); }  return (v1, v2, v3, v4, v5); }  public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int n) { var(v1, v2, v3, v4, v5, v6) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i]) = ReadValue<T1, T2, T3, T4, T5, T6>(); }  return (v1, v2, v3, v4, v5, v6); }  public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int n) { var(v1, v2, v3, v4, v5, v6, v7) = (new T1[n], new T2[n], new T3[n], new T4[n], new T5[n], new T6[n], new T7[n]); for (int i = 0; i < n; i++) { (v1[i], v2[i], v3[i], v4[i], v5[i], v6[i], v7[i]) = ReadValue<T1, T2, T3, T4, T5, T6, T7>(); }  return (v1, v2, v3, v4, v5, v6, v7); } } }
namespace CpLibrary { public interface ISolver { public void Solve(); public void Run(); }  public abstract class SolverBase : ISolver { public abstract void Solve(); public abstract void Run(); public bool YesNo(bool condition) { Console.WriteLine(condition ? "Yes" : "No"); return condition; }  public bool YESNO(bool condition) { Console.WriteLine(condition ? "YES" : "NO"); return condition; }  public bool yesno(bool condition) { Console.WriteLine(condition ? "yes" : "no"); return condition; } } }
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/naminodarie/SourceExpander
0