結果
問題 | No.788 トラックの移動 |
ユーザー | fgwiebfaoish |
提出日時 | 2020-03-09 12:33:55 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,534 ms / 2,000 ms |
コード長 | 5,708 bytes |
コンパイル時間 | 974 ms |
コンパイル使用メモリ | 116,552 KB |
実行使用メモリ | 39,744 KB |
最終ジャッジ日時 | 2024-05-08 23:03:25 |
合計ジャッジ時間 | 9,860 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,533 ms
39,732 KB |
testcase_01 | AC | 29 ms
17,920 KB |
testcase_02 | AC | 28 ms
17,920 KB |
testcase_03 | AC | 29 ms
18,304 KB |
testcase_04 | AC | 386 ms
31,104 KB |
testcase_05 | AC | 1,514 ms
39,744 KB |
testcase_06 | AC | 1,534 ms
39,560 KB |
testcase_07 | AC | 29 ms
18,176 KB |
testcase_08 | AC | 29 ms
18,176 KB |
testcase_09 | AC | 28 ms
18,048 KB |
testcase_10 | AC | 29 ms
18,176 KB |
testcase_11 | AC | 28 ms
18,048 KB |
testcase_12 | AC | 29 ms
17,920 KB |
testcase_13 | AC | 28 ms
17,920 KB |
testcase_14 | AC | 28 ms
17,920 KB |
testcase_15 | AC | 709 ms
39,632 KB |
testcase_16 | AC | 662 ms
39,632 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; static class Program{ const int mod=(int)1e9+7; static List<Tuple<int,int>>[] li; static bool[] b; static long[] c; static int[] ca; static long f=0,p,sum=0; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; int n=s[0],m=s[1]; li=new List<Tuple<int,int>>[n+1]; b=new bool[n+1]; c=new long[n+1]; var h=new long[n+1]; ca=sc.Ia2; for(int i=1;i<=n;i++){ li[i]=new List<Tuple<int,int>>(); c[i]=long.MaxValue; sum+=ca[i]; } for(int i=0;i<m;i++){ var e=sc.Ia; li[e[0]].Add(Tuple.Create(e[1],e[2])); li[e[1]].Add(Tuple.Create(e[0],e[2])); } var pq=new Rheap<int>(32); pq.Push(new Rheap<int>.Dt(0,s[2])); c[s[2]]=0; while(pq.cnt>0){ var e=pq.Dequeue; if(b[e.d]){continue;} b[e.d]=true; if(ca[e.d]==sum){ Console.WriteLine(0); return; } 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; } } } long ans=long.MaxValue; for(int j = 1;j<=n;j++) { h=new long[n+1]; b=new bool[n+1]; p=int.MinValue; f=0; pq=new Rheap<int>(32); pq.Push(new Rheap<int>.Dt(1,j)); h[j]=0; while(pq.cnt>0){ var e=pq.Dequeue; if(b[e.d]){continue;} if(ca[e.d]>0){ p=Max(p,e.n-1-c[e.d]); f+=(e.n-1)*ca[e.d]*2; } b[e.d]=true; for(int i=0;i<li[e.d].Count;i++){ if(!b[li[e.d][i].Item1]&&(h[li[e.d][i].Item1]==0||h[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)); h[li[e.d][i].Item1]=li[e.d][i].Item2+e.n; } } } ans=Min(ans,f-p); } Console.WriteLine("{0}",ans); } } 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){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;} }