#303912 (C#(csc)) No.762 PDCAパス

• 問題: No.762 PDCAパス
• ユーザー: vis103
• 提出日時: 2018-12-14 15:52:07
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 192 ms / 2,000 ms
• コード長: 3,123 bytes
• コンパイル時間: 2,021 ms
• コンパイル使用メモリ: 114,512 KB
• 実行使用メモリ: 35,644 KB
• 最終ジャッジ日時: 2024-09-25 05:11:04
• 合計ジャッジ時間: 7,184 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 38

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
class Program
{
    static int[] pathCount;
    static void Main()
    {
        Console.SetIn(new System.IO.StreamReader(Console.OpenStandardInput((int)Math.Pow(10,5))));
        string[] arr = Console.ReadLine().Split(' ');
        int N = int.Parse(arr[0]);
        int M = int.Parse(arr[1]);
        string s = Console.ReadLine();
        List<Path> paths = new List<Path>();
        List<int> DCindex = new List<int>();
        pathCount = Enumerable.Repeat(0, N).ToArray();
        for (int i = 0; i < M; i++)
        {
            arr = Console.ReadLine().Split(' ');
            Path p = new Path();
            p.From = int.Parse(arr[0]) - 1;
            p.To = int.Parse(arr[1]) - 1;
            if(s.Substring(p.From, 1) == "P" && s.Substring(p.To, 1) == "D" ||
               s.Substring(p.From, 1) == "D" && s.Substring(p.To, 1) == "C" ||
               s.Substring(p.From, 1) == "C" && s.Substring(p.To, 1) == "A")
            {
                p.From = int.Parse(arr[0]) - 1;
                p.To = int.Parse(arr[1]) - 1;
                paths.Add(p);
                if (s.Substring(p.From, 1) == "P" && s.Substring(p.To, 1) == "D")
                {
                    pathCount[p.To]++;
                }
                else if (s.Substring(p.From, 1) == "D" && s.Substring(p.To, 1) == "C")
                {
                    DCindex.Add(paths.Count - 1);
                }
                else if (s.Substring(p.From, 1) == "C" && s.Substring(p.To, 1) == "A")
                {
                    pathCount[p.From]++;
                }
            }
            else if(s.Substring(p.To, 1) == "P" && s.Substring(p.From, 1) == "D" ||
                    s.Substring(p.To, 1) == "D" && s.Substring(p.From, 1) == "C" ||
                    s.Substring(p.To, 1) == "C" && s.Substring(p.From, 1) == "A")
            {
                p.To = int.Parse(arr[0]) - 1;
                p.From = int.Parse(arr[1]) - 1;
                paths.Add(p);
                if (s.Substring(p.From, 1) == "P" && s.Substring(p.To, 1) == "D")
                {
                    pathCount[p.To]++;
                }
                else if (s.Substring(p.From, 1) == "D" && s.Substring(p.To, 1) == "C")
                {
                    DCindex.Add(paths.Count - 1);
                }
                else if (s.Substring(p.From, 1) == "C" && s.Substring(p.To, 1) == "A")
                {
                    pathCount[p.From]++;
                }
            }
        }
        if(DCindex.Count == 0)
        {
            Console.WriteLine("0");
            return;
        }
        int mod = 1000000007;
        ulong sum = 0;
        for (int i = 0; i < DCindex.Count; i++)
        {
            Path pDC = paths[DCindex[i]];
            
            sum += (ulong)(pathCount[pDC.To] * pathCount[pDC.From]);
            sum %= (ulong)mod;
        }
        
        Console.WriteLine(sum);
    }
}
class Path
{
    public int From { get; set; }
    public int To { get; set; }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX