結果
問題 | No.1480 Many Complete Graphs |
ユーザー |
![]() |
提出日時 | 2021-04-16 23:52:46 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,362 bytes |
コンパイル時間 | 3,463 ms |
コンパイル使用メモリ | 110,720 KB |
実行使用メモリ | 42,612 KB |
最終ジャッジ日時 | 2024-07-03 04:59:37 |
合計ジャッジ時間 | 11,047 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 53 WA * 4 |
コンパイルメッセージ
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; using System.Diagnostics; //using nint=System.Int32; static class Program{ const int mod=(int)1e9+7; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; var h=new int[s[1]][]; var bh=new long[s[1]]; var li=new List<int>[s[0]+1]; const long inf=long.MaxValue>>1; for(int i = 0;i<s[1];i++) { h[i]=sc.Ia; bh[i]=inf; } var c=new long[s[0]+1]; var b=new bool[s[0]+1]; for(int i = 1;i<=s[0];i++) { li[i]=new List<int>(); c[i]=inf; } Array.Sort(h,(u,v)=>u[1]-v[1]); for(int i = 0;i<s[1];i++) { for(int j = 2;j<h[i].Length;j++) {li[h[i][j]].Add(i);} } c[0]=0; var pq=new Rheap<int>(32); pq.Push(new Rheap<int>.Dt(0,1)); 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++) { var p=li[e.d][i]; if(bh[p]<e.n){continue;} for(int j = 2;j<h[p].Length;j++) { if(c[h[p][j]]>e.n+((e.d+h[p][j]+1)>>1)+h[p][1]){ c[h[p][j]]=e.n+((e.d+h[p][j]+1)>>1)+h[p][1]; pq.Push(new Rheap<int>.Dt(c[h[p][j]],h[p][j])); } } bh[p]=e.n; } } Console.WriteLine("{0}",c[s[0]]==inf?-1:c[s[0]]); } } 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(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 (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(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 (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));} }