結果
| 問題 | No.5017 Tool-assisted Shooting |
| ユーザー |
 KumaTachiRen
|
| 提出日時 | 2023-07-16 18:29:56 |
| 言語 | C# (.NET 8.0.203) |
| 結果 |
AC
|
| 実行時間 | 1,376 ms / 2,000 ms |
| コード長 | 18,156 bytes |
| コンパイル時間 | 10,426 ms |
| コンパイル使用メモリ | 145,284 KB |
| 実行使用メモリ | 66,896 KB |
| スコア | 2,944,879 |
| 平均クエリ数 | 1229.57 |
| 最終ジャッジ日時 | 2023-07-16 18:32:35 |
| 合計ジャッジ時間 | 147,819 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge17 |
| 純コード判定しない問題か言語 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,140 ms
60,984 KB |
| testcase_01 | AC | 1,317 ms
62,304 KB |
| testcase_02 | AC | 1,297 ms
59,084 KB |
| testcase_03 | AC | 1,185 ms
61,576 KB |
| testcase_04 | AC | 1,303 ms
58,148 KB |
| testcase_05 | AC | 1,311 ms
59,824 KB |
| testcase_06 | AC | 1,306 ms
61,568 KB |
| testcase_07 | AC | 1,346 ms
61,684 KB |
| testcase_08 | AC | 1,314 ms
63,032 KB |
| testcase_09 | AC | 1,216 ms
62,016 KB |
| testcase_10 | AC | 1,334 ms
59,724 KB |
| testcase_11 | AC | 1,328 ms
58,324 KB |
| testcase_12 | AC | 1,313 ms
56,096 KB |
| testcase_13 | AC | 1,267 ms
61,648 KB |
| testcase_14 | AC | 1,320 ms
62,060 KB |
| testcase_15 | AC | 1,293 ms
58,164 KB |
| testcase_16 | AC | 1,309 ms
57,764 KB |
| testcase_17 | AC | 1,269 ms
62,168 KB |
| testcase_18 | AC | 1,321 ms
60,140 KB |
| testcase_19 | AC | 1,338 ms
62,804 KB |
| testcase_20 | AC | 1,351 ms
57,908 KB |
| testcase_21 | AC | 1,376 ms
58,516 KB |
| testcase_22 | AC | 1,260 ms
57,880 KB |
| testcase_23 | AC | 1,329 ms
58,440 KB |
| testcase_24 | AC | 1,310 ms
61,236 KB |
| testcase_25 | AC | 1,333 ms
59,828 KB |
| testcase_26 | AC | 1,177 ms
59,184 KB |
| testcase_27 | AC | 1,311 ms
55,316 KB |
| testcase_28 | AC | 1,359 ms
62,620 KB |
| testcase_29 | AC | 1,346 ms
60,184 KB |
| testcase_30 | AC | 1,303 ms
56,160 KB |
| testcase_31 | AC | 1,337 ms
59,136 KB |
| testcase_32 | AC | 1,316 ms
59,904 KB |
| testcase_33 | AC | 1,345 ms
59,048 KB |
| testcase_34 | AC | 1,331 ms
57,760 KB |
| testcase_35 | AC | 1,321 ms
58,896 KB |
| testcase_36 | AC | 1,321 ms
57,552 KB |
| testcase_37 | AC | 1,140 ms
61,640 KB |
| testcase_38 | AC | 1,327 ms
61,844 KB |
| testcase_39 | AC | 1,358 ms
60,852 KB |
| testcase_40 | AC | 1,310 ms
60,952 KB |
| testcase_41 | AC | 1,295 ms
60,204 KB |
| testcase_42 | AC | 1,084 ms
59,280 KB |
| testcase_43 | AC | 1,366 ms
60,036 KB |
| testcase_44 | AC | 1,360 ms
56,992 KB |
| testcase_45 | AC | 1,195 ms
64,064 KB |
| testcase_46 | AC | 1,332 ms
61,688 KB |
| testcase_47 | AC | 1,175 ms
62,288 KB |
| testcase_48 | AC | 1,186 ms
65,044 KB |
| testcase_49 | AC | 1,360 ms
55,788 KB |
| testcase_50 | AC | 1,325 ms
64,568 KB |
| testcase_51 | AC | 1,307 ms
63,772 KB |
| testcase_52 | AC | 1,312 ms
60,988 KB |
| testcase_53 | AC | 1,240 ms
60,288 KB |
| testcase_54 | AC | 1,321 ms
58,908 KB |
| testcase_55 | AC | 1,333 ms
59,488 KB |
| testcase_56 | AC | 1,317 ms
61,924 KB |
| testcase_57 | AC | 1,298 ms
59,620 KB |
| testcase_58 | AC | 1,326 ms
56,032 KB |
| testcase_59 | AC | 1,348 ms
62,096 KB |
| testcase_60 | AC | 1,150 ms
60,116 KB |
| testcase_61 | AC | 1,258 ms
60,484 KB |
| testcase_62 | AC | 1,329 ms
59,036 KB |
| testcase_63 | AC | 1,350 ms
58,820 KB |
| testcase_64 | AC | 1,300 ms
59,700 KB |
| testcase_65 | AC | 1,272 ms
66,896 KB |
| testcase_66 | AC | 1,300 ms
61,100 KB |
| testcase_67 | AC | 1,309 ms
60,260 KB |
| testcase_68 | AC | 1,271 ms
61,340 KB |
| testcase_69 | AC | 1,292 ms
63,112 KB |
| testcase_70 | AC | 1,319 ms
60,572 KB |
| testcase_71 | AC | 1,181 ms
60,596 KB |
| testcase_72 | AC | 1,331 ms
60,124 KB |
| testcase_73 | AC | 1,355 ms
57,096 KB |
| testcase_74 | AC | 1,238 ms
57,008 KB |
| testcase_75 | AC | 1,309 ms
57,416 KB |
| testcase_76 | AC | 1,128 ms
64,832 KB |
| testcase_77 | AC | 1,286 ms
61,772 KB |
| testcase_78 | AC | 1,296 ms
60,096 KB |
| testcase_79 | AC | 1,326 ms
59,560 KB |
| testcase_80 | AC | 1,316 ms
57,464 KB |
| testcase_81 | AC | 1,192 ms
60,136 KB |
| testcase_82 | AC | 1,251 ms
64,228 KB |
| testcase_83 | AC | 1,358 ms
63,328 KB |
| testcase_84 | AC | 1,305 ms
58,204 KB |
| testcase_85 | AC | 1,308 ms
62,000 KB |
| testcase_86 | AC | 1,082 ms
62,724 KB |
| testcase_87 | AC | 1,323 ms
59,452 KB |
| testcase_88 | AC | 1,238 ms
62,548 KB |
| testcase_89 | AC | 1,202 ms
63,604 KB |
| testcase_90 | AC | 1,327 ms
58,160 KB |
| testcase_91 | AC | 1,138 ms
62,908 KB |
| testcase_92 | AC | 1,357 ms
59,568 KB |
| testcase_93 | AC | 1,320 ms
62,656 KB |
| testcase_94 | AC | 1,302 ms
59,360 KB |
| testcase_95 | AC | 1,285 ms
60,836 KB |
| testcase_96 | AC | 1,321 ms
58,424 KB |
| testcase_97 | AC | 1,324 ms
57,520 KB |
| testcase_98 | AC | 1,355 ms
56,660 KB |
| testcase_99 | AC | 1,257 ms
61,356 KB |
コンパイルメッセージ
Determining projects to restore... Restored /home/judge/data/code/main.csproj (in 160 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/
ソースコード
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][];
for (int i = 0; i < width; i++)
{
enemy[i] = new (long health, long power, long point)[height];
for (int j = 0; j < height; j++) enemy[i][j] = (0, 0, 0);
}
int player_pos = 12;
long score = 0;
long power_sum = 0;
var move_queue = new Queue<int>();
var pow3 = new long[40];
pow3[0] = 1;
for (int i = 0; i + 1 < pow3.Length; i++) pow3[i + 1] = pow3[i] * 3;
var history = new Stack<(int x, int y, (long, long, long))>();
(long score, long power) SafeAttack(int x, int y, long lvl)
{
history.Push((x, y, enemy[x][y]));
var (h, p, pt) = enemy[x][y];
long r1 = 0, r2 = 0;
if (h <= lvl)
{
r1 = pt;
r2 = p;
h = 0;
p = 0;
pt = 0;
}
else
{
h -= lvl;
}
enemy[x][y] = (h, p, pt);
return (r1, r2);
}
void SafeAttackUndo()
{
if (history.Count > 0)
{
var (u, v, p) = history.Pop();
enemy[u][v] = p;
}
}
void SafeAttackReset()
{
while (history.Count > 0)
{
var (u, v, p) = history.Pop();
enemy[u][v] = p;
}
}
int turn = 0;
for (; turn < max_turn; turn++)
{
long level = 1 + power_sum / 100;
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);
}
}
{
if (move_queue.Count == 0)
{
const int period = 16, div = 4;
const int beam_size = 60;
const int reflect_turn = 8;
const long score_scale = 100;
var best_list = new List<(long s, long score)>() { (0, 0) };
long prod = 1;
for (int time = 0; time < period; time += div)
{
var next_list = new List<(long s, long score)>();
foreach (var (s, bscore) in best_list)
{
int x = player_pos;
long sc = 0, pw = power_sum;
for (int t = 0; t < time; t++)
{
int d = (int)((s / pow3[t]) % 3 - 1);
sc -= Math.Abs(d);
x = SafeMod(x + d, width);
int z = t;
while (z < height && enemy[x][z].health == 0) z++;
if (z < height)
{
var res = SafeAttack(x, z, 1 + pw / 100);
sc += res.score * score_scale;
pw += res.power;
}
}
for (int ns = 0; ns < pow3[div]; ns++)
{
int y = x;
long nsc = sc, npw = power_sum;
int attackcnt = 0;
bool ok = true;
for (int t = 0; t < div; t++)
{
int d = (int)((ns / pow3[t]) % 3 - 1);
nsc -= Math.Abs(d);
y = SafeMod(y + d, width);
if (enemy[y][time + t].health > 0)
{
ok = false;
break;
}
int z = time + t;
while (z < height && enemy[y][z].health == 0) z++;
if (z < height)
{
var res = SafeAttack(y, z, 1 + npw / 100);
attackcnt++;
nsc += res.score * score_scale;
npw += res.power;
}
if (enemy[y][time + t + 1].health > 0)
{
ok = false;
break;
}
}
for (int i = 0; i < attackcnt; i++) SafeAttackUndo();
if (ok) next_list.Add((s + prod * ns, nsc));
}
SafeAttackReset();
}
best_list = new List<(long s, long score)>();
next_list.Sort((p1, p2) => -Sign(p1.score - p2.score));
for (int i = 0; i < next_list.Count && i < beam_size; i++)
best_list.Add(next_list[i]);
prod *= pow3[div];
}
if (best_list.Count > 0)
{
long best = best_list[0].s;
for (int t = 0; t < reflect_turn; t++)
{
int d = (int)((best / pow3[t]) % 3 - 1);
move_queue.Enqueue(d);
}
}
}
int move = 0;
if (move_queue.Count > 0) move = move_queue.Dequeue();
else Write("# :(");
{
int next_pos = SafeMod(player_pos + move, width);
if (enemy[next_pos][0].health > 0 || enemy[next_pos][1].health > level)
{
for (int d = -1; d <= 1; d++)
{
int y = SafeMod(player_pos + d, width);
if (enemy[y][0].health == 0 && enemy[y][1].health <= level)
{
move = d;
Write($"# dodge time: {turn} pos: {player_pos} -> {y}");
break;
}
}
}
}
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)
{
Write($"# crash 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;
Write($"# defeat time: {turn} pos: {player_pos} point: {pt} score: {score}");
h = 0;
p = 0;
pt = 0;
}
else
{
h -= level;
}
enemy[player_pos][i] = (h, p, pt);
break;
}
}
}
WriteError($"Turn: {turn}, 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");
}