結果
問題 | No.468 役に立つ競技プログラミング実践編 |
ユーザー | eitaho |
提出日時 | 2016-12-20 14:14:06 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 664 ms / 2,000 ms |
コード長 | 4,033 bytes |
コンパイル時間 | 4,686 ms |
コンパイル使用メモリ | 116,252 KB |
実行使用メモリ | 70,016 KB |
最終ジャッジ日時 | 2023-08-21 03:11:57 |
合計ジャッジ時間 | 15,521 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
21,912 KB |
testcase_01 | AC | 69 ms
21,832 KB |
testcase_02 | AC | 69 ms
21,704 KB |
testcase_03 | AC | 70 ms
21,684 KB |
testcase_04 | AC | 69 ms
21,828 KB |
testcase_05 | AC | 70 ms
23,844 KB |
testcase_06 | AC | 70 ms
21,744 KB |
testcase_07 | AC | 71 ms
21,836 KB |
testcase_08 | AC | 70 ms
23,888 KB |
testcase_09 | AC | 70 ms
21,860 KB |
testcase_10 | AC | 70 ms
21,716 KB |
testcase_11 | AC | 71 ms
19,708 KB |
testcase_12 | AC | 70 ms
23,772 KB |
testcase_13 | AC | 70 ms
21,732 KB |
testcase_14 | AC | 75 ms
23,756 KB |
testcase_15 | AC | 75 ms
21,832 KB |
testcase_16 | AC | 74 ms
21,804 KB |
testcase_17 | AC | 74 ms
21,804 KB |
testcase_18 | AC | 73 ms
21,672 KB |
testcase_19 | AC | 73 ms
21,708 KB |
testcase_20 | AC | 75 ms
21,720 KB |
testcase_21 | AC | 75 ms
21,700 KB |
testcase_22 | AC | 74 ms
23,776 KB |
testcase_23 | AC | 74 ms
21,776 KB |
testcase_24 | AC | 660 ms
66,080 KB |
testcase_25 | AC | 655 ms
68,132 KB |
testcase_26 | AC | 664 ms
68,348 KB |
testcase_27 | AC | 645 ms
68,204 KB |
testcase_28 | AC | 647 ms
68,128 KB |
testcase_29 | AC | 644 ms
68,256 KB |
testcase_30 | AC | 646 ms
66,132 KB |
testcase_31 | AC | 647 ms
70,016 KB |
testcase_32 | AC | 657 ms
66,124 KB |
testcase_33 | AC | 652 ms
65,928 KB |
testcase_34 | AC | 262 ms
53,820 KB |
testcase_35 | AC | 72 ms
23,788 KB |
testcase_36 | AC | 69 ms
21,856 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.IO; using System.Linq; using System.Text; using System.Text.RegularExpressions; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; public class Program { public void Solve() { int N = Reader.Int(), M = Reader.Int(); var E = Enu.Range(0, N).Select(i => new List<int>()).ToArray(); var Ecost = Enu.Range(0, N).Select(i => new List<int>()).ToArray(); foreach (var e in Reader.IntTable(M)) { E[e[0]].Add(e[1]); Ecost[e[0]].Add(e[2]); } var topo = TopologicalSort(E); var time = new int[N]; foreach (int a in topo) for (int i = 0; i < E[a].Count; i++) CheckMax(ref time[E[a][i]], time[a] + Ecost[a][i]); var atmost = Enu.Repeat(int.MaxValue, N).ToArray(); atmost[N - 1] = time[N - 1]; foreach (int a in topo.Reverse<int>()) for (int i = 0; i < E[a].Count; i++) CheckMin(ref atmost[a], atmost[E[a][i]] - Ecost[a][i]); int count = atmost.Where((t, i) => t > time[i]).Count(); Console.WriteLine(time[N - 1] + " " + count + "/" + N); } bool CheckMax(ref int a, int b) { if (b > a) { a = b; return true; } return false; } bool CheckMin(ref int a, int b) { if (b < a) { a = b; return true; } return false; } int[] TopologicalSort(List<int>[] E) { var sorted = new List<int>(); var mark = new byte[E.Length]; var stack = new Stack<int>(); for (int v = E.Length - 1; v >= 0; v--) if (mark[v] == 0) { stack.Push(v); while (stack.Count > 0) { int a = stack.Pop(); if (a < 0) { sorted.Add(~a); mark[~a] = 2; continue; } if (mark[a] == 1) return null; // has cycle if (mark[a] == 2) continue; mark[a] = 1; stack.Push(~a); for (int i = E[a].Count - 1; i >= 0; i--) stack.Push(E[a][i]); } } sorted.Reverse(); return sorted.ToArray(); } } class Entry { static void Main() { new Program().Solve(); } } class Reader { static TextReader reader = Console.In; static readonly char[] separator = { ' ' }; static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; static string[] A = new string[0]; static int i; static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Range(N, Int); } public static int[][] IntTable(int H) { return Range(H, IntLine); } public static string[] StringArray(int N) { return Range(N, Next); } public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); } public static string Line() { return reader.ReadLine().Trim(); } public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } static string[] Split(string s) { return s.Split(separator, op); } static string Next() { CheckNext(); return A[i++]; } static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }