結果

問題 No.5017 Tool-assisted Shooting
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-07-16 15:13:34
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 156 ms / 2,000 ms
コード長 15,173 bytes
コンパイル時間 13,085 ms
コンパイル使用メモリ 150,704 KB
実行使用メモリ 48,636 KB
スコア 797,108
平均クエリ数 526.18
最終ジャッジ日時 2023-07-16 15:14:04
合計ジャッジ時間 24,119 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 134 ms
46,512 KB
testcase_01 AC 87 ms
44,888 KB
testcase_02 AC 122 ms
45,928 KB
testcase_03 AC 89 ms
45,132 KB
testcase_04 AC 124 ms
46,080 KB
testcase_05 AC 110 ms
45,584 KB
testcase_06 AC 123 ms
45,468 KB
testcase_07 AC 109 ms
46,052 KB
testcase_08 AC 115 ms
46,156 KB
testcase_09 AC 136 ms
46,616 KB
testcase_10 AC 123 ms
45,936 KB
testcase_11 AC 107 ms
45,776 KB
testcase_12 AC 121 ms
46,100 KB
testcase_13 AC 104 ms
45,656 KB
testcase_14 AC 124 ms
48,016 KB
testcase_15 AC 123 ms
47,968 KB
testcase_16 AC 118 ms
46,028 KB
testcase_17 AC 100 ms
45,444 KB
testcase_18 AC 124 ms
46,332 KB
testcase_19 AC 92 ms
47,296 KB
testcase_20 AC 96 ms
45,860 KB
testcase_21 AC 127 ms
46,564 KB
testcase_22 AC 121 ms
46,184 KB
testcase_23 AC 155 ms
48,564 KB
testcase_24 AC 152 ms
46,636 KB
testcase_25 AC 123 ms
45,880 KB
testcase_26 AC 156 ms
48,568 KB
testcase_27 AC 114 ms
45,708 KB
testcase_28 AC 155 ms
46,688 KB
testcase_29 AC 155 ms
47,008 KB
testcase_30 AC 143 ms
46,840 KB
testcase_31 AC 116 ms
45,972 KB
testcase_32 AC 122 ms
45,872 KB
testcase_33 AC 86 ms
45,476 KB
testcase_34 AC 111 ms
45,360 KB
testcase_35 AC 120 ms
45,868 KB
testcase_36 AC 122 ms
45,972 KB
testcase_37 AC 126 ms
46,252 KB
testcase_38 AC 97 ms
45,200 KB
testcase_39 AC 129 ms
46,484 KB
testcase_40 AC 127 ms
45,988 KB
testcase_41 AC 141 ms
45,924 KB
testcase_42 AC 104 ms
47,620 KB
testcase_43 AC 154 ms
46,476 KB
testcase_44 AC 135 ms
46,304 KB
testcase_45 AC 107 ms
46,140 KB
testcase_46 AC 98 ms
45,512 KB
testcase_47 AC 152 ms
46,556 KB
testcase_48 AC 102 ms
45,540 KB
testcase_49 AC 94 ms
46,828 KB
testcase_50 AC 87 ms
45,368 KB
testcase_51 AC 110 ms
45,668 KB
testcase_52 AC 134 ms
45,764 KB
testcase_53 AC 103 ms
45,896 KB
testcase_54 AC 98 ms
47,720 KB
testcase_55 AC 126 ms
46,272 KB
testcase_56 AC 85 ms
45,432 KB
testcase_57 AC 92 ms
47,240 KB
testcase_58 AC 95 ms
45,312 KB
testcase_59 AC 150 ms
46,396 KB
testcase_60 AC 89 ms
44,848 KB
testcase_61 AC 97 ms
45,464 KB
testcase_62 AC 121 ms
45,728 KB
testcase_63 AC 145 ms
46,492 KB
testcase_64 AC 96 ms
45,456 KB
testcase_65 AC 113 ms
45,536 KB
testcase_66 AC 156 ms
46,340 KB
testcase_67 AC 155 ms
48,448 KB
testcase_68 AC 87 ms
46,844 KB
testcase_69 AC 123 ms
46,264 KB
testcase_70 AC 86 ms
44,788 KB
testcase_71 AC 133 ms
46,172 KB
testcase_72 AC 117 ms
45,716 KB
testcase_73 AC 103 ms
45,340 KB
testcase_74 AC 154 ms
46,832 KB
testcase_75 AC 133 ms
45,788 KB
testcase_76 AC 114 ms
47,268 KB
testcase_77 AC 114 ms
45,652 KB
testcase_78 AC 116 ms
45,480 KB
testcase_79 AC 123 ms
45,688 KB
testcase_80 AC 100 ms
45,412 KB
testcase_81 AC 91 ms
45,416 KB
testcase_82 AC 133 ms
46,024 KB
testcase_83 AC 92 ms
47,556 KB
testcase_84 AC 139 ms
46,076 KB
testcase_85 AC 150 ms
46,216 KB
testcase_86 AC 127 ms
46,036 KB
testcase_87 AC 86 ms
47,436 KB
testcase_88 AC 106 ms
45,556 KB
testcase_89 AC 121 ms
46,072 KB
testcase_90 AC 139 ms
46,528 KB
testcase_91 AC 93 ms
45,392 KB
testcase_92 AC 123 ms
47,840 KB
testcase_93 AC 152 ms
48,636 KB
testcase_94 AC 95 ms
47,124 KB
testcase_95 AC 126 ms
45,996 KB
testcase_96 AC 113 ms
45,844 KB
testcase_97 AC 143 ms
46,580 KB
testcase_98 AC 156 ms
48,372 KB
testcase_99 AC 105 ms
45,020 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 119 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

diff # 

using System;
using System.ComponentModel;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.Intrinsics.X86;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    const int width = 25;
    const int height = 60;
    const int max_turn = 1000;

    void Solve()
    {
        var enemy = new (long health, long power, long point)[width, height];
        for (int i = 0; i < width; i++)
            for (int j = 0; j < height; j++)
                enemy[i, j] = (0, 0, 0);

        int Dist(int x, int y) => Math.Min(Math.Abs(x - y), Math.Min(Math.Abs(x - y - width), Math.Abs(x - y + width)));

        int player_pos = 12;
        long score = 0;
        long power_sum = 0;

        int target = -1;
        long target_pt = 0, target_time = 10000000;

        for (int turn = 0; turn < max_turn; turn++)
        {

            long level = 1 + power_sum / 100;

            if (target != -1 && enemy[target, 0].health > 0) target = -1;
            for (int i = 0; i < width; i++)
            {
                for (int j = 0; j + 1 < height; j++)
                    enemy[i, j] = enemy[i, j + 1];
                enemy[i, height - 1] = (0, 0, 0);
            }

            {
                int n = ri;
                if (n == -1) break;

                for (int i = 0; i < n; i++)
                {
                    int h = ri, p = ri, x = ri;
                    enemy[x, height - 1] = (h, p, h);
                }
            }

            {
                {

                    var dp = new bool[width, height];
                    dp[player_pos, 0] = true;
                    for (int time = 0; time + 1 < height; time++)
                    {

                        for (int x = 0; x < width; x++)
                        {
                            for (int diff = -1; diff <= 1; diff++)
                            {
                                int y = SafeMod(x + diff, width);
                                if (enemy[y, time + 1].health > 0) continue;
                                dp[y, time + 1] |= dp[x, time];
                            }
                        }
                    }

                    int best = -1;
                    long best_pt = 0, best_time = 10000;
                    for (int x = 0; x < width; x++)
                    {
                        var near = enemy[x, 0];
                        int limit_time = 0;
                        for (int i = 0; i < height; i++)
                            if (enemy[x, i].health > 0)
                            {
                                near = enemy[x, i];
                                limit_time = i;
                                break;
                            }

                        int start_time = 0;
                        while (start_time < height && !dp[x, start_time]) start_time++;
                        if (start_time >= limit_time) continue;
                        long time = start_time + Ceil(near.health, level);
                        if (time > limit_time) continue;
                        if ((best_pt * time < near.point * best_time)
                            || (best_pt * time == near.point * best_time && time < best_time))
                        {
                            best = x;
                            best_pt = near.point;
                            best_time = time;
                        }
                    }
                    if (target == -1)
                    {
                        target = best;
                        target_pt = best_pt;
                        target_time = best_time;
                    }
                    else
                    {
                        if (best != -1)
                        {
                            if (best_pt * target_time > target_pt * best_time * 3)
                            {
                                target = best;
                                target_pt = best_pt;
                                target_time = best_time;
                            }
                        }
                    }
                }

                int move = 0;
                if (target != -1)
                {
                    if (target != player_pos)
                    {
                        move = (Dist(player_pos - 1, target) < Dist(player_pos, target)) ? -1 : 1;
                    }
                }
                else
                {

                }

                if (move == -1) WriteFlush("L");
                if (move == 0) WriteFlush("S");
                if (move == 1) WriteFlush("R");
                player_pos = SafeMod(player_pos + move, width);
            }

            if (enemy[player_pos, 0].health > 0)
            {
                WriteError($"[!] time: {turn} pos: {player_pos}");
                break;
            }

            for (int i = 0; i < height; i++)
            {
                if (enemy[player_pos, i].health > 0)
                {
                    var (h, p, pt) = enemy[player_pos, i];
                    if (h <= level)
                    {
                        power_sum += p;
                        score += pt;
                        WriteError($"time: {turn} pos: {player_pos} point: {pt} score: {score}");
                        target = -1;
                        h = 0;
                        p = 0;
                        pt = 0;
                    }
                    else
                    {
                        h -= level;
                    }
                    enemy[player_pos, i] = (h, p, pt);
                    break;
                }
            }
        }
        WriteError($"Score: {score}");
    }

    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());
}

public static class Functions
{
    [MethodImpl(256)]
    public static int Popcount(ulong x)
    {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL);
        x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL);
        x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL);
        x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL);
        return (int)x;
    }
    [MethodImpl(256)]
    public static int Popcount(int x)
    {
        x = (x & 0x55555555) + ((x >> 1) & 0x55555555);
        x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
        x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f);
        x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff);
        x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff);
        return x;
    }
    [MethodImpl(256)]
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    [MethodImpl(256)]
    public static int CeilPow2(int n)
    {
        int x = 0;
        while ((1 << x) < n) x++;
        return x;
    }
    [MethodImpl(256)]
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + Math.Abs(m) : r;
    }
    [MethodImpl(256)]
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + Math.Abs(m) : r;
    }
    [MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(256)] public static int Sign(double x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(256)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(256)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(256)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(256)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound<long>(arr.AsSpan(), t => Sign(t - val), l, r);
    public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound<int>(arr.AsSpan(), t => t - val, l, r);
    public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r);
    public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (data.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = data.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(data[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static string ToBase2(long v, int digit = -1)
    {
        if (digit == -1)
        {
            digit = 0;
            while ((v >> digit) > 0) digit++;
        }
        var c = new string[digit];
        for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1";
        return string.Join("", c);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static string ToBaseN(long v, int n, int digit = -1)
    {
        if (digit == -1)
        {
            digit = 0;
            long pow = 1;
            while (v >= pow) { digit++; pow *= n; }
        }
        var c = new int[digit];
        for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n);
        return string.Join("", c);
    }
}

public 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 = 0;
        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; byte b = 0; var ng = false;
        do b = read();
        while (b != '-' && (b < '0' || '9' < b));
        if (b == '-') { ng = true; b = read(); }
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ng ? -ret : ret;
            else ret = ret * 10 + b - '0';
        }
    }
    [MethodImpl(256)]
    public ulong UInteger()
    {
        ulong ret = 0; byte b = 0;
        do b = read();
        while (b < '0' || '9' < b);
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ret;
            else ret = ret * 10 + b - '0';
        }
    }
    [MethodImpl(256)]
    public double Double() => double.Parse(Scan());
}

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)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var b = new T[sz2];
            for (int j = 0; j < sz2; j++) b[j] = a[i, j];
            WriteJoin(" ", b);
        }
    }
    [MethodImpl(256)] public static void WriteMat<T>(T[][] a) { for (int i = 0; i < a.Length; i++) WriteJoin(" ", a[i]); }
    [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str);
    [MethodImpl(256)] public static void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [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");
}
0