結果

問題 No.2929 Miracle Branch
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-10-12 15:08:05
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 1,462 ms / 2,000 ms
コード長 7,540 bytes
コンパイル時間 10,280 ms
コンパイル使用メモリ 166,888 KB
実行使用メモリ 193,116 KB
最終ジャッジ日時 2024-10-12 15:08:49
合計ジャッジ時間 25,793 ms
ジャッジサーバーID
（参考情報） 		judge / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
23,552 KB
testcase_01 AC 50 ms
25,692 KB
testcase_02 AC 46 ms
30,300 KB
testcase_03 AC 310 ms
26,624 KB
testcase_04 AC 743 ms
26,844 KB
testcase_05 AC 269 ms
26,624 KB
testcase_06 AC 55 ms
25,984 KB
testcase_07 AC 1,462 ms
27,392 KB
testcase_08 AC 80 ms
25,984 KB
testcase_09 AC 753 ms
27,008 KB
testcase_10 AC 516 ms
26,752 KB
testcase_11 AC 756 ms
26,864 KB
testcase_12 AC 51 ms
25,984 KB
testcase_13 AC 56 ms
26,112 KB
testcase_14 AC 491 ms
26,496 KB
testcase_15 AC 540 ms
26,880 KB
testcase_16 AC 304 ms
26,624 KB
testcase_17 AC 286 ms
26,240 KB
testcase_18 AC 52 ms
26,112 KB
testcase_19 AC 53 ms
26,104 KB
testcase_20 AC 52 ms
26,460 KB
testcase_21 AC 52 ms
26,752 KB
testcase_22 AC 54 ms
25,856 KB
testcase_23 AC 55 ms
27,264 KB
testcase_24 AC 63 ms
31,080 KB
testcase_25 AC 52 ms
26,472 KB
testcase_26 AC 51 ms
25,976 KB
testcase_27 AC 49 ms
25,960 KB
testcase_28 AC 51 ms
30,592 KB
testcase_29 AC 49 ms
30,848 KB
testcase_30 AC 49 ms
30,592 KB
testcase_31 AC 49 ms
30,556 KB
testcase_32 AC 49 ms
30,592 KB
testcase_33 AC 53 ms
30,848 KB
testcase_34 AC 106 ms
45,312 KB
testcase_35 AC 111 ms
45,056 KB
testcase_36 AC 50 ms
30,976 KB
testcase_37 AC 106 ms
45,020 KB
testcase_38 AC 128 ms
44,160 KB
testcase_39 AC 105 ms
45,032 KB
testcase_40 AC 104 ms
44,928 KB
testcase_41 AC 105 ms
44,800 KB
testcase_42 AC 101 ms
45,032 KB
testcase_43 AC 99 ms
43,392 KB
testcase_44 AC 107 ms
43,392 KB
testcase_45 AC 53 ms
193,116 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (87 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()
    {
        long x = rl;
        if (x == 1)
        {
            Write("2\n1 2\nb g");
            return;
        }

        const int max = 200000;
        var ps = new List<int>();
        var ds = new List<long>() { 1 };
        for (int i = 2; i <= max; i++)
        {
            if (x % i != 0) continue;
            var nds = new List<long>(ds);
            long q = 1;
            while (x % i == 0)
            {
                x /= i;
                ps.Add(i);
                q *= i;
                for (int j = 0; j < ds.Count; j++) nds.Add(ds[j] * q);
            }
            ds = nds;
        }
        if (x != 1)
        {
            Write(-1);
            return;
        }

        ds.Sort();
        var dic = new Dictionary<long, int>();
        for (int i = 0; i < ds.Count; i++) dic.Add(ds[i], i);

        var dp = new long[ds.Count];
        var prv = new int[ds.Count];
        for (int i = 0; i < ds.Count; i++)
        {
            dp[i] = ds[i] + 1;
            prv[i] = -1;
            for (int j = 0; j < i; j++)
            {
                if (ds[i] % ds[j] != 0) continue;
                long v = dp[j] + ds[i] / ds[j] + 1;
                if (v < dp[i])
                {
                    dp[i] = v;
                    prv[i] = j;
                }
            }
        }

        if (dp[^1] > max)
        {
            Write(-1);
            return;
        }

        int n = 0;
        var es = new List<string>();
        var c = new List<char>();
        int p = -1;
        x = ds[^1];
        Debug.Assert(x != 1);
        while (x > 1)
        {
            c.Add('b');
            if (p != -1) es.Add($"{p + 1} {n + 1}");
            p = n++;

            int r = prv[dic[x]];
            long v = r == -1 ? x : x / ds[r];
            for (int i = 0; i < v; i++)
            {
                c.Add('g');
                es.Add($"{p + 1} {n + 1}");
                n++;
            }
            x /= v;
        }
        Write(n);
        WriteJoin("\n", es);
        WriteJoin(" ", c);
    }

#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 int[][]ReadUnweightedTree(int n,int origin=1){var gr=new List<int>[n];for(int i=0;i<n;i++)gr[i]=new List<int>();for(int i=0;i<n-1;i++){int u=(int)(Integer()-origin);int v=(int)(Integer()-origin);gr[u].Add(v);gr[v].Add(u);}var g=new int[n][];for(int i=0;i<n;i++)g[i]=gr[i].ToArray();return g;}}}
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