某岛

Original link: https://www.shuizilong.com/house/archives/block-cut-tree/ https://oi-wiki.org/graph/block-forest/#%E4%BE%8B%E9%A2%98 https://codeforces.com/gym/102512/problem/A https://www.shuizilong.com/house/archives/spoj-9577-dynamic-tree-connectivity/ https://www.shuizilong.com/house/archives/spoj-375-query-on-a-tree/ This article is transferred from: https://www.shuizilong.com/house/archives/block-cut-tree/ This site is only for collection, and the copyright belongs to the original author.

Original link: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-299/ https://www.cnblogs.com/Lanly/p/17344724.html Problem D. Find by Query Simple dichotomy. Problem E. Nearest Black Vertex First of all, the points in the circle must be all white, otherwise the conditions are not met. Then the optimal state must be that the remaining points are all black. If this does not meet the conditions, then

Original link: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-298/ TBD This article is transferred from: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-298/ This site is only for collection, and the copyright belongs to the original author.

Original link: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-297/ Problem D. Count Subtractions I thought of the number theory problem that uoj posed a few days ago. . . Problem E. Kth Takoyaki Set Humble Number? This article is transferred from: https://www.shuizilong.com/house/archives/atcoder-beginner-contest-297/ This site is only for collection, and the copyright belongs to the original author.

Original link: https://www.shuizilong.com/house/archives/introduction-to-gradio-client/ With the recent popularity of HuggingGPT and AutoGPT, it has become a very common requirement for LLM to be used as a Control to call various Domain Expert Models. So Gradio kept up with the pulse of the community and launched the gradio_client function last week . Let’s see what it can

Original link: https://www.shuizilong.com/house/archives/autonomous-agent/ After the last article was written, this topic has become more popular. There have been a lot of related papers and applications such as Self-hearing Code, BabyGPT, AutoGPT, OpenGPT, and Generative Agents. I have to do another summary. . . As mentioned above, since AI started to use tools, the next milestone

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