結果

問題 No.2983 Christmas Color Grid (Advent Calender ver.)
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-12-08 12:26:56
言語 C#
(.NET 8.0.203)
結果
MLE  
実行時間 -
コード長 11,689 bytes
コンパイル時間 12,066 ms
コンパイル使用メモリ 167,028 KB
実行使用メモリ 186,868 KB
最終ジャッジ日時 2024-12-08 12:27:23
合計ジャッジ時間 20,008 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
22,912 KB
testcase_01 AC 37 ms
23,028 KB
testcase_02 AC 1,302 ms
39,296 KB
testcase_03 AC 44 ms
24,064 KB
testcase_04 AC 41 ms
23,936 KB
testcase_05 AC 43 ms
23,936 KB
testcase_06 AC 581 ms
34,408 KB
testcase_07 AC 38 ms
22,912 KB
testcase_08 AC 37 ms
23,040 KB
testcase_09 AC 375 ms
29,952 KB
testcase_10 AC 54 ms
24,832 KB
testcase_11 AC 53 ms
23,936 KB
testcase_12 AC 41 ms
23,936 KB
testcase_13 AC 44 ms
23,780 KB
testcase_14 AC 44 ms
24,180 KB
testcase_15 AC 47 ms
23,936 KB
testcase_16 AC 52 ms
24,172 KB
testcase_17 AC 68 ms
24,192 KB
testcase_18 AC 86 ms
24,188 KB
testcase_19 AC 52 ms
24,960 KB
testcase_20 AC 69 ms
27,740 KB
testcase_21 AC 142 ms
40,284 KB
testcase_22 AC 114 ms
25,600 KB
testcase_23 AC 403 ms
36,448 KB
testcase_24 AC 83 ms
24,576 KB
testcase_25 AC 624 ms
34,416 KB
testcase_26 AC 86 ms
24,684 KB
testcase_27 AC 1,286 ms
39,552 KB
testcase_28 AC 642 ms
31,600 KB
testcase_29 AC 99 ms
25,088 KB
testcase_30 AC 382 ms
29,824 KB
testcase_31 AC 53 ms
24,320 KB
testcase_32 AC 71 ms
25,332 KB
testcase_33 AC 123 ms
27,120 KB
testcase_34 AC 43 ms
23,916 KB
testcase_35 AC 44 ms
23,808 KB
testcase_36 AC 47 ms
24,308 KB
testcase_37 AC 51 ms
24,064 KB
testcase_38 AC 60 ms
24,448 KB
testcase_39 AC 83 ms
24,192 KB
testcase_40 AC 39 ms
23,296 KB
testcase_41 AC 37 ms
22,784 KB
testcase_42 AC 39 ms
23,148 KB
testcase_43 AC 37 ms
22,892 KB
testcase_44 AC 38 ms
22,784 KB
testcase_45 AC 39 ms
23,160 KB
testcase_46 AC 39 ms
22,912 KB
testcase_47 AC 37 ms
23,168 KB
testcase_48 AC 39 ms
23,168 KB
testcase_49 AC 44 ms
23,168 KB
testcase_50 AC 38 ms
23,168 KB
testcase_51 AC 40 ms
23,296 KB
testcase_52 AC 39 ms
23,040 KB
testcase_53 AC 40 ms
23,028 KB
testcase_54 AC 40 ms
23,040 KB
testcase_55 AC 39 ms
22,912 KB
testcase_56 AC 38 ms
23,168 KB
testcase_57 AC 38 ms
22,912 KB
testcase_58 AC 38 ms
22,912 KB
testcase_59 AC 37 ms
22,912 KB
testcase_60 AC 38 ms
22,912 KB
testcase_61 AC 39 ms
22,912 KB
testcase_62 AC 39 ms
23,040 KB
testcase_63 AC 41 ms
22,912 KB
testcase_64 AC 40 ms
22,912 KB
testcase_65 AC 41 ms
23,040 KB
testcase_66 MLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (102 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/

ソースコード

diff # 

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 = false;
    void Solve()
    {
        int h = ri, w = ri;
        long k = rl, m = rl;

        long Pow(long x, long n)
        {
            long y = 1;
            while (n > 0)
            {
                if (n % 2 == 1) y = y * x % m;
                x = x * x % m;
                n /= 2;
            }
            return y;
        }
        long Inv(long x) => Pow(x, m - 2);
        var pow = new long[h * w + 1];
        for (int i = 0; i <= h * w; i++) pow[i] = Pow(i, k);

        int mask0 = (1 << w) - 1;
        int mask1 = 0;
        for (int i = 0; i < h; i++) mask1 |= 1 << (w * i);
        int mask2 = mask0 << ((h - 1) * w);
        int mask3 = mask1 << (w - 1);
        int mask_all = (1 << (h * w)) - 1;

        int g(int bit) => mask_all & (((bit & ~mask0) >> w) | ((bit & ~mask2) << w) | ((bit & ~mask1) >> 1) | ((bit & ~mask3) << 1));
        var ok = new bool[1 << (h * w)];
        void DFS(int f)
        {
            ok[f] = true;
            for (int i = 0; i < h * w; i++)
            {
                if (((f >> i) & 1) == 1) continue;
                if (((g(f) >> i) & 1) == 0) continue;
                int nf = f | (1 << i);
                if (ok[nf]) continue;
                ok[nf] = true;
                DFS(nf);
            }
        }
        for (int i = 0; i < h * w; i++) DFS(1 << i);

        var cnt = new long[h * w + 1];
        for (int bit = 0; bit < (1 << (h * w)); bit++)
        {
            if (!ok[bit]) continue;
            int pc = Popcount(bit);
            int c = Popcount((~bit) & g(bit));
            cnt[pc] += 1 << (h * w - pc - c);
        }

        long ans = 0;
        for (int i = 0; i <= h * w; i++)
        {
            ans += cnt[i] % m * Pow(i, k) % m;
            if (ans >= m) ans -= m;
        }
        long p = 0;
        for (int i = 1; i <= h * w; i++)
        {
            p += Inv(i);
            if (p >= m) p -= m;
        }
        ans = ans * p % m * Pow(Inv(2), h * w) % m;
        Write(ans);
    }

#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const 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/SourceExpander
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 bool IsIncreasing(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 static int 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 static void 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 T Clamp<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>(ref T 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 readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){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=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();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 static void 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 void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(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 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
0