結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー fgwiebfaoish
提出日時 2020-12-17 02:39:06
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 895 ms / 2,000 ms
コード長 4,771 bytes
コンパイル時間 859 ms
コンパイル使用メモリ 114,388 KB
実行使用メモリ 51,136 KB
最終ジャッジ日時 2024-09-20 06:05:07
合計ジャッジ時間 12,718 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
static class Program{
const int mod=(int)1e9+7;
const long inf=long.MaxValue>>1;
static List<ValueTuple<int,int,int>>[] li;
static void Main(){
Sc sc=new Sc();
var t=sc.I;
var s=sc.Ia;
int n=s[0],m=s[1];
li=new List<ValueTuple<int,int,int>>[n+1];
var b=new int[n+1];
var h=new int[m][];
var c=new long[n+1];
for(int i=1;i<=n;i++){
li[i]=new List<ValueTuple<int,int,int>>();
b[i]=-1;
}
for(int i=0;i<m;i++){
h[i]=sc.Ia;
li[h[i][0]].Add(ValueTuple.Create(h[i][1],h[i][2],i));
if(t==0){li[h[i][1]].Add(ValueTuple.Create(h[i][0],h[i][2],i));}
}
long ans=inf;
for(int k = 0;k<m;k++) {
for(int i=1;i<=n;i++){c[i]=inf;}
var pq=new Rheap<int>(64);
pq.Push(new Rheap<int>.Dt(0,h[k][1]));
c[h[k][1]]=0;
while(pq.cnt>0){
var e=pq.Dequeue;
if(e.d==h[k][0]){
ans=Min(h[k][2]+e.n,ans);
break;
}
if(b[e.d]==k){continue;}
b[e.d]=k;
for(int i=0;i<li[e.d].Count;i++){
if(b[li[e.d][i].Item1]!=k&&li[e.d][i].Item3!=k&&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}",ans==inf?-1: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(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).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 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;}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0