• ## Green Boy Can't You Solve It Out? Ep. 2

Solved! Difficulty: Div2B 1 problem for div3 participants. Beautiful Dice Painting When Epis is bored, she will draw dices. The canvas contains n*n dots. Initially they are all white. You need to paint exactly v dots black so that the final c……
XGN 2023年10月22日
• ## Orange Boy Can You Solve It Out? Ep.18.5 (the lost obcysio)

Solved! Difficulty: Div2D-Div2E Note: this problem is drafted on 2019/7/30 by XGN and not released. It's now released on 2022/1/2 by Zzzyt under his permission. Statement Yuqi has an rooted indexed tree T of N nodes indexed from 1 to N. The n……
• ## Orange Boy Can You Solve It Out? Ep. 49

思考题 so easy just to prove I am not dead ESL Wulpit is a divine fox spirit. She is learning Chinese. So she doesn't understand English. One day she received an English string S of n lower case characters. XGN told her how her name would be like i……
XGN 2021年12月25日
• ## 【OI的里技#2】vector测速

0.声明 算法第一 常优第二 C++是算法的载体，为算法服务。本系列的目的不在于推崇常优，而是解除OIer对常数的顾虑而专注于算法。 环境 编译参数 语言标准 优化等级 NOIP(2020) i7-8700K @3.70GHz 32GNOI Linux 1.4.1gcc 4.8.4 -lm c++11 O0 NOIP(2021+)……
Zzzyt 2021年11月5日
• ## 【OI的里技#1】常优分析: inline? register?

0.声明 算法第一 常优第二 C++是算法的载体，为算法服务。本系列的目的不在于推崇常优，而是解除OIer对常数的顾虑而专注于算法。 环境 编译参数 语言标准 优化等级 NOIP(2020) i7-8700K @3.70GHz 32GNOI Linux 1.4.1gcc 4.8.4 -lm c++11 O0 NOIP(2021+)……
Zzzyt 2021年10月7日
• ## Orange Boy Can You Solve It Out? Ep. 48

思考题 with git Version Control You are given a DAG with N nodes and M direcitonal edges. Node 1 has 0 in degree. We define a node i is required for node j if i is in any path from 1 to j. You are given Q queries, for each query you are given A and……
XGN 2021年8月25日
• ## Orange Boy Can You Solve It Out? Ep. 47

Solved! Difficulty: Div2D Long time no see 思考题 Tree Traversing Hikari has a tree of N nodes. The node #1 is the root. Initially she is at node 1. She can do one of the following three operations: - Move to any adjacant node with cost 1 - M……
XGN 2021年6月21日
• ## Orange Boy Can You Solve It Out? Ep. 46

chemistry 思考题 Hydrocarbon Ninetail is building a tree. She has N nodes and she will assign a value from 0 to 3 to each node. All nodes with the same value are indistinguishable. Then she will connect the N nodes with N-1 edges so that they form ……
XGN 2021年4月18日
• ## Orange Boy Got Into Province Team!!

MonkeyKing got into Jiangsu Province Team of OI!!! Congratulations!!
XGN 2021年4月15日
• ## Orange Boy Can You Solve It Out? Ep. 41-43

OBCYSIO Ep.41 to 43 is hosted on XGN's blog. As I am lazy to copy, please read them here
XGN 2021年4月14日