包含标签:cp 的文章
-
Orange Boy Can You Solve It Out? Ep. 65
Solved Difficulty: D2C 思考题 inspired by Saionji Video Channel Eastmost Eki There are n points on a 2D plane. You can select any real point as pivot in the rectangle bounded by (a,b) and (c,d) and rotate the entire plane by d degree clockwis…… -
Orange Boy Can You Solve It Out? Ep. 64
思考题 inspired by car lanes Car Lane In Ryuto the capital of the Dragon Kingdom, there is an intersection with k+1 exits. On one lane of one exit, there is a queue of n cars. The i-th car in the queue wants to go in the direction d_i (1\leq d_i\le…… -
Orange Boy Can You Solve It Out? Ep. 63
Solved Difficulty: D2C-D2D 思考题 inspired by Create Mod Assembly Line There is an assembly line consisting of n machines. The i-th machine on the line holds an infinitely long input queue and a processing time of t_i seconds. The machines wo…… -
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…… -
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…… -
【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+)…… -
【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+)…… -
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…… -
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……