Original link: https://www.shuizilong.com/house/archives/shlug-monthly-afterstory/ I was very happy to participate in SHLUG Monthly’s monthly sharing last week. . https://ift.tt/g5veN9D I have forgotten when was the last time I went out. . It was also very exciting for me to meet so many friends again. . (Of course, it seems that this activity has just resumed, because …
Original link: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-281/ #AtCoder Beginner Contest 281 – [https://atcoder.jp/contests/abc281/tasks](https://atcoder.jp/contests/abc281/tasks) ## C Classic two stacks. ##D Backpack. ## E. Classic Tire tree DP. ## G. Combine dp. The game reads: dp[i][j][k]: the first i layer uses j vertices, and the i layer uses k vertices. Transfer O(n) A total of O(n4) It turns out that there …
Original link: https://www.shuizilong.com/house/archives/chatgpt-%E7%9B%B8%E5%85%B3/ List of related introductions of OpenAI-ChatGPT running group fashion design ChatGPT-ZhenFund Sharing AIGC AI Generated Content Industry Outlook Report – Qubit This article is reproduced from: https://www.shuizilong.com/house/archives/chatgpt-%E7%9B%B8%E5%85%B3/ This site is only for collection, and the copyright belongs to the original author.
Original link: https://www.shuizilong.com/house/archives/atcoder-grand-contest-059/ https://atcoder.jp/contests/agc059/tasks Problem A. My Last ABC Problem Only came up with violent dp. . . The key is to examine the number of different adjacent positions in the interval. . Set to x, the answer is the ceil(x/2) of this value, which proves that the pigeonhole principle can be used. Problem B. …
Original link: https://www.shuizilong.com/house/archives/codeforces-global-round-24/ https://codeforces.com/contest/1764 https://t.me/algorithm_daily_of_minako/7665 Problem D. Doremy’s Pegging Game In short, it is very similar to question D in the previous game . . Also a combinatorial count that needs to enumerate something. . . First enumerate the last remaining angles, then enumerate how many angles are left in the middle, and finally remember …
Original link:https://www.shuizilong.com/house/archives/codeton-round-3/ https://codeforces.com/contest/1750 Problem D. Count GCD Seems to be the original title next door … Problem E. Bracket Cost https://zhuanlan.zhihu.com/p/581182890 It seems that it didn’t work because I read the wrong question… Problem F. Majority dp[i][j] represents the number of solutions with a final state length of i and j consecutive 1s (like 111100..001) …
Original link: https://www.shuizilong.com/house/archives/codeforces-round-831/ http://codeforces.com/blog/entry/108451 https://zhuanlan.zhihu.com/p/579487089 meaning of the title You are given a repeatable set $A$ with $n$ elements, each element of the set $A$ is a one-element set ${a_i}$. Defining an operation consists of the following two steps: Select the two sets $S$, $T$ in $A$ whose intersection is empty. Remove both sets and …
Original link: https://www.shuizilong.com/house/archives/educational-codeforces-round-138/ https://codeforces.com/contest/1728 https://zhuanlan.zhihu.com/p/575699975 https://zhuanlan.zhihu.com/p/575702697 Problem D. Letter Picking Interval game dp, state f[][], but simpler than general game dp, transition trivial. First of all, we can bind the two rounds of operations together to transfer, as long as the state with an even length is considered, and there is no need to record …
Original link: https://www.shuizilong.com/house/archives/novelai-bot/ NovelAI’s local leaked version of the tutorial to achieve the effect of the online version – Programmer Sought https://github.com/koishijs/novelai-bot This article is reprinted from: https://www.shuizilong.com/house/archives/novelai-bot/ This site is for inclusion only, and the copyright belongs to the original author.
Original link: https://www.shuizilong.com/house/archives/canon/ theoretical knowledge What is Canon conduct? The video above has the history of the Canon. Anyway, you can understand it as cpp std library. . . 6 Ways to Make Your Canon Progression Sound Different This video teaches some transformation methods. . . (Probably similar to how to extend the line segment …
Original link: https://www.shuizilong.com/house/archives/educational-codeforces-round-135/ https://codeforces.com/contest/1728 https://zhuanlan.zhihu.com/p/562734265 Problem D. Letter Picking Interval game dp, state f[][], but simpler than general game dp, transition trivial. First of all, we can bind the two rounds of operations together to transfer, as long as the state with an even length is considered, and there is no need to record what …
Original link: https://www.shuizilong.com/house/archives/codeforces-round-819/ https://codeforces.com/contest/1726 https://zhuanlan.zhihu.com/p/562689105 C. Jatayu’s Balanced Bracket Sequence adjustment method. The base case is ((())). . The connected components are n. We observe under what circumstances the connected component decreases. (()()). . Like this. . The condition is that a sequence of parentheses at the same level has occurred before such that there …
Original link: https://www.shuizilong.com/house/archives/summer-of-nova-cat/ https://mp.weixin.qq.com/s/MBB8W0Ws4bI-rPlHADr3Vg This article is reprinted from: https://www.shuizilong.com/house/archives/summer-of-nova-cat/ This site is for inclusion only, and the copyright belongs to the original author.