結果

問題 No.2510 Six Cube Sum Counting
ユーザー crimsontea
提出日時 2023-10-20 22:26:05
言語 C#
(.NET 8.0.404)
結果
WA  
実行時間 -
コード長 2,991 bytes
コンパイル時間 9,867 ms
コンパイル使用メモリ 168,664 KB
実行使用メモリ 332,780 KB
最終ジャッジ日時 2024-09-20 20:00:43
合計ジャッジ時間 64,953 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3 WA * 1
other AC * 17 WA * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (98 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 #
プレゼンテーションモードにする

#nullable enable
using System;
using System.Linq;
using System.Collections;
using System.IO;
using System.Collections.Generic;
using System.Text;
using System.Numerics;
using System.Runtime.Intrinsics.X86;
using System.Buffers;
using System.Diagnostics;
using System.Runtime.CompilerServices;
using static InputUtility;
class Program
{
    static void Main()
    {
        InputNewLine();
        var x = NextInt32;
        List<(int v, int c)> abc = new();
        for (int a = 0; a <= 300; a++)
        {
            for (int b = a; b <= 300; b++)
            {
                for (int c = b; c <= 300; c++)
                {
                    abc.Add((a * a * a + b * b * b + c * c * c, c));
                }
            }
        }
        var def = Def();
        static (int v, int d)[] Def()
        {
            List<(int v, int d)> def = new();
            for (int a = 0; a <= 300; a++)
            {
                for (int b = a; b <= 300; b++)
                {
                    for (int c = b; c <= 300; c++)
                    {
                        def.Add((a * a * a + b * b * b + c * c * c, a));
                    }
                }
            }
            return def.ToArray();
        }
        Array.Sort(def);
        int res = 0;
        foreach (var (v, c) in abc)
        {
            var target = x - v;
            var index = ~Array.BinarySearch(def, (target, -1));
            while (index < def.Length && target == def[index].v && c <= def[index].d)
            {
                res++;
                index++;
            }
        }
        Console.WriteLine(res);
    }
}
public static class InputUtility
{
    private static string[]? s_inputs;
    private static string? s_raw;
    private static int s_index = 0;
    private static void Init() => s_index = 0;
    public static int NextInt32 => int.Parse(s_inputs![s_index++]!);
    public static uint NextUInt32 => uint.Parse(s_inputs![s_index++]!);
    public static long NextInt64 => long.Parse(s_inputs![s_index++]!);
    public static string NextString => s_inputs![s_index++];
    public static char NextChar => s_inputs![s_index++][0];
    public static int[] GetInt32Array() => s_inputs!.Select(int.Parse).ToArray();
    public static long[] GetInt64Array() => s_inputs!.Select(long.Parse).ToArray();
    public static string GetRawString() => s_raw!;
#if DEBUG
    private static TextReader? s_textReader;
    public static void SetSource(string path) => s_textReader = new StringReader(File.ReadAllText(path));
#endif
    public static bool InputNewLine()
    {
#if DEBUG
        if (s_textReader is TextReader sr)
        {
            Init();
            s_raw = sr.ReadLine()!;
            s_inputs = s_raw.Split(' ', StringSplitOptions.RemoveEmptyEntries);
            return true;
        }
#endif
        Init();
        s_raw = Console.ReadLine()!;
        s_inputs = s_raw.Split(' ', StringSplitOptions.RemoveEmptyEntries);
        return true;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0