結果

問題 No.1601 With Animals into Institute
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-10-26 21:09:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,275 ms / 3,000 ms
コード長 5,861 bytes
コンパイル時間 1,161 ms
コンパイル使用メモリ 111,488 KB
実行使用メモリ 77,540 KB
最終ジャッジ日時 2024-04-15 20:24:51
合計ジャッジ時間 19,758 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
19,200 KB
testcase_01 AC 32 ms
19,456 KB
testcase_02 AC 32 ms
19,200 KB
testcase_03 AC 46 ms
22,912 KB
testcase_04 AC 45 ms
22,656 KB
testcase_05 AC 46 ms
22,656 KB
testcase_06 AC 1,177 ms
75,220 KB
testcase_07 AC 1,184 ms
76,004 KB
testcase_08 AC 1,177 ms
76,128 KB
testcase_09 AC 1,275 ms
77,540 KB
testcase_10 AC 1,270 ms
77,288 KB
testcase_11 AC 1,152 ms
77,028 KB
testcase_12 AC 1,162 ms
76,644 KB
testcase_13 AC 1,158 ms
77,012 KB
testcase_14 AC 1,172 ms
76,392 KB
testcase_15 AC 1,163 ms
77,384 KB
testcase_16 AC 1,166 ms
77,148 KB
testcase_17 AC 1,149 ms
75,760 KB
testcase_18 AC 46 ms
22,656 KB
testcase_19 AC 45 ms
22,656 KB
testcase_20 AC 46 ms
22,784 KB
testcase_21 AC 45 ms
22,912 KB
testcase_22 AC 46 ms
22,656 KB
testcase_23 AC 45 ms
22,784 KB
testcase_24 AC 46 ms
22,528 KB
testcase_25 AC 47 ms
22,784 KB
testcase_26 AC 45 ms
22,656 KB
testcase_27 AC 31 ms
19,072 KB
testcase_28 AC 33 ms
19,328 KB
testcase_29 AC 32 ms
19,328 KB
testcase_30 AC 31 ms
19,200 KB
testcase_31 AC 34 ms
19,072 KB
testcase_32 AC 34 ms
19,200 KB
testcase_33 AC 33 ms
19,200 KB
testcase_34 AC 32 ms
19,328 KB
testcase_35 AC 32 ms
19,328 KB
testcase_36 AC 31 ms
19,456 KB
testcase_37 AC 32 ms
19,328 KB
testcase_38 AC 31 ms
19,200 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
static class Program{
	const int mod=(int)1e9+7;
	const long inf=long.MaxValue-1;
	static List<ValueTuple<int,int>>[] li;
	static bool[] b;
	static void Main(){
		Sc sc=new Sc();
		var s=sc.Ia;
		int n=s[0],m=s[1],g=(n<<1)+1;
		li=new List<ValueTuple<int,int>>[g];
		b=new bool[g];
		var c=new long[g];
		for(int i=1;i<g;i++){
			li[i]=new List<ValueTuple<int,int>>();
			c[i]=inf;
		}
		for(int i=0;i<m;i++){
			var e=sc.Ia;
			if(e[3]==0){
				li[e[0]].Add(ValueTuple.Create(e[1],e[2]));
				li[e[1]].Add(ValueTuple.Create(e[0],e[2]));
			}
			else{
				li[e[0]+n].Add(ValueTuple.Create(e[1],e[2]));
				li[e[1]+n].Add(ValueTuple.Create(e[0],e[2]));
			}
			li[e[0]+n].Add(ValueTuple.Create(e[1]+n,e[2]));
			li[e[1]+n].Add(ValueTuple.Create(e[0]+n,e[2]));
		}
		
		var pq=new Rheap<int>(32);
		pq.Push(new Rheap<int>.Dt(0,g-1));
		c[g-1]=0;
		while(pq.cnt>0){
			var e=pq.Dequeue;
			if(b[e.d]){continue;}
			b[e.d]=true;
			for(int i=0;i<li[e.d].Count;i++){
				if(!b[li[e.d][i].Item1]&&c[li[e.d][i].Item1]>li[e.d][i].Item2+e.n){
					pq.Push(new Rheap<int>.Dt(li[e.d][i].Item2+e.n,li[e.d][i].Item1));
					c[li[e.d][i].Item1]=li[e.d][i].Item2+e.n;
				}
			}
		}
		Console.WriteLine("{0}",string.Join("\n",c.Skip(1).Take(n-1)));
	}
	static void Fu(int a,int g){
		b[a]=true;
		for(int i=0;i<li[a].Count;i++){
			if(!b[li[a][i].Item1]){Fu(li[a][i].Item1,g);}
		}
	}
}
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 int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).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 long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).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;}
	public (T,T) Tp2<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]));}
	public (T,T,T) Tp3<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	public (T,T,T,T) Tp4<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	public (T,T,T,T,T) Tp5<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	public (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
}
0