某岛

ChatGPT related

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.

At Coder Grand Contest 059

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. …

At Coder Grand Contest 059 Read More »

Codeforces Global Round 24

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 …

Codeforces Global Round 24 Read More »

CodeTON Round 3

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) …

CodeTON Round 3 Read More »

Codeforces Round #831

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 …

Codeforces Round #831 Read More »

Educational Codeforces Round 138

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 …

Educational Codeforces Round 138 Read More »

NovelAI Bot

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.

Canon

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 …

Canon Read More »

Educational Codeforces Round 135

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 …

Educational Codeforces Round 135 Read More »

Codeforces Round #819

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 …

Codeforces Round #819 Read More »

The summer of watt meow

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.

NOI 2022

Original link: https://www.shuizilong.com/house/archives/noi-2022/ https://www.zhihu.com/question/548696144 https://blog.csdn.net/liuzhangfeiabc/article/details/126594264 D1T1 https://www.luogu.com.cn/problem/P8496 This article is reprinted from: https://www.shuizilong.com/house/archives/noi-2022/ This site is for inclusion only, and the copyright belongs to the original author.

Luogu P3765 Presidential Election

Original link: https://www.shuizilong.com/house/archives/luogu-3765/ https://www.luogu.com.cn/problem/P3765 #include <lastweapon/io> #include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace lastweapon; #define ls id<<1 #define rs id<<1|1 const int N = int(5e5) + 9; int k,aa[N]; struct xd_node { int l,r; int cnt,num;//Maintain a serial number of cnt and mode like the problem of finding mode}treee[4*N]; struct xd_treee …

Luogu P3765 Presidential Election Read More »