結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-01-31 04:42:28
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 525 ms / 2,500 ms
コード長 7,027 bytes
コンパイル時間 2,644 ms
コンパイル使用メモリ 111,700 KB
実行使用メモリ 44,840 KB
最終ジャッジ日時 2023-09-11 01:06:36
合計ジャッジ時間 18,986 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
14,832 KB
testcase_01 AC 63 ms
14,852 KB
testcase_02 AC 64 ms
14,848 KB
testcase_03 AC 63 ms
14,912 KB
testcase_04 AC 67 ms
14,944 KB
testcase_05 AC 64 ms
14,972 KB
testcase_06 AC 63 ms
14,924 KB
testcase_07 AC 66 ms
15,008 KB
testcase_08 AC 86 ms
20,608 KB
testcase_09 AC 74 ms
17,836 KB
testcase_10 AC 87 ms
19,604 KB
testcase_11 AC 82 ms
20,108 KB
testcase_12 AC 87 ms
19,592 KB
testcase_13 AC 337 ms
31,740 KB
testcase_14 AC 455 ms
29,508 KB
testcase_15 AC 441 ms
31,444 KB
testcase_16 AC 345 ms
27,092 KB
testcase_17 AC 200 ms
29,808 KB
testcase_18 AC 516 ms
36,412 KB
testcase_19 AC 518 ms
36,528 KB
testcase_20 AC 517 ms
36,608 KB
testcase_21 AC 525 ms
36,528 KB
testcase_22 AC 518 ms
36,528 KB
testcase_23 AC 159 ms
24,460 KB
testcase_24 AC 172 ms
21,052 KB
testcase_25 AC 318 ms
26,864 KB
testcase_26 AC 466 ms
30,564 KB
testcase_27 AC 375 ms
27,300 KB
testcase_28 AC 247 ms
24,932 KB
testcase_29 AC 366 ms
27,208 KB
testcase_30 AC 250 ms
25,092 KB
testcase_31 AC 191 ms
24,772 KB
testcase_32 AC 298 ms
25,520 KB
testcase_33 AC 452 ms
29,484 KB
testcase_34 AC 438 ms
30,624 KB
testcase_35 AC 436 ms
32,500 KB
testcase_36 AC 480 ms
32,136 KB
testcase_37 AC 304 ms
25,872 KB
testcase_38 AC 418 ms
26,176 KB
testcase_39 AC 417 ms
26,280 KB
testcase_40 AC 422 ms
26,164 KB
testcase_41 AC 421 ms
26,308 KB
testcase_42 AC 417 ms
26,232 KB
testcase_43 AC 256 ms
36,080 KB
testcase_44 AC 230 ms
30,796 KB
testcase_45 AC 244 ms
44,840 KB
testcase_46 AC 82 ms
27,864 KB
testcase_47 AC 63 ms
14,860 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;
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 s=sc.Ia;
		int n=s[0]+1,m=s[1];
		li=new List<ValueTuple<int,int,int>>[n+1];
		for(int i=1;i<=n;i++){li[i]=new List<ValueTuple<int,int,int>>();}
		for(int i=0;i<m;i++){
			var e=sc.Ia;
			li[e[0]+1].Add(ValueTuple.Create(e[1]+1,e[2],e[3]));
		}
		var Tp=new Tp(li);
		if(Tp.ba[n]){
			var qu=new Queue<ValueTuple<int,int>>();
			qu.Enqueue(ValueTuple.Create(1,0));
			var b=new bool[n+1];
			while(qu.Count>0){
				var e=qu.Dequeue();
				if(b[e.Item1]){continue;}
				b[e.Item1]=true;
				for(int j = 0;j<li[e.Item1].Count;j++) {
					if(!b[li[e.Item1][j].Item1]){qu.Enqueue(ValueTuple.Create(li[e.Item1][j].Item1,e.Item2+1));}
				}
			}
			Console.WriteLine(b[n]?"INF":"0");
			return;
		}
		var dp1=new Mint[n+1];
		var dp2=new Mint[n+1];
		dp2[1]=1;
		for(int i = 0;i < n;i++) {
			for(int j = 0;j < li[Tp.a2[i]].Count;j++) {
				dp1[li[Tp.a2[i]][j].Item1]+=dp2[Tp.a2[i]]*li[Tp.a2[i]][j].Item3*li[Tp.a2[i]][j].Item2+dp1[Tp.a2[i]]*li[Tp.a2[i]][j].Item3;
				dp2[li[Tp.a2[i]][j].Item1]+=dp2[Tp.a2[i]]*li[Tp.a2[i]][j].Item3;
			}
		}
		Console.WriteLine(dp1[n]);
	}
}
public class Tp{
	public int[] a1,a2;
	public bool[] ba;
	public bool bo=false;
	public Tp(List<(int,int,int)>[] li){
		int n=li.Length;
		var b=new int[n];
		a1=new int[n];
		a2=new int[n-1];
		ba=new bool[n];
		var k=n-1;
		var thread=new Thread(new ThreadStart(()=>{
			for(int i=n-1;i>0;i--) {if(b[i]==0){Fu(i);}}
			void Fu(int a) {
				b[a]=2;
				for(int i=0;i<li[a].Count;i++){
					if(b[li[a][i].Item1]==0){Fu(li[a][i].Item1);}
					else if(b[li[a][i].Item1]==2){ba[a]=ba[li[a][i].Item1]=bo=true;}
				}
				a1[a]=k;
				a2[--k]=a;
				b[a]=1;
			}
		}),1<<27);
		thread.Start();
		thread.Join();
		for(int i=0;i<a2.Length;i++) {
			for(int j = 0;j<li[a2[i]].Count;j++) {ba[li[a2[i]][j].Item1]|=ba[a2[i]];}
		}
	}
}
public struct Mint{
	const int mod=(int)1e9+7;
	private long d;
	public Mint(long d){this.d=d;}
	public static implicit operator Mint(long d){return new Mint(d%mod);}
	public static explicit operator long(Mint d){return d.d;}
	public override string ToString(){return d.ToString();}
	public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;}
	public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
	public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;}
	public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
	public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;}
	public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;}
	public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;}
	public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;}
	public static bool operator==(Mint a,long b){return (long)a==b;}
	public static bool operator!=(Mint a,long b){return (long)a!=b;}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
	public static long Mi(long a){
		a=(a+mod)%mod;
		long b=mod,u=1,v=0;
		while(b>0){
			long t=a/b;
			a-=t*b;(a,b)=(b,a);
			u-=t*v;(u,v)=(v,u);
		}
		u%=mod;
		if(u<0){u+=mod;}
		return u%mod;
	}
}
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;}
}
public class Sct{
	private StreamReader sr;
	public Sct(string t){sr=new StreamReader(t);}
	public int I{get{return int.Parse(sr.ReadLine());}}
	public long L{get{return long.Parse(sr.ReadLine());}}
	public double D{get{return double.Parse(sr.ReadLine());}}
	public string S{get{return sr.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(sr.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(sr.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(sr.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return sr.ReadLine().Split();}}
	public object[] Oa{get{return sr.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+sr.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll((a+sr.ReadLine()+b).Split(),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll((sr.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+sr.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll((a+sr.ReadLine()+b).Split(),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll((sr.ReadLine()+" "+a.ToString()).Split(),long.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(sr.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,sr.ReadLine().Split());}return a;}
}
0