搜索内容

包含标签:obcysio 的文章
  • Orange Boy Can You Solve It Out? Ep.8
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.8

    思考题 for stupid myself A well-known task Given N segments [L_i,R_i] with weight W_i. Now you want to choose some segments s_1,s_2,s_3,...,s_k so that |[L_{s_1},R_{s_1}]\cap [L_{s_2},R_{s_2}]\cap ...\cap [L_{s_k},R_{s_k}]|*\sum_{i=1}^kW_{s_i} is m……
    XGN 2019年6月10日
  • Orange Boy Can You Solve It Out? Ep.7
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.7

    unsolvable 思考题 for unsolvable monkey Dragon Bone Reborn As a dragon yourself, it is very hard for you to live for every day there're a lot of knights who want to kill you and your bones are frequently broken. Your bone system can be seen as a un……
    XGN 2019年6月1日
  • Orange Boy Can You Solve It Out? Ep.6
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.6

    思考题 for no one Tour You are given a tree of N nodes. Given another integer array A of length M. Little CMJ chooses M sequences of nodes. The i-th of them is X_1,X_2...X_{A_i} and he chooses them so that for each 1\leq i\leq A_i-1,there's an edge……
    XGN 2019年5月3日
  • Orange Boy Can You Solve It Out? Ep.5
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.5

    思考题 for blue boy Roguelike Tree Statement You are given a tree of N nodes. Each node could be 3 status: passable(.), impassable(X), unknown(?). Now we randomly replace each "unknown" to "passable" or "impassable" then we need to find out the exp……
    XGN 2019年5月3日
  • Orange Boy Can You Solve It Out? Ep.4
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.4

    思考题 for nobody Rougelike Game You are given a graph of N*M grids. Each grid can be a wall 'X',a path'.' or unknown '?' One grid is the start point 'S' and one grid is the end point 'E' Now we change the '?' randomly to 'X' or '.' and run shortes……
    XGN 2019年5月3日
  • Orange Boy Can You Solve It Out? EP.3
    OBCYSIO

    Orange Boy Can You Solve It Out? EP.3

    思考题 for everyone Man on Graph Given a graph of N nodes and M edges. On node i there are A_i men. Then each person moves along 1 edge randomly connected to the node he stands. But if two men walked along the same edge, they'll fight and both die.……
    XGN 2019年4月21日
  • Orange Boy Can You Solve It Out? Ep.2
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.2

    Solved! Difficulty: ?? 思考题 for everyone Man on Graph You are given M chains each of N+1 nodes. We call the i-th node on the j-th chain (j,i-1). We define a bridge edge connecting (a,b) and (c,d) as follows: - a≠c - b=d - b and d don't equa……
    XGN 2019年4月16日
  • Orange Boy Can You Solve It Out? Ep.1
    OBCYSIO

    Orange Boy Can You Solve It Out? Ep.1

    Solved! Difficulty: Div2E 思考题for everyone Dynamic DP You are given: integer arrays A and dp of length N. integer arrays l and r of length N. For each 2\leq i\leq N,1\leq l_i\leq r_i\leq i-1 Known: dp_1=A_1 dp_i=min(dp[l_i,r_i])+A_i for 2\l……
    XGN 2019年4月14日