• ## 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

思考题 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

思考题 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日
• ## JSOI 2019 Diary Round 2 Day 1

JSOI 2019 Diary Day 4 又是一场噩梦…… Problem A 一道毒瘤题的样子？读了2遍才把题目读懂……然后发现就不会做了。先去做T2了。 Problem B 我一看，和我出给300iq的神秘题目一样吗？不过要计数，难度瞬间上去了……10分的状压DP还是蛮好写的，然后写了20分的排列组合WA掉……
XGN 2019年4月28日
• ## JSOI 2019 Diary Round 2 Day 0

JSOI 2019 Diary Day 3 第一轮烤考炸掉了我又厚颜无耻充满希望的回来啦！这次比赛是2019/4/28日在熟悉的南航举行。今天是试机日……本来不打算来的，但是试机可以不上HBHB说晚上不上课来试机，于是我就来了。 preInit(); 来得太早，人家还在上课……只能在教室外面等。看……
XGN 2019年4月27日
• ## Red boy can you solve it?

Rong Kong is a filial boy. There are N pears on the table. Both he and his brother can eat them. They both want to eat as much as they can. Each of them weighs a[i]. It costs a[i] time for a boy to eat a pear weighing a[i] and it gives him a[i] sat……
MonkeyKing 2019年4月22日
• ## 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

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

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日
• ## Codeforces Round #551 (Div.2)

Member: Chairman Jing, XGN, ZJS, XZM, ZHD Also In: Dummy Rong,HTC Problem Solver FST A All ZHD(hacked) B All None C All ZHD(unfinished) D Chairman Jing ZHD(unfinished) E Unsolved F Unsolved
XGN 2019年4月13日