結果
問題 | No.2984 [Cherry Anniversary 4] 満開の願いを込めた 27 の桜 |
ユーザー |
|
提出日時 | 2024-12-09 00:38:38 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 659 ms / 4,000 ms |
コード長 | 13,337 bytes |
コンパイル時間 | 18,103 ms |
コンパイル使用メモリ | 169,804 KB |
実行使用メモリ | 188,720 KB |
最終ジャッジ日時 | 2024-12-09 00:39:12 |
合計ジャッジ時間 | 32,795 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (101 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using Lib;using System;using System.Collections.Generic;using System.Diagnostics;using System.IO;using System.Linq;using System.Runtime.CompilerServices;using System.Text;using static Lib.Functions;using static Lib.OutputLib;public class Solver{const bool MultiTestCase = true;void Solve(){int n = 3;var a = new int[n, n, n];for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)for (int k = 0; k < n; k++)a[i, j, k] = ri;var xs = new int[n, n];var ys = new int[n, n];var zs = new int[n, n];for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)xs[i, j] = ri;for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)ys[i, j] = ri;for (int i = 0; i < n; i++)for (int j = 0; j < n; j++)zs[i, j] = ri;var c = new int[] { 0, 1, 1, 2, 2, 1 };int ans = IINF;var px = new Permutation(3);int ix = 0;do{var py = new Permutation(3);int iy = 0;do{var pz = new Permutation(3);int iz = 0;do{bool ok = true;for (int i = 0; i < n; i++)for (int j = 0; j < n; j++){{int s = 0;for (int k = 0; k < 3; k++) s += a[k, py[i], pz[j]];ok &= s == xs[i, j];}{int s = 0;for (int k = 0; k < 3; k++) s += a[px[i], k, pz[j]];ok &= s == ys[i, j];}{int s = 0;for (int k = 0; k < 3; k++) s += a[px[i], py[j], k];ok &= s == zs[i, j];}}if (ok) Chmin(ref ans, c[ix] + c[iy] + c[iz]);iz++;} while (pz.Next());iy++;} while (py.Next());ix++;} while (px.Next());if (ans == IINF) ans = -1;Write(ans);}#pragma warning disable CS0162public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }#pragma warning restore CS0162const int IINF = 1 << 30;const long INF = 1L << 60;int ri { [MethodImpl(256)] get => (int)sc.Integer(); }long rl { [MethodImpl(256)] get => sc.Integer(); }uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }ulong rul { [MethodImpl(256)] get => sc.UInteger(); }double rd { [MethodImpl(256)] get => sc.Double(); }string rs { [MethodImpl(256)] get => sc.Scan(); }string rline { [MethodImpl(256)] get => sc.Line(); }public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }}static class Program{static public void Main(string[] args){SourceExpander.Expander.Expand();Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });new Solver();Console.Out.Flush();}}#region Expanded by https://github.com/kzrnm/SourceExpandernamespace Lib{public class Permutation{int n;int[]p;public Permutation(int[]_p){n=_p.Length;p=(int[])_p.Clone();}public Permutation(int _n){n=_n;p=new int[n];for(int i=0;i<n;i++)p[i]=i;}public bool Next(){for(int i=n-2;i>=0;i--){if(p[i]<p[i+1]){int j=n-1;while(!(p[i]<p[j]))j--;Swap(i,j);for(int k=1;i+k<n-k;k++)Swap(i+k,n-k);return true;}}for(int i=0;i<n-1-i;i++)Swap(i,n-1-i);return false;}public bool Prev(){for(int i=n-2;i>=0;i--){if(p[i]>p[i+1]){int j=n-1;while(!(p[i]>p[j]))j--;Swap(i,j);for(int k=1;i+k<n-k;k++)Swap(i+k,n-k);return true;}}for(int i=0;i<n-1-i;i++)Swap(i,n-1-i);return false;}public int this[int k]{get{if(k<0||k>=n)throw new IndexOutOfRangeException();return p[k];}}[MethodImpl(256)]void Swap(int i,int j)=>(p[i],p[j])=(p[j],p[i]);public static bool Next<T>(ref T[]p)where T:IComparable<T>{int n=p.Length;for(int i=n-2;i>=0;i--){if(p[i].CompareTo(p[i+1])<0){int j=n-1;while(!(p[i].CompareTo(p[j])<0))j--;(p[i],p[j])=(p[j],p[i]);for(int k=1;i+k<n-k;k++)(p[i+k],p[n-k])=(p[n-k],p[i+k]);return true;}}for(int i=0;i<n-1-i;i++)(p[i],p[n-1-i])=(p[n-1-i],p[i]);return false;}public static bool Prev<T>(ref T[]p)where T:IComparable<T>{int n=p.Length;for(int i=n-2;i>=0;i--){if(p[i].CompareTo(p[i+1])>0){int j=n-1;while(!(p[i].CompareTo(p[j])>0))j--;(p[i],p[j])=(p[j],p[i]);for(int k=1;i+k<n-k;k++)(p[i+k],p[n-k])=(p[n-k],p[i+k]);return true;}}for(int i=0;i<n-1-i;i++)(p[i],p[n-1-i])=(p[n-1-i],p[i]);return false;}}}namespace Lib{public static class Functions{[MethodImpl(256)]public static int Popcount(ulong x){x=(x&0x5555555555555555UL)+((x>>1)&0x5555555555555555UL);x=(x&0x3333333333333333UL)+((x>>2)&0x3333333333333333UL);x=(x&0x0f0f0f0f0f0f0f0fUL)+((x>>4)&0x0f0f0f0f0f0f0f0fUL);x=(x&0x00ff00ff00ff00ffUL)+((x>>8)&0x00ff00ff00ff00ffUL);x=(x&0x0000ffff0000ffffUL)+((x>>16)&0x0000ffff0000ffffUL);x=(x&0x00000000ffffffffUL)+((x>>32)&0x00000000ffffffffUL);return(int)x;}[MethodImpl(256)]public static int Popcount(long x){x=(x&0x5555555555555555L)+((x>>1)&0x5555555555555555L);x=(x&0x3333333333333333L)+((x>>2)&0x3333333333333333L);x=(x&0x0f0f0f0f0f0f0f0fL)+((x>>4)&0x0f0f0f0f0f0f0f0fL);x=(x&0x00ff00ff00ff00ffL)+((x>>8)&0x00ff00ff00ff00ffL);x=(x&0x0000ffff0000ffffL)+((x>>16)&0x0000ffff0000ffffL);x=(x&0x00000000ffffffffL)+((x>>32)&0x00000000ffffffffL);return(int)x;}[MethodImpl(256)]public static int Popcount(int x){x=(x&0x55555555)+((x>>1)&0x55555555);x=(x&0x33333333)+((x>>2)&0x33333333);x=(x&0x0f0f0f0f)+((x>>4)&0x0f0f0f0f);x=(x&0x00ff00ff)+((x>>8)&0x00ff00ff);x=(x&0x0000ffff)+((x>>16)&0x0000ffff);return x;}[MethodImpl(256)]public static int Ctz(long x){if(x==0)return-1;return Popcount((ulong)((x&-x)-1));}[MethodImpl(256)]public static int CeilPow2(int n){int x=0;while((1<<x)<n)x++;return x;}[MethodImpl(256)]public static int SafeMod(int x,int m){int r=x%m;return r<0?r+Math.Abs(m):r;}[MethodImpl(256)]public static long SafeMod(long x,long m){long r=x%m;return r<0?r+Math.Abs(m):r;}[MethodImpl(256)]public static boolIsIncreasing(long a,long b,long c)=>a<=b&&b<=c;[MethodImpl(256)]public static int Sign(long x)=>x==0?0:(x<0?-1:1);[MethodImpl(256)]public staticint Sign(double x)=>x==0?0:(x<0?-1:1);[MethodImpl(256)]public static int DigitSum(long n,int d=10){long s=0;while(n>0){s+=n%d;n/=d;}return(int)s;}[MethodImpl(256)]public static long Floor(long a,long b)=>a>=0?a/b:(a+1)/b-1;[MethodImpl(256)]public static long Ceil(long a,long b)=>a>0?(a-1)/b+1:a/b;[MethodImpl(256)]public static long Gcd(long a,long b){if(a==0)return Math.Abs(b);if(b==0)return Math.Abs(a);if(a<0)a=-a;if(b<0)b=-b;int u=Ctz(a);int v=Ctz(b);a>>=u;b>>=v;while(a!=b){if(a<b)(a,b)=(b,a);a-=b;a>>=Ctz(a);}return a<<Math.Min(u,v);}[MethodImpl(256)]public static(long x,long y,long g)ExtGcd(long a,long b){if(b==0)return(Sign(a),0,Math.Abs(a));long c=SafeMod(a,b);var(x2,y2,g)=ExtGcd(b,c);long x=SafeMod(y2,b);long y=(g-a*x)/b;return(x,y,g);}[MethodImpl(256)]public static void Swap(ref int x,ref int y){x^=y;y^=x;x^=y;}[MethodImpl(256)]public staticvoid Swap(ref long x,ref long y){x^=y;y^=x;x^=y;}[MethodImpl(256)]public static void Swap<T>(ref T x,ref T y){T t=y;y=x;x=t;}[MethodImpl(256)]public static T Clamp<T>(T x,T l,T r)where T:IComparable<T> =>x.CompareTo(l)<=0?l:(x.CompareTo(r)<=0?x:r);[MethodImpl(256)]public static TClamp<T>(ref T x,T l,T r)where T:IComparable<T> =>x=x.CompareTo(l)<=0?l:(x.CompareTo(r)<=0?x:r);[MethodImpl(256)]public static void Chmin<T>(refT x,T y)where T:IComparable<T>{if(x.CompareTo(y)>0)x=y;}[MethodImpl(256)]public static void Chmax<T>(ref T x,T y)where T:IComparable<T>{if(x.CompareTo(y)<0)x=y;}[MethodImpl(256)]public static int LowerBound(long[]arr,long val,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),t=>Sign(t-val),l,r);[MethodImpl(256)]public static int LowerBound(int[]arr,int val,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),t=>t-val,l,r);[MethodImpl(256)]public static int LowerBound<T>(T[]arr,T val,int l=-1,int r=-1)where T:IComparable<T> =>LowerBound(arr.AsSpan(),t=>t.CompareTo(val),l,r);[MethodImpl(256)]public static int LowerBound<T>(T[]arr,Func<T,int>comp,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),comp,l,r);[MethodImpl(256)]public static int LowerBound<T>(Span<T>data,Func<T,int>comp,int l=-1,int r=-1){if(data.Length==0)return-1;if(l==-1)l=0;if(r==-1)r=data.Length;while(l<r){int x=(l+r)/2;if(comp(data[x])<0)l=x+1;else r=x;}return l;}[MethodImpl(256)]public static int RangeCount<T>(T[]arr,T geq,T lt,int l=-1,int r=-1)where T:IComparable<T> =>Math.Max(0,LowerBound(arr.AsSpan(),t=>t.CompareTo(lt),l,r)-LowerBound(arr.AsSpan(),t=>t.CompareTo(geq),l,r));[MethodImpl(256)]public static string ToBase2(long v,int digit=-1){if(digit==-1){digit=0;while((v>>digit)>0)digit++;}var c=new string[digit];for(int i=0;i<digit;i++)c[digit-1-i]=((v>>i)&1)==0?"0":"1";return string.Join("",c);}[MethodImpl(256)]public static string ToBaseN(long v,int n,int digit=-1){if(digit==-1){digit=0;long pow=1;while(v>=pow){digit++;pow*=n;}}var c=new int[digit];for(int i=0;i<digit;i++,v/=n)c[digit-1-i]=(int)(v%n);return string.Join("",c);}}}namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonlybyte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byteRead(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=newStringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=newStringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public staticvoid Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static voidFlush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static voidYn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}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/kzrnm/SourceExpander