2020-team06/C1001

从 Trac 迁移的文章

这是从旧校内 Wiki 迁移的文章，可能存在一些样式问题，您可以向 memset0 反馈。

原文章内容如下：

2019.11.18以后
== CF ==

|| Contest Name               || Div || Date || Rank ||
|| Educational Codeforces Round 77                 || 2 ||  2019.11.27 || 36 || 
|| Codeforces Round #603 (Div. 2)                 || 2 || 2019.11.29 ||  43 || 
|| Codeforces Round #604 (Div. 1)                 || 1 || 2019.12.5 || 487 ||
|| Codeforces Round #607 (Div. 1)                || 1 || 2019.12.15 || 337 ||  
|| Codeforces Round #608 (Div. 2)|| 2 || 2019.12.15 || 8 ||  
|| Educational Codeforces Round 78 ||  2 || 2019.12.19 ||  290（卡签到）|| 
|| Codeforces Round #609 (Div. 1)||  1 || 2019.12.21 || 219 || 
|| Good Bye 2019    || all || 2019.12.29 || 1444(倒开失败） || 
|| Hello 2020                || all || 2020.1.4 || 241  || 
|| Codeforces Round #613 (Div. 2)                || 2 || 2020.1.10 || 138 ||
|| Codeforces Round #614 (Div. 1)     || 1 || 2020.1.19 || 254 ||   
|| Educational Codeforces Round 81|| 2 || 2020.1.29  || 23 ||   
|| Codeforces Round #616 (Div. 1)|| 1||  2020.2.2 || 436 ||  
|| Codeforces Round #620 (Div. 2)|| 2 ||  2020.2.15 || 31 ||  
|| Codeforces Round #621 (Div. 1 + Div. 2)|| all ||  2020.2.17 || 259 ||  
||Codeforces Round #622 (Div. 2) || 2 || 2020.2.23  || 13 ||  
|| Codeforces Round #625 (Div. 1, based on Technocup 2020 Final Round)|| 1 || 2020.3.1  || 430 ||  
|| Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)|| all || 2020.3.3  || 465 ||  
|| CodeCraft-20 (Div. 2)|| 2 ||  2020.3.4 || 35 ||  
|| Codeforces Round #626 (Div. 1, based on Moscow Open Olympiad in Informatics)|| 1 || 2020.3.7  || 370 ||  
|| Codeforces Round #628 (Div. 2)|| 2 || 2020.3.14  || 46 ||  
|| Codeforces Global Round 7|| all || 2020.3.19  || 279 ||  
|| Educational Codeforces Round 84||2|| 2020.3.23  || 50 || 
|| Codeforces Round #630 (Div. 2)|| 2 || 2020.3.31  || 1540（疫情蔓延，人人居家cf，2.5w注册，主站和镜像都卡爆了，完全打不了） ||  
|| Codeforces Round #631 (Div. 1)|| 1 || 2020.4.3  || 754（读题多读半个，看样例就觉得C是排列，加个离散化就200多名了） ||  
|| Educational Codeforces Round 85|| 2 || 2020.4.10  || 362（满头问号 为什么们这么强 我这么菜退役算了（雾））||  
|| Codeforces Round #633 (Div. 1)|| 1 || 2020.4.12  || 174 (小号rating达到2272，旋转上分在望啊快了快了）||  
|| Codeforces Round #635 (Div. 1)|| 1 || 2020.4.15  || 523（You have -20! Wow!)|| 
|| Codeforces Round #637 (Div. 1)|| 1 || 2020.4.23  || 634（unrated)|| 
|| Educational Codeforces Round 86|| 2 || 2020.4.26  || 452|| 
|| Codeforces Round #638 (Div. 2)|| 2 || 2020.5.1  ||39 || 
|| Codeforces Round #641 (Div. 1)|| 1 || 2020.5.12  ||122(小号2353 大号2350 大号出征） || 
|| Educational Codeforces Round 90|| 2 || 2020.6.25  || 152|| 
|| Codeforces Round #654 (Div. 2)|| 2 || 2020.7.1  ||335（最后3分钟代理坏了E2没交上） || 
|| Codeforces Round #655 (Div. 2)|| 2 || 2020.7.11  ||9 || 
|| Codeforces Round #657 (Div. 2)|| 2 || 2020.7.19  ||28 || 
|| Codeforces Round #658 (Div. 1)|| 1 || 2020.7.21  ||208(大号2377，超越小号2353） || 
|| Codeforces Round #659 (Div. 1)|| 1 || 2020.7.24  ||388    || 
|| Educational Codeforces Round 92|| 2 || 2020.7.29  || 61|| 
|| Codeforces Round #660 (Div. 2)|| 2 || 2020.7.30  ||13    || 
|| Codeforces Round #664 (Div. 1)|| 1 || 2020.8.12  ||274    || 
|| Codeforces Global Round 10|| all || 2020.8.16  ||102（上红）   || 

2020.9.26以后 

== 重心转移，在稳保研之前不能再那么强迫自己提高算法竞赛水平了，因此日后三号冲分：K_T_O 2427 chenyanbo 2377 guofuqian50 2306 ==
== 相比之前的 K_T_O chenyanbo 双号，三号更偏向娱乐性而远离竞技性 ==
== 适度纯粹，适度功利，是个不错的状态；遇到什么困难，都不要怕，微笑着面对它，消除恐惧的最好办法就是面对恐惧，坚持，才是胜利！加油，奥利给！ == ——2020.9.26


|| Contest Name               || Div || Date || Rank ||



2020.2.15以后 
== 我回来了 均绩一学期从3.28变为3.7，专业课给分这么好比大一这些课好多了，绩点危险看来不再那么大了，以后每学期估计都能4.多 == 
== 虽然具体政策还没有，但是好想继续打啊 ==  ——2021.2.20

|| Contest Name               || Div || Date || Rank ||
|| Codeforces Round #703 (Div. 2)|| 2 || 2021.2.18  ||96（号chenyanbo，打星）   || 
|| Codeforces Round #704 (Div. 2)|| 2 || 2021.2.23  ||26（全部pp然后C题FST 缺一行if 登顶局泡汤）   ||
|| Codeforces Global Round 13||  all || 2021.2.28  ||42（真实值118名，rating加到2471左右）   ||
|| Educational Codeforces Round 92||  2 || 2021.3.2  ||（不会构造 + E读错题）   ||
|| Codeforces Round #709 (Div. 1, based on Technocup 2021 Final Round)||  1 || 2021.3.21  || 251   ||

== 好久没更新了，稍微更一点 大二下均4.72、大二下主干均4.77，还是挺可观的。CF 7.22打了一场，感觉离IGM也不是很远。反正就，尽量少想多做，往前冲咯。  ==  ——2021.7.27

|| Contest Name               || Div || Date || Rank ||
|| Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)||  all || 2021.7.22  || 153 （rating 2544）   ||
|| Codeforces Round #736 (Div. 1)||  1 || 2021.8.1  || 526    ||
|| Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)||  all || 2021.8.29  || 538    ||



== 头文件_CYBBB ==


//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx") 
#include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F(i,a,b) for(int i=(a);i<=(b);++i)
#define F2(i,a,b) for(int i=(a);i<(b);++i)
#define dF(i,a,b) for(int i=(a);i>=(b);--i)
#define dF2(i,a,b) for(int i=(a);i>(b);--i)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define INF 0x3f3f3f3f
#define INFll 0x3f3f3f3f3f3f3f3f
typedef long double ld;
typedef long long ll;
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
#define lo(x) ((x)&(-(x)))
#define trav(a, x) for (auto &a : x)
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
const ld Pi = 4*atan((ld)1);
template<class T> void chmin(T &a,const T&b) { a = min(a, b); }
template<class T> void chmax(T &a,const T&b) { a = max(a, b); }
namespace IO{
template<class T> inline void read(T&ret)
{
    ret=0; int f=1; char c=getchar();
    while(c<48||c>57){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(c>=48 && c<=57)ret=ret*10+c-48,c=getchar();
    ret*=f;
}
template<class T> inline void prin(const T&ret)
{
    if(!ret){putchar(48);return;} static T o; o=ret;
    if(o<0){putchar('-');o=-o;}
    static int op[25],tt; tt=0;
    while(o){
        op[++tt]=o%10;
        o/=10;
    }
    for(int i=tt;i;--i)putchar(op[i]+48);
}
template<class T> inline void pri_(const T&ret)
{
    prin(ret);putchar(' ');
}
template<class T> inline void priE(const T&ret)
{
    prin(ret);putchar('\n');
}
}
using namespace IO;

#define N 
#define MO 

inline void _Sol_()
{

}

int main()
{
    int T=1; //read(T);
    while(T--)_Sol_();
}

== 2022.4.7 ==

谁说站在光里的才算英雄.

2019.11.18以后

CF

Contest Name	Div	Date	Rank
Educational Codeforces Round 77	2	2019.11.27	36
Codeforces Round #603 (Div. 2)	2	2019.11.29	43
Codeforces Round #604 (Div. 1)	1	2019.12.5	487
Codeforces Round #607 (Div. 1)	1	2019.12.15	337
Codeforces Round #608 (Div. 2)	2	2019.12.15	8
Educational Codeforces Round 78	2	2019.12.19	290（卡签到）
Codeforces Round #609 (Div. 1)	1	2019.12.21	219
Good Bye 2019	all	2019.12.29	1444(倒开失败）
Hello 2020	all	2020.1.4	241
Codeforces Round #613 (Div. 2)	2	2020.1.10	138
Codeforces Round #614 (Div. 1)	1	2020.1.19	254
Educational Codeforces Round 81	2	2020.1.29	23
Codeforces Round #616 (Div. 1)	1	2020.2.2	436
Codeforces Round #620 (Div. 2)	2	2020.2.15	31
Codeforces Round #621 (Div. 1 + Div. 2)	all	2020.2.17	259
Codeforces Round #622 (Div. 2)	2	2020.2.23	13
Codeforces Round #625 (Div. 1, based on Technocup 2020 Final Round)	1	2020.3.1	430
Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)	all	2020.3.3	465
CodeCraft-20 (Div. 2)	2	2020.3.4	35
Codeforces Round #626 (Div. 1, based on Moscow Open Olympiad in Informatics)	1	2020.3.7	370
Codeforces Round #628 (Div. 2)	2	2020.3.14	46
Codeforces Global Round 7	all	2020.3.19	279
Educational Codeforces Round 84	2	2020.3.23	50
Codeforces Round #630 (Div. 2)	2	2020.3.31	1540（疫情蔓延，人人居家cf，2.5w注册，主站和镜像都卡爆了，完全打不了）
Codeforces Round #631 (Div. 1)	1	2020.4.3	754（读题多读半个，看样例就觉得C是排列，加个离散化就200多名了）
Educational Codeforces Round 85	2	2020.4.10	362（满头问号 为什么们这么强 我这么菜退役算了（雾））
Codeforces Round #633 (Div. 1)	1	2020.4.12	174 (小号rating达到2272，旋转上分在望啊快了快了）
Codeforces Round #635 (Div. 1)	1	2020.4.15	523（You have -20! Wow!)
Codeforces Round #637 (Div. 1)	1	2020.4.23	634（unrated)
Educational Codeforces Round 86	2	2020.4.26	452
Codeforces Round #638 (Div. 2)	2	2020.5.1	39
Codeforces Round #641 (Div. 1)	1	2020.5.12	122(小号2353 大号2350 大号出征）
Educational Codeforces Round 90	2	2020.6.25	152
Codeforces Round #654 (Div. 2)	2	2020.7.1	335（最后3分钟代理坏了E2没交上）
Codeforces Round #655 (Div. 2)	2	2020.7.11	9
Codeforces Round #657 (Div. 2)	2	2020.7.19	28
Codeforces Round #658 (Div. 1)	1	2020.7.21	208(大号2377，超越小号2353）
Codeforces Round #659 (Div. 1)	1	2020.7.24	388
Educational Codeforces Round 92	2	2020.7.29	61
Codeforces Round #660 (Div. 2)	2	2020.7.30	13
Codeforces Round #664 (Div. 1)	1	2020.8.12	274
Codeforces Global Round 10	all	2020.8.16	102（上红）

2020.9.26以后

重心转移，在稳保研之前不能再那么强迫自己提高算法竞赛水平了，因此日后三号冲分：K_T_O 2427 chenyanbo 2377 guofuqian50 2306

相比之前的 K_T_O chenyanbo 双号，三号更偏向娱乐性而远离竞技性

== 适度纯粹，适度功利，是个不错的状态；遇到什么困难，都不要怕，微笑着面对它，消除恐惧的最好办法就是面对恐惧，坚持，才是胜利！加油，奥利给！ == ——2020.9.26

Contest Name

Div

Date

Rank

2020.2.15以后

我回来了 均绩一学期从3.28变为3.7，专业课给分这么好比大一这些课好多了，绩点危险看来不再那么大了，以后每学期估计都能4.多

== 虽然具体政策还没有，但是好想继续打啊 == ——2021.2.20

Contest Name	Div	Date	Rank
Codeforces Round #703 (Div. 2)	2	2021.2.18	96（号chenyanbo，打星）
Codeforces Round #704 (Div. 2)	2	2021.2.23	26（全部pp然后C题FST 缺一行if 登顶局泡汤）
Codeforces Global Round 13	all	2021.2.28	42（真实值118名，rating加到2471左右）
Educational Codeforces Round 92	2	2021.3.2	（不会构造 + E读错题）
Codeforces Round #709 (Div. 1, based on Technocup 2021 Final Round)	1	2021.3.21	251

== 好久没更新了，稍微更一点 大二下均4.72、大二下主干均4.77，还是挺可观的。CF 7.22打了一场，感觉离IGM也不是很远。反正就，尽量少想多做，往前冲咯。 == ——2021.7.27

Contest Name	Div	Date	Rank
Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)	all	2021.7.22	153 （rating 2544）
Codeforces Round #736 (Div. 1)	1	2021.8.1	526
Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)	all	2021.8.29	538

头文件_CYBBB

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx")

#include

#include

using namespace std;

using namespace __gnu_pbds;

#define F(i,a,b) for(int i=(a);i<=(b);++i)

#define F2(i,a,b) for(int i=(a);i<(b);++i)

#define dF(i,a,b) for(int i=(a);i>=(b);--i)

#define dF2(i,a,b) for(int i=(a);i>(b);--i)

#define debug(...) fprintf(stderr,__VA_ARGS__)

#define Debug debug("Passing [%s] in LINE %d\n",FUNCTION,LINE)

#define INF 0x3f3f3f3f

#define INFll 0x3f3f3f3f3f3f3f3f

typedef long double ld;

typedef long long ll;

#define pb push_back

#define lb lower_bound

#define ub upper_bound

#define sz(x) (int)x.size()

#define all(x) begin(x), end(x)

#define rsz resize

#define lo(x) ((x)&(-(x)))

#define trav(a, x) for (auto &a : x)

typedef vector vi;

typedef vector vd;

typedef vector vl;

const ld Pi = 4*atan((ld)1);

template void chmin(T &a,const T&b) { a = min(a, b); }

template void chmax(T &a,const T&b) { a = max(a, b); }

namespace IO{

template inline void read(T&ret)

{

ret=0; int f=1; char c=getchar();

while(c<48||c>57){

if(c=='-')f=-1;

c=getchar();

}

while(c>=48 && c<=57)ret=ret*10+c-48,c=getchar();

ret*=f;

}

template inline void prin(const T&ret)

{

if(!ret){putchar(48);return;} static T o; o=ret;

if(o<0){putchar('-');o=-o;}

static int op[25],tt; tt=0;

while(o){

op[++tt]=o%10;

o/=10;

}

for(int i=tt;i;--i)putchar(op[i]+48);

}

template inline void pri_(const T&ret)

{

prin(ret);putchar(' ');

}

template inline void priE(const T&ret)

{

prin(ret);putchar('\n');

}

}

using namespace IO;

#define N

#define MO

inline void _Sol_()

{

}

int main()

{

int T=1; //read(T);

while(T--)_Sol_();

}

2022.4.7

谁说站在光里的才算英雄.