#731143 (C#(csc)) No.1812 Uribo Road

提出ソース

結果

問題	No.1812 Uribo Road
コンテスト
ユーザー	fgwiebfaoish
提出日時	2022-01-15 00:35:23
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	291 ms / 5,000 ms
コード長	9,198 bytes
コンパイル時間	1,127 ms
コンパイル使用メモリ	115,684 KB
実行使用メモリ	41,216 KB
最終ジャッジ日時	2024-11-20 16:53:28
合計ジャッジ時間	5,464 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

ファイルパターン	結果
sample	AC * 4
other	AC * 30

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

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 (n,m,g)=sc.Tp3<int>();
		g<<=1;
		var r=sc.Ia;
		li=new List<ValueTuple<int,int>>[n+1];
		var c=new long[g][];
		for(int i = 0;i<g;i++) {c[i]=new long[n+1];}
		for(int i=1;i<=n;i++){
			li[i]=new List<ValueTuple<int,int>>();
			for(int j = 0;j<g;j++) {c[j][i]=inf;}
		}
		var h=new int[m+1][];
		for(int i=1;i<=m;i++){
			h[i]=sc.Ia;
			li[h[i][0]].Add(ValueTuple.Create(h[i][1],h[i][2]));
			li[h[i][1]].Add(ValueTuple.Create(h[i][0],h[i][2]));
		}
		for(int k = 0;k<g;k++) {
			b=new bool[n+1];
			var pq=new Rheap<int>(32);
			pq.Push(new Rheap<int>.Dt(0,h[r[k>>1]][k&1]));
			c[k][h[r[k>>1]][k&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[k][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[k][li[e.d][i].Item1]=li[e.d][i].Item2+e.n;
					}
				}
			}
		}
		int f=1<<(g>>1);
		var dp=new long[g>>1][][];
		for(int i = 0;i<g>>1;i++) {
			dp[i]=new long[f][];
			for(int j = 0;j<f;j++) {
				if(Pc(j)!=i+1){continue;}
				dp[i][j]=new long[g];
				for(int k = 0;k<g;k++) {dp[i][j][k]=inf;}
				if(i==0){
					for(int k = 0;k<g>>1;k++) {
						if(((j>>k)&1)==1){
							dp[i][j][k<<1]=c[(k<<1)+1][1]+h[r[k]][2];
							dp[i][j][(k<<1)+1]=c[k<<1][1]+h[r[k]][2];
							break;
						}
					}
				}
				else{
					for(int k = 0;k<g>>1;k++) {
						if(((j>>k)&1)==1){
							for(int l = 0;l<g>>1;l++) {
								if(((j>>l)&1)==1&&l!=k){
									dp[i][j][k<<1]=Min(dp[i][j][k<<1],dp[i-1][j-(1<<k)][l<<1]+c[(k<<1)+1][h[r[l]][0]]+h[r[k]][2]);
									dp[i][j][k<<1]=Min(dp[i][j][k<<1],dp[i-1][j-(1<<k)][(l<<1)+1]+c[(k<<1)+1][h[r[l]][1]]+h[r[k]][2]);
									dp[i][j][(k<<1)+1]=Min(dp[i][j][(k<<1)+1],dp[i-1][j-(1<<k)][l<<1]+c[k<<1][h[r[l]][0]]+h[r[k]][2]);
									dp[i][j][(k<<1)+1]=Min(dp[i][j][(k<<1)+1],dp[i-1][j-(1<<k)][(l<<1)+1]+c[k<<1][h[r[l]][1]]+h[r[k]][2]);
								}
							}
						}
					}
				}
			}
		}
		long ans=inf;
		for(int i = 0;i<g;i++) {
			ans=Min(ans,dp[(g>>1)-1][f-1][i]+c[i][n]);
			ans=Min(ans,dp[(g>>1)-1][f-1][i]+c[i][n]);
		}
		Console.WriteLine("{0}",ans);
	}
	static int Pc(long bits){
		bits=(bits&0x55555555)+(bits>>1&0x55555555);
		bits=(bits&0x33333333)+(bits>>2&0x33333333);
		bits=(bits&0x0f0f0f0f)+(bits>>4&0x0f0f0f0f);
		bits=(bits&0x00ff00ff)+(bits>>8&0x00ff00ff);
		return (int)((bits&0x0000ffff)+(bits>>16&0x0000ffff));
	}
	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{
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string Rl(){return Console.ReadLine();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string[] Sp(string st){return st.Split();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
	public virtual int I{get{return int.Parse(Rl());}}
	public virtual long L{get{return long.Parse(Rl());}}
	public virtual double D{get{return double.Parse(Rl());}}
	public virtual string S{get{return Rl();}}
	public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}}
	public string[] Sa{get{return Sp(Rl());}}
	public object[] Oa{get{return Sp(Rl());}}
	public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),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(Sp(Rl()));}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,Sp(Rl()));}return a;}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
}
public class Scs:Sc{
	private StreamReader sr;
	public Scs(string t){sr=new StreamReader(t);}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){return sr.ReadLine();}
}
public class Sc2:Sc{
	private string[] sps=new string[]{" ","　","\t"};
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);}
	public override int I{get{return int.Parse(Sp(Rl())[0]);}}
	public override long L{get{return long.Parse(Sp(Rl())[0]);}}
	public override double D{get{return double.Parse(Sp(Rl())[0]);}}
	public override string S{get{return Sp(Rl())[0];}}
}
public class Scs2:Sc2{
	private StreamReader sr;
	public Scs2(string t){sr=new StreamReader(t);}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){return sr.ReadLine();}
}
public class Sct:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	public void Add(int s){li.Add(s.ToString());}
	public void Add(long s){li.Add(s.ToString());}
	public void Add(double s){li.Add(s.ToString());}
	public void Add(string s){li.Add(s.ToString());}
	public void Add(object s){li.Add(s.ToString());}
	public void Add(int[] s){li.Add(string.Join(" ",s));}
	public void Add(long[] s){li.Add(string.Join(" ",s));}
	public void Add(double[] s){li.Add(string.Join(" ",s));}
	public void Add(string[] s){li.Add(string.Join(" ",s));}
	public void Add(object[] s){li.Add(string.Join(" ",s));}
	protected override string Rl(){return li[l++];}
	public void Clear(){li.Clear();l=0;}
}

yukicoder

結果

コンパイルメッセージ

ソースコード