結果
問題 | No.762 PDCAパス |
ユーザー | りあん |
提出日時 | 2018-12-12 00:17:28 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,602 bytes |
コンパイル時間 | 1,114 ms |
コンパイル使用メモリ | 119,816 KB |
実行使用メモリ | 40,720 KB |
最終ジャッジ日時 | 2024-09-24 17:36:56 |
合計ジャッジ時間 | 6,260 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
25,152 KB |
testcase_01 | AC | 29 ms
24,908 KB |
testcase_02 | AC | 30 ms
27,212 KB |
testcase_03 | AC | 29 ms
26,888 KB |
testcase_04 | AC | 29 ms
25,104 KB |
testcase_05 | AC | 29 ms
25,132 KB |
testcase_06 | AC | 29 ms
27,072 KB |
testcase_07 | AC | 29 ms
24,980 KB |
testcase_08 | AC | 29 ms
27,072 KB |
testcase_09 | AC | 29 ms
25,172 KB |
testcase_10 | AC | 29 ms
24,776 KB |
testcase_11 | AC | 29 ms
22,836 KB |
testcase_12 | AC | 29 ms
26,888 KB |
testcase_13 | AC | 29 ms
25,100 KB |
testcase_14 | AC | 29 ms
25,024 KB |
testcase_15 | AC | 29 ms
25,156 KB |
testcase_16 | AC | 29 ms
24,972 KB |
testcase_17 | AC | 29 ms
27,080 KB |
testcase_18 | AC | 29 ms
22,840 KB |
testcase_19 | AC | 29 ms
27,076 KB |
testcase_20 | AC | 29 ms
25,112 KB |
testcase_21 | AC | 29 ms
24,976 KB |
testcase_22 | AC | 124 ms
29,296 KB |
testcase_23 | AC | 124 ms
29,296 KB |
testcase_24 | AC | 195 ms
40,720 KB |
testcase_25 | AC | 182 ms
38,672 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 180 ms
38,416 KB |
testcase_29 | AC | 178 ms
40,588 KB |
testcase_30 | AC | 171 ms
36,760 KB |
testcase_31 | AC | 171 ms
34,976 KB |
testcase_32 | AC | 170 ms
34,848 KB |
testcase_33 | AC | 159 ms
33,076 KB |
testcase_34 | AC | 162 ms
35,124 KB |
testcase_35 | AC | 170 ms
35,244 KB |
testcase_36 | AC | 149 ms
29,968 KB |
testcase_37 | AC | 147 ms
30,216 KB |
testcase_38 | AC | 146 ms
30,224 KB |
testcase_39 | AC | 145 ms
30,228 KB |
testcase_40 | AC | 145 ms
34,324 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.Linq.Expressions; using System.IO; using static util; using P = pair<int, int>; using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.BinaryExpression>; using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>; class Program { static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; static Scan sc = new Scan(); const int M = 1000000007; const int M2 = 998244353; const long LM = (long)1e18; const double eps = 1e-11; static readonly int[] dd = { 0, 1, 0, -1, 0 }; const string dstring = "RDLU"; static void Main() { int n, m; sc.Multi(out n, out m); var s = sc.Str; var edge = new List<int>[n]; var cnt = new long[n]; var q = new Queue<int>(); for (int i = 0; i < n; i++) { edge[i]= new List<int>(); if (s[i] == 'P') { ++cnt[i]; q.Enqueue(i); } } var dic = new int[128]; dic['P'] = 0; dic['D'] = 1; dic['C'] = 2; dic['A'] = 3; for (int i = 0; i < m; i++) { int a, b; sc.Multi(out a, out b); --a; --b; if (dic[s[a]] + 1 == dic[s[b]]) edge[a].Add(b); if (dic[s[b]] + 1 == dic[s[a]]) edge[b].Add(a); } while (q.Any()) { int p = q.Dequeue(); foreach (var item in edge[p]) { if (cnt[item] == 0) q.Enqueue(item); cnt[item] += cnt[p]; } } long ans = 0; for (int i = 0; i < n; i++) { if (s[i] == 'A') ans += cnt[i]; } Prt(ans); sw.Flush(); } static void DBG(string a) => Console.WriteLine(a); static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a)); static void DBG(params object[] a) => DBG(string.Join(" ", a)); static void Prt(string a) => sw.WriteLine(a); static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a)); static void Prt(params object[] a) => Prt(string.Join(" ", a)); } class pair<T, U> : IComparable<pair<T, U>> { public T v1; public U v2; public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(pair<T, U> a) { int c = Comparer<T>.Default.Compare(v1, a.v1); return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2); } public override string ToString() => v1 + " " + v2; public void Deconstruct(out T a, out U b) { a = v1; b = v2; } } static class util { public static pair<T, T> make_pair<T>(this IList<T> l) => make_pair(l[0], l[1]); public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2); public static T sq<T>(T a) => Operator<T>.Multiply(a, a); public static T Max<T>(params T[] a) => a.Max(); public static T Min<T>(params T[] a) => a.Min(); public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w; public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; } public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy<T>(this IList<T> a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } } static class Operator<T> { static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x"); static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y"); public static readonly Func<T, T, T> Add = Lambda(Expression.Add); public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract); public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply); public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide); public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus); public static readonly Func<T, T> Negate = Lambda(Expression.Negate); public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile(); public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile(); } class Scan { public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => Console.ReadLine().Trim(); public pair<T, U> Pair<T, U>() where T : IComparable<T> where U : IComparable<U> { T a; U b; Multi(out a, out b); return new pair<T, U>(a, b); } public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries); bool eq<T, U>() => typeof(T).Equals(typeof(U)); T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)) : eq<T, long>() ? ct<T, long>(long.Parse(s)) : eq<T, double>() ? ct<T, double>(double.Parse(s)) : eq<T, char>() ? ct<T, char>(s[0]) : ct<T, string>(s); public void Multi<T>(out T a) => a = cv<T>(Str); public void Multi<T, U>(out T a, out U b) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); } public void Multi<T, U, V>(out T a, out U b, out V c) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); } public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); } public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); } public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]); } }