結果
問題 | No.1103 Directed Length Sum |
ユーザー | clockln |
提出日時 | 2020-07-21 10:24:34 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 2,248 ms / 3,000 ms |
コード長 | 4,249 bytes |
コンパイル時間 | 1,525 ms |
コンパイル使用メモリ | 68,412 KB |
実行使用メモリ | 134,996 KB |
最終ジャッジ日時 | 2023-08-27 05:28:40 |
合計ジャッジ時間 | 25,405 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 59 ms
20,572 KB |
testcase_01 | AC | 60 ms
20,872 KB |
testcase_02 | AC | 1,454 ms
134,996 KB |
testcase_03 | AC | 1,175 ms
108,100 KB |
testcase_04 | AC | 1,266 ms
84,136 KB |
testcase_05 | AC | 2,248 ms
111,428 KB |
testcase_06 | AC | 788 ms
60,360 KB |
testcase_07 | AC | 205 ms
33,480 KB |
testcase_08 | AC | 288 ms
38,264 KB |
testcase_09 | AC | 141 ms
32,068 KB |
testcase_10 | AC | 404 ms
47,608 KB |
testcase_11 | AC | 1,383 ms
88,856 KB |
testcase_12 | AC | 780 ms
61,516 KB |
testcase_13 | AC | 416 ms
45,784 KB |
testcase_14 | AC | 121 ms
29,064 KB |
testcase_15 | AC | 616 ms
49,380 KB |
testcase_16 | AC | 1,533 ms
90,380 KB |
testcase_17 | AC | 1,605 ms
92,616 KB |
testcase_18 | AC | 403 ms
43,444 KB |
testcase_19 | AC | 1,430 ms
90,756 KB |
testcase_20 | AC | 160 ms
31,716 KB |
testcase_21 | AC | 265 ms
38,352 KB |
testcase_22 | AC | 1,107 ms
69,896 KB |
testcase_23 | AC | 655 ms
55,488 KB |
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; using static System.Console; using static System.Math; public class Solve{ static public int mod = 1000000007; static public string al = "abcdefghijklmnopqrstuvwxyz"; public static void Main(){ // 方針 // var n = rint(); var oya = new int[n]; var kolist = new List<List<int>>(); for(int i=0;i<n;i++){ oya[i] = -1; kolist.Add(new List<int>()); } for(int i=0;i<n-1;i++){ var a = inta(); var a1 = a[0]-1; var a2 = a[1]-1; oya[a2] = a1; kolist[a1].Add(a2); } var depth = new long[n]; var ne = -1; for(int i=0;i<n;i++){ if(oya[i] == -1){ ne = i; break; } } var queue = new Queue<int>(); queue.Enqueue(ne); while(queue.Count > 0){ var de =queue.Dequeue(); for(int i=0;i<kolist[de].Count;i++){ depth[kolist[de][i]] = depth[de]+1; queue.Enqueue(kolist[de][i]); } } long ans = 0; for(int i=0;i<n;i++){ ans = (ans+(depth[i]*(depth[i]+1)/2))%mod; } WriteLine(ans); } public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;} static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;} static int ncr(int n,int r){if(n<r)return 0;r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;} // a^b mod static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;} static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;} //各種読取 static string rstr(){ return ReadLine(); } static int rint(){ return int.Parse(ReadLine()); } static long rlong(){ return long.Parse(ReadLine()); } static string[] stra(){ return ReadLine().Split(' '); } static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();} static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; } static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; } static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; } static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = double.Parse(read_str_array[countup_i]); } return return_double_array; } // ----------------------------- static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } } static long LCM(long a,long b){ return a * b / GCD(a,b); } static void WriteArray(int[,] a,int b,int c){for(int i=0;i<b;i++){for(int j=0;j<c;j++){if(j!=0) Write(" ");Write(a[i,j]);}WriteLine();}} }