結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-01-31 04:18:59
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,883 bytes
コンパイル時間 2,316 ms
コンパイル使用メモリ 110,336 KB
実行使用メモリ 52,220 KB
最終ジャッジ日時 2024-06-28 15:18:22
合計ジャッジ時間 16,286 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
17,792 KB
testcase_01 AC 27 ms
17,664 KB
testcase_02 AC 27 ms
17,792 KB
testcase_03 AC 27 ms
17,792 KB
testcase_04 AC 27 ms
17,920 KB
testcase_05 AC 27 ms
17,408 KB
testcase_06 AC 28 ms
17,920 KB
testcase_07 AC 27 ms
17,664 KB
testcase_08 AC 49 ms
23,424 KB
testcase_09 AC 38 ms
20,608 KB
testcase_10 AC 52 ms
22,272 KB
testcase_11 AC 46 ms
23,040 KB
testcase_12 AC 53 ms
22,528 KB
testcase_13 AC 310 ms
34,040 KB
testcase_14 AC 444 ms
31,868 KB
testcase_15 AC 424 ms
33,788 KB
testcase_16 AC 321 ms
29,424 KB
testcase_17 AC 172 ms
31,988 KB
testcase_18 AC 504 ms
38,908 KB
testcase_19 AC 509 ms
38,776 KB
testcase_20 AC 498 ms
38,772 KB
testcase_21 AC 495 ms
38,656 KB
testcase_22 AC 492 ms
38,656 KB
testcase_23 AC 124 ms
27,264 KB
testcase_24 AC 134 ms
23,220 KB
testcase_25 AC 293 ms
30,976 KB
testcase_26 AC 436 ms
34,560 KB
testcase_27 AC 336 ms
30,848 KB
testcase_28 AC 213 ms
28,800 KB
testcase_29 AC 328 ms
28,800 KB
testcase_30 AC 216 ms
28,928 KB
testcase_31 AC 156 ms
27,776 KB
testcase_32 AC 266 ms
27,136 KB
testcase_33 AC 408 ms
33,536 KB
testcase_34 AC 401 ms
34,604 KB
testcase_35 WA -
testcase_36 AC 453 ms
37,504 KB
testcase_37 AC 278 ms
26,624 KB
testcase_38 AC 394 ms
28,416 KB
testcase_39 AC 394 ms
28,160 KB
testcase_40 AC 393 ms
28,416 KB
testcase_41 AC 405 ms
28,416 KB
testcase_42 AC 400 ms
28,288 KB
testcase_43 AC 232 ms
38,140 KB
testcase_44 AC 205 ms
32,888 KB
testcase_45 AC 231 ms
52,220 KB
testcase_46 AC 48 ms
30,080 KB
testcase_47 AC 26 ms
17,408 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]){
			Console.WriteLine("INF");
			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;
		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){
					ba[li[a][i].Item1]|=ba[a];
					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;
		}
		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;}
}
0