Skip to main content

AppledoreM's Blog

Category: DFS

BZOJ3036: The Destiny of the LEON

2018-06-282018-06-28 appledorem Leave a comment

Problem Description: There are N nodes and M directed roads with weight in an acyclic graph. At each node, there is a probability of 1 / K to go to each next node, where K number of roads that are connected to current node. Starting at 1, calculate the total expectancy distance to go to […]

Read More

Counter Sama

  • 39972Total Views:
  • 29240Total Vistors:
  • 2018-06-25Counter Sama's Birthday:

Popular Posts

  • Effective C++:Chapter 2 Note
  • Effective C++ : Chapter 4 Note
  • Introduction to Probability and Statistics: Chapter 2
  • String Problems: KMP & Manacher Algorithms
  • Effective C++:Chapter 1 Note
  • Suffix Automaton Review & Study Note
  • Effective C++:Chapter 3 Note
  • AtCoder Regular Contest 103
  • Effective C++ : Chapter 5 Note
  • Codeforces Round514 Div2 D & E

Recent Posts

  • Effective C++ : Chapter 5 Note
  • Effective C++ : Chapter 4 Note
  • Effective C++:Chapter 3 Note
  • Effective C++:Chapter 2 Note
  • Effective C++:Chapter 1 Note

All Categories

AC Automaton AP European History AtCoder Bit Mask BZOJ C++ Codeforces DFS DP Effective C++ Third Edition Note Expectancy Graph Theory Greedy HDU Introduction To Probability and Statistics Introductory Combinatorics LuoGu Math Mathematics Maximum-Flow Minimum Cost Flow Miscellaneous Monotonic Queue Note OI SBT Spanning Tree Counting String Problem Suffix Arrary Tree DP

Friends

  • Menci
  • sparkling Theme by Colorlib Powered by WordPress
     

    Loading Comments...