<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.cvbbacm.com/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://wiki.cvbbacm.com/feed.php">
        <title>CVBB ACM Team 2020-2021:teams:mian:withinlover</title>
        <description></description>
        <link>https://wiki.cvbbacm.com/</link>
        <image rdf:resource="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico" />
       <dc:date>2026-04-30T02:24:13+0800</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:codeforces_round_639&amp;rev=1589041030&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:lagrange&amp;rev=1594891854&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:mos_algorithm&amp;rev=1590070182&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico">
        <title>CVBB ACM Team</title>
        <link>https://wiki.cvbbacm.com/</link>
        <url>https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico</url>
    </image>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:codeforces_round_639&amp;rev=1589041030&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-10T00:17:10+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:mian:withinlover:codeforces_round_639</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:codeforces_round_639&amp;rev=1589041030&amp;do=diff</link>
        <description>Codeforces Round #639 (Div. 1) (Practice)

A Hilbert’s Hotel

题意

给定一个数列$\{a_n\}$，做变换$a_i'=a_i + i \mod n$，判断数列$\{a_n'\}$中的元素是否互不相同。

题解

模拟即可，$sort() + unique()$随手就写出来了。

B Monopole Magnets

题意

给定$n\times m$的一个黑白地图，你可以随意的在地图上添加单极磁铁$N$$S$$N$$S$$N$$N$$S$$S$$N$$N$$S$$N$$S$$N$$f(x_1,x_2,\dots,x_n)=(x_{j_1}&lt;x_{k_1})\land(x_{j_1}&lt;x_{k_1})\land\dots\land(x_{j_m}&lt;x_{k_m})$$x_1,x_2,\dots,x_n$$x_i &lt; x_j$$i$$j$…</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:lagrange&amp;rev=1594891854&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-07-16T17:30:54+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:mian:withinlover:lagrange</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:lagrange&amp;rev=1594891854&amp;do=diff</link>
        <description>拉格朗日插值法

作用

如果发现某个数学题，答案有可能是多项式的结构的话

然后又恰好打出了表

不如直接插值。也省的推公式了（其实是推不出来

Code



int lagrange(int *X, int *Y, ll n, ll k) {
    ll res = 0, l;
    for(int i = 0;i &lt; n; ++i) {
        l = 1;
        for(int j = 0;j &lt; n; ++j) {
            if(i == j) continue;
            l = l * Sub(k, X[j]) % mod;
            l = l * Get_Inv(Sub(X[i], X[j])) % mod;
        }
        res = (res + l * Y[i] % mod) % mod;
    }
    return res;
}…</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:mos_algorithm&amp;rev=1590070182&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-21T22:09:42+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:mian:withinlover:mos_algorithm</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:mian:withinlover:mos_algorithm&amp;rev=1590070182&amp;do=diff</link>
        <description>带修莫队

	*  Write by Withinlover

本文建立在已经掌握并熟知普通莫队的基础上，如果你对普通莫队的使用仍有疑惑，请前往阅读普通莫队。

算法介绍

普通莫队的一大局限在于不支持修改操作。$(l, r)$$(l, r, t)$$(l, r, t)$$6$$(l - 1, r, t)$$(l + 1, r, t)$$(l, r - 1, t)$$(l, r + 1, t)$$(l, r, t - 1)$$(l, r, t + 1)$$(l, r, t)$$O(1)$$n$$m$$O\left(n^{\frac{5}{3}}\right)$$N$$M$$A$$B$$S$$l$$S$$A$$SA$$r$$l$$l$$r$$N$$\frac{N}{S}$$\frac{N^2}{S}$$t$$l, r$$t$$B$$\frac{N^2}{S^2}$$\frac{BN^2}{S^2}$$A$$B$$M$$O\left(SM+\frac{N^2}{S}+\frac{MN^2}{S^2}\right)$$N$$M$$S=N^x$$O\left(N^{x+1}+N^{2-x}+N…</description>
    </item>
</rdf:RDF>
