<?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:no_morning_training:training_record</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:18:18+0800</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_09-b&amp;rev=1589439207&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_09&amp;rev=1589452972&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10-d&amp;rev=1589452640&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10&amp;rev=1589452721&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_16&amp;rev=1590155503&amp;do=diff"/>
                <rdf:li rdf:resource="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_24&amp;rev=1590573677&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:no_morning_training:training_record:2020_05_09-b&amp;rev=1589439207&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-14T14:53:27+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_09-b</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_09-b&amp;rev=1589439207&amp;do=diff</link>
        <description>#include&lt;cstdio&gt;
using namespace std;
int t,n,m,a,v,vx[1000005],vy[1000005];
int main()
{
    scanf(&quot;%d&quot;,&amp;t);
    while(t--)
    {
        v=1;
        scanf(&quot;%d%d&quot;,&amp;n,&amp;m);
        vx[1]=0;
        for(int i=1;i&lt;=m;i++)
        {
            scanf(&quot;%d&quot;,&amp;a);
            if(a) vy[i]=1;
            else vy[i]=0;
        }
        for(int i=2;i&lt;=n;i++)
        {
            scanf(&quot;%d&quot;,&amp;a);
            if(a) vx[i]=!vy[1];
            else vx[i]=vy[1];
            for(int j=2;j&lt;=m;j++)
            {
 …</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_09&amp;rev=1589452972&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-14T18:42:52+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_09</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_09&amp;rev=1589452972&amp;do=diff</link>
        <description>2020/05/09 北方大学ACM多校训练赛 第四场

比赛信息

日期： 2020/05/09 (原日期: 2017/03/26)

链接： &lt;https://www.jisuanke.com/contest/698/challenges&gt;

做题统计：王瑞琦： 冯宇扬： 常程：B（还是这题很水）

题解

A

solved by, resolved by.

题意：

题解：$\times$</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10-d&amp;rev=1589452640&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-14T18:37:20+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_10-d</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10-d&amp;rev=1589452640&amp;do=diff</link>
        <description>#include &lt;iostream&gt;
#include &lt;set&gt;
#include &lt;cstdio&gt;
#include &lt;vector&gt;
using namespace std;
int n,k;
bool check(int x)
{
    set&lt;int&gt; st;
    vector&lt;int&gt; vec;
    vec.push_back(-x);
    for(int i = 1;i &lt;= n;i++)
        if(i != x)
	    st.insert(-i);
    while(vec.size() != n)
    {
	int s = vec.size();
	for(int i = 0;i &lt; s;i++)
	{
	    int v = vec[i];
	    auto np = st.lower_bound(v - k);
	    int y = *np;
	    if(np != st.end())
	    {
		vec.push_back(y);//
		st.erase(y);
	    }
	    else
		re…</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10&amp;rev=1589452721&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-14T18:38:41+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_10</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_10&amp;rev=1589452721&amp;do=diff</link>
        <description>2020/05/10 北方大学ACM多校训练赛 第五场

比赛信息

日期： 2020/05/10 (原日期: 2017/04/02)

链接： &lt;https://www.jisuanke.com/contest/704/challenges&gt;

做题统计：王瑞琦： 冯宇扬： 常程：

(BOMB)

题解

（这场比赛和上一场一样，题解难找，一些题只能说一下我们的思路）$N\times M(max(N,M)\ge2)$$K\times K$$N+M-2$$n \le 3 \times 10^5$$q \le 3 \times 10^5$$f[i]=size({j | \forall k (2^k \&amp; j \to 2^k \&amp; i) })$$f[i] = f[i]+ f[i \oplus (2^k)]\times bool(i\&amp;(2^k)) (0\le k \le \log_2 \max (a)$$f[a[i]]=1 \; (1\le i \le n)$$tot[i]=f[i]^3$$mask[k]=2^{k+1}-1$$ans[i]=tot[i]-tot[mask[k] \&amp; i…</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_16&amp;rev=1590155503&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-22T21:51:43+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_16</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_16&amp;rev=1590155503&amp;do=diff</link>
        <description>2020/05/16 牛客假日团队赛41

比赛信息

日期： 2020/05/16
链接： &lt;https://ac.nowcoder.com/acm/contest/5208#question&gt;

做题统计：王瑞琦： 冯宇扬： 常程：2


题解

A

solved by, upsolved by .


题意：

题解：

B photo

solved by 常程, upsolved by .


题意：N（$2\le N\le10^9$$1\le K\le1000$$1\le N\le5\times10^4$$1\le K&lt;N$</description>
    </item>
    <item rdf:about="https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_24&amp;rev=1590573677&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2020-05-27T18:01:17+0800</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>2020-2021:teams:no_morning_training:training_record:2020_05_24</title>
        <link>https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:no_morning_training:training_record:2020_05_24&amp;rev=1590573677&amp;do=diff</link>
        <description>2020/05/24 牛客假日团队赛40

比赛信息

日期： 2020/05/24
链接： &lt;https://ac.nowcoder.com/acm/contest/5207#description&gt;

做题统计：王瑞琦： 冯宇扬：1 常程：1


题解

A

solved by, upsolved by .


题意：

题解：

B

solved by, upsolved by .


题意：

题解：

$1\le N\le20000$</description>
    </item>
</rdf:RDF>
