結果

問題 No.20 砂漠のオアシス
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2020-04-02 04:54:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 70 ms / 5,000 ms
コード長 5,954 bytes
コンパイル時間 3,331 ms
コンパイル使用メモリ 111,872 KB
実行使用メモリ 26,368 KB
最終ジャッジ日時 2024-06-27 17:25:49
合計ジャッジ時間 4,277 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.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 nint=System.Int32;
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 readonly int[][] di2=new int[][]{new int[]{-1,-1},new int[]{-1,0},new int[]{-1,1},new int[]{0,-1},new int[]{0,1},new int[]{1,-1},new int[]{1,0},new int[]{1,1}};
	static void Main(){
		Sc sc=new Sc();
		var s=sc.Ia;
		int h=s[0],w=s[0];
		var bm=new int[h+2][];
		var b=new bool[h+2][];
		var c=new int[h+2][];
		var d=new int[h+2][];
		var qu=new Queue<Tuple<int,int,int>>();
		for(int i = 1;i<=h;i++) {
			bm[i]=sc.Ia3(true,-1,true,-1);
			c[i]=new int[w+2];
			d[i]=new int[w+2];
			b[i]=new bool[w+1];
			for(int j = 1;j<=w;j++) {c[i][j]=d[i][j]=mod;}
		}
		bm[0]=bm[h+1]=Enumerable.Repeat(-1,w+2).ToArray();
		c[0]=c[h+1]=d[0]=d[h+1]=new int[w+2];
		var pq=new Rheap<Tuple<int,int>>(32);
		pq.Push(new Rheap<Tuple<int,int>>.Dt(0,Tuple.Create(1,1)));
		while(pq.cnt>0){
			var e=pq.Dequeue;
			if(b[e.d.Item1][e.d.Item2]){continue;}
			b[e.d.Item1][e.d.Item2]=true;
			Fdi(e.d.Item1,e.d.Item2,(y,x)=>{
				if(bm[y][x]!=-1&&c[y][x]>e.n+bm[y][x]){
					pq.Push(new Rheap<Tuple<int,int>>.Dt(e.n+bm[y][x],Tuple.Create(y,x)));
					c[y][x]=e.n+bm[y][x];
				}
			});
		}
		if(s[2]==0){
			Console.WriteLine("{0}",c[s[0]][s[0]]<s[1]?"YES":"NO");
			return;
		}
		for(int i = 1;i<=h;i++) {b[i]=new bool[w+1];}
		pq=new Rheap<Tuple<int,int>>(32);
		pq.Push(new Rheap<Tuple<int,int>>.Dt(0,Tuple.Create(s[3],s[2])));
		while(pq.cnt>0){
			var e=pq.Dequeue;
			if(b[e.d.Item1][e.d.Item2]){continue;}
			b[e.d.Item1][e.d.Item2]=true;
			Fdi(e.d.Item1,e.d.Item2,(y,x)=>{
				if(bm[y][x]!=-1&&d[y][x]>e.n+bm[y][x]){
					pq.Push(new Rheap<Tuple<int,int>>.Dt(e.n+bm[y][x],Tuple.Create(y,x)));
					d[y][x]=e.n+bm[y][x];
				}
			});
		}
		Console.WriteLine("{0}",(c[s[0]][s[0]]<s[1]||(s[1]>c[s[3]][s[2]]&&((s[1]-c[s[3]][s[2]])<<1)-d[s[0]][s[0]]>0))?"YES":"NO");
	}
	static void Fdi(int y,int x,Action<int,int> f){for(int i=0;i<4;i++){f(y+di1[i][0],x+di1[i][1]);}}
}
public class Rheap<T>{
	public class Dt{
		public nint n;
		public T d;
		public Dt(nint n,T d){this.n=n;this.d=d;}
		public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString();
	}
	private const int m=33;
	private nint 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&-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){b=b&-6148914691236517206;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(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
	public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
	public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
	public double[] Da3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),double.Parse);}
	public double[] Da3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).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;}
}
0