結果

問題 No.3187 Mingle
ユーザー KumaTachiRen
提出日時 2025-06-20 22:41:39
言語 C#
(.NET 8.0.404)
結果
TLE  
実行時間 -
コード長 7,926 bytes
コンパイル時間 8,124 ms
コンパイル使用メモリ 169,908 KB
実行使用メモリ 185,968 KB
最終ジャッジ日時 2025-06-20 22:42:48
合計ジャッジ時間 67,842 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 9 TLE * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (109 ミリ秒)。
  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 Lib.MathLib;
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 n = ri, p = ri;

        var inv = new long[n + 1];
        inv[1] = 1;
        for (int i = 2; i <= n; i++) inv[i] = (p - p / i) * inv[p % i] % p;

        var d = new int[n + 1];
        for (int i = 1; i <= n; i++)
            for (int j = i; j <= n; j += i)
                d[j]++;
        var sum = new long[(int)FloorRoot.Calc((ulong)n) + 1][];
        for (int i = 1; i < sum.Length; i++) sum[i] = new long[n / i + 1];

        var dp = new long[n + 1];
        int sq = 1;
        for (int k = 3; k <= n; k++)
        {
            while ((sq + 1) * (sq + 1) <= k) sq++;
            long v = 0;
            //for (int i = 1; i <= k; i++) v += dp[k / i * i];
            for (int i = 1; i <= k / sq; i++)
            {
                if (k % i == 0) continue;
                v += dp[k / i * i];
            }
            for (int x = 1; x < sq; x++)
            {
                int l = k / (x + 1), r = k / x;
                if (k % x == 0) r--;
                v += sum[x][r] - sum[x][l];
                // floor(k/i)=x
                // l<i<=r
                // x*(l+1),...,x*r
            }
            v = (v % p * inv[k - d[k]] + k * inv[k - d[k]]) % p;
            dp[k] = v;
            for (int x = 1; x * x <= k; x++) if (k % x == 0) sum[x][k / x] = sum[x][k / x - 1] + v;
        }
        Write(dp[n]);
    }


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

    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 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.MathLib{public static class FloorRoot{public static ulong Calc(ulong n,int k=2,ulong r=0){if(n<=1||k==1)return n;if(k>=64)return 1;ulong l=0;if(r==0)r=1UL<<(63/k+1);ulong p=1UL<<(63/k);while(r-l>1){ulong m=l+(r-l)/2;if(m>p){ulong x=n;for(int i=0;i<k;i++)x/=m;if(x==0)r=m;else l=m;}else{ulong x=1,a=m;int t=k;while(t!=0){if((t&1)==1)x*=a;a*=a;t>>=1;}if(x>n)r=m;else l=m;}}return l;}public static long[]Table(long n,int m=60){LinearSieve.Calc(m);var lpf=LinearSieve.LPF;var ret=new long[m+1];ret[1]=n;for(int k=2;k<=m;k++)ret[k]=(long)Calc((ulong)ret[k/lpf[k]],lpf[k]);return ret;}}}
namespace Lib.MathLib{public static class LinearSieve{public static List<int>Primes;public static int[]LPF;public static int[]Table(int max){Calc(max);int l=Primes.Count;while(l>0&&Primes[l-1]>max)l--;var ret=new int[l];for(int i=0;i<l;i++)ret[i]=Primes[i];return ret;}public static void Calc(int max){if(Primes==null){Primes=new List<int>();LPF=new int[max+1];CalcInner(2,max);}else if(LPF.Length-1<max){int min=LPF.Length;Array.Resize(ref LPF,max+1);CalcInner(min,max);}}private static void CalcInner(int min,int max){for(int d=2;d<min;d++)for(int j=0;j<Primes.Count;j++){int p=Primes[j];if((long)p*d>max||p>LPF[d])break;LPF[(long)p*d]=p;}for(int d=min;d<=max;d++){if(LPF[d]==0){LPF[d]=d;Primes.Add(d);}for(int j=0;j<Primes.Count;j++){int p=Primes[j];if((long)p*d>max||p>LPF[d])break;LPF[(long)p*d]=p;}}}}}
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