結果

問題 No.376 立方体のN等分 (2)
ユーザー EmKjpEmKjp
提出日時 2016-06-05 00:13:18
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 5,249 bytes
コンパイル時間 1,102 ms
コンパイル使用メモリ 118,340 KB
実行使用メモリ 45,308 KB
最終ジャッジ日時 2024-10-08 13:09:18
合計ジャッジ時間 8,720 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 115 ms
34,944 KB
testcase_01 AC 117 ms
34,816 KB
testcase_02 AC 116 ms
34,944 KB
testcase_03 AC 117 ms
34,944 KB
testcase_04 RE -
testcase_05 AC 115 ms
34,944 KB
testcase_06 AC 115 ms
35,072 KB
testcase_07 AC 115 ms
35,072 KB
testcase_08 RE -
testcase_09 AC 117 ms
35,072 KB
testcase_10 AC 135 ms
35,072 KB
testcase_11 RE -
testcase_12 AC 117 ms
34,944 KB
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 AC 403 ms
34,816 KB
testcase_17 AC 118 ms
35,072 KB
testcase_18 RE -
testcase_19 AC 116 ms
35,200 KB
testcase_20 RE -
testcase_21 AC 398 ms
35,072 KB
testcase_22 AC 116 ms
35,200 KB
testcase_23 AC 403 ms
35,072 KB
testcase_24 AC 360 ms
34,944 KB
testcase_25 AC 115 ms
35,072 KB
testcase_26 AC 416 ms
34,816 KB
testcase_27 RE -
testcase_28 AC 116 ms
35,072 KB
testcase_29 RE -
testcase_30 AC 116 ms
34,944 KB
testcase_31 RE -
testcase_32 AC 116 ms
34,944 KB
testcase_33 AC 117 ms
34,944 KB
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 AC 118 ms
35,072 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;


partial class Solver {
    public class Factor {
        public long Prime;
        public long Count;
        public List<long> Pows = new List<long>();
    }

    public class PrimeSet : List<int> {
        private bool[] isPrime;

        public PrimeSet(int size)
            : base() {
            isPrime = Enumerable.Repeat(true, size).ToArray();
            Add(2);
            for (int i = 3; i <= size; i += 2) {
                if (!isPrime[i >> 1]) continue;
                Add(i);
                for (long j = (long)i * i; j <= size; j += i + i)
                    isPrime[j >> 1] = false;
            }
        }

        public bool IsPrime(long x) {
            if (x == 2) return true;
            if (x <= 1 || x % 2 == 0) return false;
            return isPrime[x >> 1];
        }
    }

    static public List<Factor> Factorization(PrimeSet primes, long x) {
        var ret = new List<Factor>();

        foreach (var p in primes) {
            if (x % p == 0) {
                int count = 0;
                var factor = new Factor();
                long pow = 1;
                factor.Pows.Add(pow);
                while (x % p == 0) {
                    count++;
                    x /= p;
                    pow *= p;
                    factor.Pows.Add(pow);
                }
                factor.Prime = p;
                factor.Count = count;
                ret.Add(factor);
            }
        }

        if (x > 1) ret.Add(new Factor { Prime = x, Count = 1 });

        return ret;
    }

    long Solve(List<Factor> factors, int pos = 0, long a = 1, long b = 1, long c = 1) {
        if (pos == factors.Count) {
            return a + b + c - 3;
        } else {
            var prime = factors[pos].Prime;
            var count = factors[pos].Count;
            var pows = factors[pos].Pows;
            long result = long.MaxValue;
            for (int x = 0; x <= count; x++) {
                for (int y = 0; x + y <= count; y++) {
                    int z = (int)(count - x - y);
                    var sub = Solve(factors, pos + 1, a * pows[x], b * pows[y], c * pows[z]);
                    result = Math.Min(sub, result);
                }
            }
            return result;
        }
    }

    public void Run() {
        var N = nl();
        long tmin = long.MaxValue, tmax = 0;

        var primeSet = new PrimeSet(10000010);
        var factors = Factorization(primeSet, N);

        tmin = Solve(factors);
        tmax = N - 1;

        cout.WriteLine(string.Format("{0} {1}", tmin, tmax));
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0