結果

問題 No.2989 Fibonacci Prize
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-12-14 11:34:22
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 7,034 bytes
コンパイル時間 8,080 ms
コンパイル使用メモリ 167,780 KB
実行使用メモリ 183,520 KB
最終ジャッジ日時 2024-12-14 11:34:38
合計ジャッジ時間 14,345 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
22,784 KB
testcase_01 AC 38 ms
23,040 KB
testcase_02 AC 45 ms
26,236 KB
testcase_03 AC 39 ms
23,008 KB
testcase_04 AC 37 ms
23,040 KB
testcase_05 AC 36 ms
22,784 KB
testcase_06 AC 36 ms
23,040 KB
testcase_07 AC 38 ms
22,912 KB
testcase_08 AC 37 ms
22,784 KB
testcase_09 AC 40 ms
22,912 KB
testcase_10 AC 38 ms
22,784 KB
testcase_11 AC 40 ms
22,656 KB
testcase_12 AC 38 ms
22,784 KB
testcase_13 AC 40 ms
22,912 KB
testcase_14 AC 39 ms
22,656 KB
testcase_15 AC 39 ms
23,040 KB
testcase_16 AC 38 ms
22,784 KB
testcase_17 AC 40 ms
23,008 KB
testcase_18 AC 38 ms
23,040 KB
testcase_19 AC 38 ms
23,296 KB
testcase_20 AC 39 ms
23,036 KB
testcase_21 AC 40 ms
22,912 KB
testcase_22 AC 41 ms
22,912 KB
testcase_23 AC 41 ms
25,472 KB
testcase_24 AC 47 ms
24,704 KB
testcase_25 AC 43 ms
25,984 KB
testcase_26 AC 37 ms
24,448 KB
testcase_27 AC 43 ms
25,088 KB
testcase_28 AC 44 ms
24,944 KB
testcase_29 AC 42 ms
23,808 KB
testcase_30 AC 39 ms
23,936 KB
testcase_31 AC 41 ms
23,936 KB
testcase_32 AC 40 ms
23,804 KB
testcase_33 AC 49 ms
25,088 KB
testcase_34 AC 43 ms
26,364 KB
testcase_35 AC 41 ms
25,696 KB
testcase_36 AC 48 ms
26,368 KB
testcase_37 AC 51 ms
26,496 KB
testcase_38 AC 45 ms
25,984 KB
testcase_39 AC 45 ms
26,368 KB
testcase_40 AC 44 ms
24,832 KB
testcase_41 AC 47 ms
26,880 KB
testcase_42 AC 45 ms
25,856 KB
testcase_43 AC 66 ms
26,240 KB
testcase_44 AC 62 ms
26,112 KB
testcase_45 AC 88 ms
26,080 KB
testcase_46 AC 59 ms
26,980 KB
testcase_47 AC 56 ms
26,748 KB
testcase_48 AC 67 ms
26,872 KB
testcase_49 AC 81 ms
26,496 KB
testcase_50 AC 74 ms
26,624 KB
testcase_51 AC 58 ms
26,496 KB
testcase_52 AC 65 ms
26,624 KB
testcase_53 AC 68 ms
26,880 KB
testcase_54 AC 69 ms
26,624 KB
testcase_55 AC 72 ms
26,240 KB
testcase_56 AC 62 ms
25,984 KB
testcase_57 AC 64 ms
26,240 KB
testcase_58 AC 72 ms
26,368 KB
testcase_59 AC 66 ms
26,368 KB
testcase_60 AC 66 ms
26,752 KB
testcase_61 AC 68 ms
26,368 KB
testcase_62 AC 63 ms
26,368 KB
testcase_63 AC 59 ms
26,368 KB
testcase_64 WA -
testcase_65 AC 38 ms
22,656 KB
testcase_66 AC 38 ms
23,040 KB
testcase_67 AC 39 ms
23,040 KB
testcase_68 AC 36 ms
22,908 KB
testcase_69 AC 40 ms
22,768 KB
testcase_70 AC 38 ms
22,768 KB
testcase_71 AC 37 ms
22,656 KB
testcase_72 AC 35 ms
22,912 KB
testcase_73 AC 39 ms
23,168 KB
testcase_74 AC 38 ms
22,784 KB
testcase_75 AC 40 ms
23,040 KB
testcase_76 AC 39 ms
22,784 KB
testcase_77 AC 38 ms
22,784 KB
testcase_78 AC 41 ms
22,912 KB
testcase_79 AC 36 ms
183,520 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (95 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 n = ri, m = ri;
        // sum[i:1~n]f_i=f_(n+2)-1

        // f_(r+2)-f_(l+1) : mul of n
        // f_(r+2)-f_(l+1) <= f_m

        // r+2<=m なら下は ok
        // 2<=l'<r'<=m
        // r+2>m のとき (i.e. r>=m-1)
        // 元の総和表示を思い出すと (l,r)=(m-2,m-1),(m-1,m-1),(m,m) しかない

        // 周期はだいぶ小さいらしい

        long ans = 0;
        if (n == 1)
        {
            ans += (long)(m - 2) * (m - 1) / 2;
            ans++;
            if (m - 1 >= 1) ans++;
            if (m - 2 >= 1) ans++;
        }
        else
        {
            int p;
            {
                var c0 = new long[n];
                {
                    int x = 1, y = 1;
                    for (p = 1; ; p++)
                    {
                        c0[x]++;
                        if ((x, y) == (0, 1)) break;
                        (x, y) = (y, (x + y) % n);
                    }
                }
                int k = m + 1;
                var c = new long[n];
                for (int i = 0; i < n; i++) c[i] += c0[i] * (k / p);
                k %= p;
                {
                    int x = 0, y = 1;
                    for (int i = 0; i < k; i++)
                    {
                        c[x]++;
                        (x, y) = (y, (x + y) % n);
                    }
                }
                c[0]--; c[1]--;
                for (int i = 0; i < n; i++) ans += c[i] * (c[i] - 1) / 2;
            }

            int f(int k)
            {
                k %= p;
                int x = 0, y = 1;
                for (int i = 0; i < k; i++) (x, y) = (y, (x + y) % n);
                return x;
            }

            if (f(m) == 0) ans++;
            if (m - 1 >= 1 && f(m - 1) == 0) ans++;
            if (m - 2 >= 1 && (f(m - 1) + f(m - 2)) % n == 0) ans++;
        }
        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 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