結果
問題 | No.1638 Robot Maze |
ユーザー | fgwiebfaoish |
提出日時 | 2021-08-06 22:52:19 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,874 bytes |
コンパイル時間 | 2,953 ms |
コンパイル使用メモリ | 115,000 KB |
実行使用メモリ | 28,340 KB |
最終ジャッジ日時 | 2024-09-17 03:04:53 |
合計ジャッジ時間 | 5,424 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
17,920 KB |
testcase_01 | AC | 26 ms
17,920 KB |
testcase_02 | AC | 26 ms
18,048 KB |
testcase_03 | AC | 31 ms
20,096 KB |
testcase_04 | AC | 27 ms
17,792 KB |
testcase_05 | AC | 27 ms
18,048 KB |
testcase_06 | AC | 27 ms
18,176 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 28 ms
17,792 KB |
testcase_10 | AC | 28 ms
18,048 KB |
testcase_11 | AC | 27 ms
18,048 KB |
testcase_12 | WA | - |
testcase_13 | AC | 27 ms
18,176 KB |
testcase_14 | WA | - |
testcase_15 | AC | 28 ms
18,688 KB |
testcase_16 | AC | 28 ms
18,816 KB |
testcase_17 | WA | - |
testcase_18 | AC | 28 ms
18,048 KB |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | AC | 30 ms
19,328 KB |
testcase_22 | AC | 29 ms
18,816 KB |
testcase_23 | WA | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | WA | - |
testcase_27 | AC | 30 ms
19,200 KB |
testcase_28 | AC | 29 ms
19,200 KB |
testcase_29 | WA | - |
testcase_30 | AC | 27 ms
18,048 KB |
testcase_31 | AC | 28 ms
17,920 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 30 ms
18,432 KB |
testcase_35 | AC | 30 ms
19,200 KB |
testcase_36 | WA | - |
testcase_37 | AC | 30 ms
19,200 KB |
testcase_38 | WA | - |
testcase_39 | AC | 30 ms
18,816 KB |
testcase_40 | AC | 30 ms
19,072 KB |
testcase_41 | AC | 31 ms
19,456 KB |
testcase_42 | AC | 32 ms
19,584 KB |
testcase_43 | AC | 32 ms
19,712 KB |
testcase_44 | AC | 29 ms
18,560 KB |
testcase_45 | AC | 32 ms
19,584 KB |
testcase_46 | AC | 29 ms
18,816 KB |
testcase_47 | AC | 32 ms
19,712 KB |
testcase_48 | AC | 31 ms
19,072 KB |
testcase_49 | AC | 31 ms
19,200 KB |
testcase_50 | AC | 30 ms
18,816 KB |
testcase_51 | AC | 30 ms
18,688 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; using System.Threading; using System.Runtime.CompilerServices; static class Program{ const int mod=(int)1e9+7; static readonly int[][] di1=new int[][]{new int[]{-1,0},new int[]{1,0},new int[]{0,1},new int[]{0,-1}}; static char[][] bm; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; int h=s[0],w=s[1]; char c='#'; var a=sc.Ia; var t=sc.Ia; int sx=t[0],sy=t[1]; bm=new char[h+2][]; var b=new long[h+2][]; for(int i = 1;i<=h;i++) { bm[i]=(c+sc.S+c).ToCharArray(); b[i]=new long[w+2]; } bm[0]=bm[h+1]=new string(c,w+2).ToCharArray(); b[0]=b[h+1]=new long[w+2]; var pq=new Rheap<(int,int)>(32); pq.Push(new Rheap<(int,int)>.Dt(1,(sy,sx))); b[sy][sx]=1; while(pq.cnt>0){ var e=pq.Dequeue; if(e.d.Item1==t[3]&&e.d.Item2==t[2]){ if(e.n-1>a[4]){ Console.WriteLine("No"); } else{ Console.WriteLine("Yes"); } return; } if(b[e.d.Item1][e.d.Item2]!=e.n){continue;} Fdi(e.d.Item1,e.d.Item2,(y,x,z)=>{ if(bm[y][x]=='.'&&(b[y][x]==0||b[y][x]>e.n+a[z])){ pq.Push(new Rheap<(int,int)>.Dt(e.n+a[z],(y,x))); b[y][x]=e.n+a[z]; } else if(bm[y][x]=='@'&&(b[y][x]==0||b[y][x]>e.n+a[z]+a[5])){ pq.Push(new Rheap<(int,int)>.Dt(e.n+a[z]+a[5],(y,x))); b[y][x]=e.n+a[z]+a[5]; } }); } Console.WriteLine("No"); } static void Fdi(int y,int x,Action<int,int,int> f){for(int i=0;i<4;i++){f(y+di1[i][0],x+di1[i][1],i);}} } public class Rheap<T>{ public class Dt{ public long n; public T d; public Dt(long n,T d){this.n=n;this.d=d;} public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString(); } private const int m=65; private long la=0; private Dt[][] bf; private int[] h; public int cnt=0; public Rheap(int max){ bf=new Dt[m][]; h=new int[m]; for(int i = 0;i<m;i++) {bf[i]=new Dt[max];} } public void Push(Dt x){ int a=x.n!=la?Bsr(la^x.n)+1:0; if(h[a]==bf[a].Length){Extend(a);} bf[a][h[a]]=x; cnt++; h[a]++; } public Dt Peek{get{ if(h[0]==0){ for(int i = 1;i<m;i++) { if(h[i]>0){ int p=0; for(int j = 1;j<h[i];j++) { if(bf[i][p].n>bf[i][j].n){p=j;} } la=bf[i][p].n; for(int j = 0;j<h[i];j++) { Push(bf[i][j]); cnt--; } h[i]=0; break; } } } return bf[0][h[0]-1]; }} public Dt Dequeue{get{ var e=Peek; h[0]--; cnt--; return e; }} private void Extend(int n){ var nhe=new Dt[bf[n].Length<<1]; Array.Copy(bf[n],nhe,bf[n].Length); bf[n]=nhe; } private int Bsr(long b){ int n=0; if(b==0){return -1;} if((b&-4294967296)!=0){b=b&-4294967296;n+=32;} if((b&-281470681808896)!=0){b=b&-281470681808896;n+=16;} if((b&-71777214294589696)!=0){b=b&-71777214294589696;n+=8;} if((b&-1085102592571150096)!=0){b=b&-1085102592571150096;n+=4;} if((b&-3689348814741910324)!=0){b=b&-3689348814741910324;n+=2;} if((b&-6148914691236517206)!=0){n+=1;} return n; } } public class Sc{ public int I{get{return int.Parse(Console.ReadLine());}} public long L{get{return long.Parse(Console.ReadLine());}} public double D{get{return double.Parse(Console.ReadLine());}} public string S{get{return Console.ReadLine();}} public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}} public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}} public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}} public string[] Sa{get{return Console.ReadLine().Split();}} public object[] Oa{get{return Console.ReadLine().Split();}} public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}} public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);} public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}} public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);} public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}} public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);} public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;} public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;} public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;} public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;} }