結果

問題 No.2983 Christmas Color Grid (Advent Calender ver.)
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-12-08 00:18:14
言語 C#
(.NET 8.0.203)
結果
TLE  
実行時間 -
コード長 7,754 bytes
コンパイル時間 21,145 ms
コンパイル使用メモリ 168,524 KB
実行使用メモリ 51,712 KB
最終ジャッジ日時 2024-12-08 00:20:01
合計ジャッジ時間 103,279 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
27,644 KB
testcase_01 AC 46 ms
31,268 KB
testcase_02 TLE -
testcase_03 AC 371 ms
28,800 KB
testcase_04 AC 60 ms
31,092 KB
testcase_05 AC 117 ms
32,288 KB
testcase_06 TLE -
testcase_07 AC 46 ms
29,936 KB
testcase_08 AC 50 ms
51,712 KB
testcase_09 TLE -
testcase_10 AC 533 ms
30,848 KB
testcase_11 AC 1,369 ms
51,456 KB
testcase_12 AC 54 ms
28,648 KB
testcase_13 AC 353 ms
31,104 KB
testcase_14 AC 703 ms
51,456 KB
testcase_15 AC 1,359 ms
28,800 KB
testcase_16 AC 2,685 ms
31,104 KB
testcase_17 TLE -
testcase_18 TLE -
testcase_19 AC 508 ms
30,972 KB
testcase_20 AC 1,888 ms
51,456 KB
testcase_21 TLE -
testcase_22 AC 884 ms
31,232 KB
testcase_23 TLE -
testcase_24 AC 461 ms
29,056 KB
testcase_25 TLE -
testcase_26 AC 476 ms
51,456 KB
testcase_27 TLE -
testcase_28 TLE -
testcase_29 AC 958 ms
28,928 KB
testcase_30 TLE -
testcase_31 AC 461 ms
29,056 KB
testcase_32 AC 1,675 ms
31,488 KB
testcase_33 TLE -
testcase_34 AC 369 ms
28,544 KB
testcase_35 AC 713 ms
30,976 KB
testcase_36 AC 1,424 ms
51,324 KB
testcase_37 AC 2,804 ms
28,928 KB
testcase_38 TLE -
testcase_39 TLE -
testcase_40 AC 45 ms
24,320 KB
testcase_41 AC 46 ms
24,448 KB
testcase_42 AC 46 ms
24,320 KB
testcase_43 AC 47 ms
24,300 KB
testcase_44 AC 46 ms
24,448 KB
testcase_45 AC 46 ms
24,320 KB
testcase_46 AC 47 ms
24,192 KB
testcase_47 AC 47 ms
24,448 KB
testcase_48 AC 47 ms
24,320 KB
testcase_49 AC 50 ms
25,600 KB
testcase_50 AC 47 ms
24,192 KB
testcase_51 AC 46 ms
24,428 KB
testcase_52 AC 47 ms
24,320 KB
testcase_53 AC 47 ms
24,320 KB
testcase_54 AC 51 ms
25,728 KB
testcase_55 AC 46 ms
24,192 KB
testcase_56 AC 47 ms
24,448 KB
testcase_57 AC 47 ms
24,320 KB
testcase_58 AC 46 ms
24,448 KB
testcase_59 AC 46 ms
24,448 KB
testcase_60 AC 47 ms
24,192 KB
testcase_61 AC 52 ms
25,728 KB
testcase_62 AC 45 ms
24,320 KB
testcase_63 AC 46 ms
24,448 KB
testcase_64 AC 46 ms
24,060 KB
testcase_65 AC 47 ms
24,448 KB
testcase_66 AC 51 ms
51,456 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (141 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.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);

        var cnt = new int[h * w + 1];
        var uf = new UnionFind(h * w);
        for (int bit = 0; bit < (1 << (h * w)); bit++)
        {
            uf.Clear();
            for (int i = 0; i < h; i++)
                for (int j = 0; j + 1 < w; j++)
                    if (((bit >> (w * i + j)) & 1) == 1 && ((bit >> (w * i + j + 1)) & 1) == 1)
                        uf.Unite(w * i + j, w * i + j + 1);
            for (int i = 0; i + 1 < h; i++)
                for (int j = 0; j < w; j++)
                    if (((bit >> (w * i + j)) & 1) == 1 && ((bit >> (w * i + j + w)) & 1) == 1)
                        uf.Unite(w * i + j, w * i + j + w);
            for (int i = 0; i < h * w; i++)
                if (((bit >> i) & 1) == 1 && uf.Root(i) == i) cnt[uf.Size(i)]++;
        }

        long ans = 0;
        for (int i = 0; i <= h * w; i++)
        {
            ans += pow[i] * cnt[i] % 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 class UnionFind{internal int n;internal int[]p;public int GroupCount{get;internal set;}public UnionFind(int _n){n=_n;GroupCount=n;p=Enumerable.Repeat(-1,n).ToArray();}public void Clear(){Array.Fill(p,-1);}public int Root(int x){if(p[x]<0)return x;return p[x]=Root(p[x]);}public int Size(int x)=>-p[Root(x)];public bool IsSame(int x,int y)=>Root(x)==Root(y);public bool Unite(int x,int y){x=Root(x);y=Root(y);if(x==y)return false;if(-p[x]<-p[y])(x,y)=(y,x);p[x]+=p[y];p[y]=x;GroupCount--;return true;}public int[][]GetGroups(){var leader_buf=new int[n];var group_size=new int[n];int group_count=0;for(int i=0;i<n;i++){leader_buf[i]=Root(i);if(leader_buf[i]==i)group_count++;group_size[leader_buf[i]]++;}var result=new int[n][];for(int i=0;i<n;i++)result[i]=new int[group_size[i]];var idx=new int[n];for(int i=0;i<n;i++)result[leader_buf[i]][idx[leader_buf[i]]++]=i;var res=new int[group_count][];for(int i=0,j=0;i<n;i++)if(leader_buf[i]==i)res[j++]=result[i];return res;}}}
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