CSP-S 2024 ZJ 迷惑行为大赏

Themooncake · 2024-11-09 22:31:48 · 休闲·娱乐

写在前头

本蒟蒻第一次写这种总结，还望多多包涵！

如有侵权或感到不适，请告诉我！

本文使用 vscode 进行统计。

正文

统计

本次 CSP-S 2024 ZJ 共有 2031 人参加，所有代码解压后共 77.2MB，共 7845 个文件，10137 个文件夹。
没有混入前缀为 JS 的文件。
有 7117 个文件中出现了 bits/stdc++.h
有 44 个文件中出现了 CCF（忽略大小写，下同）。
没有出现 dzd。
有 21 个文件中出现了 luogu。
有 9 个文件中出现了 genshin
有 2 个文件中出现了了 Honkai
有 2 个文件中出现了 mihoyo
有 15 个文件中出现了共 5010 个 fuck。
有 72 个文件中出现了 //freopen。
有 6 个文件出现了 #include<windows.h>。
有 18 个文件中出现了 AFO。
有 106 个文件出现了 114514。

有 10 个文件出现了 AKIOI。

迷惑行为大赏

Sword to CCF 镇楼


//freeopen()  <-zheng huo bu zhuo qi
//CCF I love you!
//I'll give you mawenzheng's head!
//Please give me 100 pts and 1=!
//OR...Look down 
/*

        *
       *0*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
      *080*
     *08880*
*********0889880*********
*000000008999800000000*
********08880********
     *08880*
     *08880*
     *08880*
     *08880*
     *08880*
     *00000*
     *******
^ I will use the sword to zhi cai char(0x43) char(0x43) char(0x46)
(nian nian zai ci, cong bu que xi)
(qu nian na ge zheng hua huo zui duo de ye shi wo, gu yi de)

jian guo you shi yi lai zui jian dan de CSP-S T1 */

### 大写的 Windows.h

include<Windows.h>

### bits\stdc++.h

include<bits\stdc++.h>

### #pragma GCC optimize(2)

pragma GCC optimize("O2")

pragma GCC optimize(2)

### O3，但是钓鱼

//#pragma GCC optimize(3, "Ofast", "inline")

### William Zhou 你好

include <bits/stdc++.h>

using namespace std; int main(){ freopen("arena.in","r",stdin); freopen("arena.out","w",stdout); cout<<"what a stupid problem.....i cant do it!!!!"; cout<<"im william zhou, and this is my second time to attend the CSP,a laji competiion.what a laji computer that i even cant type Chinese!Fucking bro......now,i finishied the T1 and the T2,sheng3 is easy for me.dougeiwotmdidiaodian.wyqwyqwyqwyqwyqwyqwqy(DIAN)"; return 0;

}

### 超绝素质人

include<bits/stdc++.h>

using namespace std;

int main(){ freopen("arena.in","r",stdin); freopen("arena.out","w",stdout); std::ios::sync_with_stdio(0); while(1){ cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU //为了让大家划的轻松点，此处省略大约一百行的 cout<<"FUCK YOU CCF" cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";cout<<"FUCK YOU CCF";v //细心的小伙伴应该能看出来每行后面有个没删掉的 v } return 0; } / ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????? //下省略五千行问号 Dear CCF, It was a really fucking bad experience for me,for I have done nothing but have had 2 peice of chacolate during the four hours.I am bound to go back here with deferent intellengence and a better faculty.I do hope what I do would struck you that time. FUCK YOU; /

### 将 ```f**kccf``` 深入变量

int fuckccf=x+dfs(k+1);

### 钓鱼佬必备

if 0

title: key word ? index

A: AFO Away From OI AK ak B: C: CCF ccf CSP csp cin cout cin.tie(0) D: E: F: FUCK fuck fread fwrite for freopen G: H: I: ios::sync_with_stdio(0) J: K: L: LOVE Love love M: N: O: P: printf Q: R: read return S: SB sb Sb sB scanf T: typedef U: V: W: write X: Y: Z:

:

include

<bits/stdc++.h> //freopen

define

GO : CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf CCF ccf AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak AFO Away From OI AK ak FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for FUCK fuck fread fwrite for freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen freopen LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love LOVE Love love SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf SB sb Sb sB scanf //后续都是重复，这里做了省略。

endif

### s↓b↑

struct sb{ int L,R; }c[N];

### 吃柠檬

ll wcnm;

### fw

int fw = 0;

### f**k you linus

include<bits/stdc++.h> // fuck you linus

define pair std::pair<int, int> // fuck you linus

define fst first // fuck you linus

define snd second // fuck you linus

const int N = 1e5+7; // fuck you linus int n, m, t, w, d[N], v[N], a[N], p[N]; // fuck you linus pair sr[N]; int cnt; // fuck you linus std::list<pair> s; // fuck you linus int fdiv(int x, int y) { // fuck you linus return x / y; // fuck you linus } // fuck you linus int cdiv(int x, int y) { // fuck you linus return x / y + bool(x % y); // fuck you linus } // fuck you linus int ub(int x) { // fuck you linus return std::upper_bound(p+1, p+m+1, x) - p; // fuck you linus } // fuck you linus int lb(int x) { // fuck you linus return std::lower_bound(p+1, p+m+1, x) - p; // fuck you linus } // fuck you linus bool cmp(pair x, pair y) { // fuck you linus if(x.fst == y.fst) return x.snd > y.snd; // fuck you linus return x.fst < y.fst; // fuck you linus } // fuck you linus void slv() { // fuck you linus scanf("%d%d%d%d", &n, &m, &t, &w); // fuck you linus for(int i=1; i<=n; i++) // fuck you linus scanf("%d%d%d", d+i, v+i, a+i); // fuck you linus for(int i=1; i<=m; i++) // fuck you linus scanf("%d", p+i); // fuck you linus std::sort(p+1, p+m+1); // fuck you linus cnt = 0; // fuck you linus for(int i=1; i<=n; i++) { // fuck you linus int l, r; // fuck you linus if(a[i] < 0) { // fuck you linus if(v[i] <= w) continue; // fuck you linus l = d[i]; // fuck you linus int x = cdiv(ww - v[i]v[i], 2a[i]) - 1; // fuck you linus r = l + x; // fuck you linus } else if(a[i] == 0) { // fuck you linus if(v[i] <= w) continue; // fuck you linus l = d[i]; // fuck you linus r = t; // fuck you linus } else { // fuck you linus int x = fdiv(ww - v[i]v[i], 2a[i]) + 1; // fuck you linus if(v[i] > w) x = 0; // fuck you linus l = d[i] + x; // fuck you linus r = t; // fuck you linus } // fuck you linus l = lb(l); r = ub(r) - 1; // fuck you linus if(l > r) continue; // fuck you linus sr[++cnt] = { l, r }; // fuck you linus } // fuck you linus printf("%d ", cnt); // fuck you linus std::sort(sr+1, sr+cnt+1, cmp); // fuck you linus s.clear(); // fuck you linus for(int i=1; i<=cnt; i++) // fuck you linus s.push_back(sr[i]); // fuck you linus for(auto i=s.begin(); i!=s.end(); i++) { // fuck you linus while(i != s.begin()) { // fuck you linus auto j = std::prev(i); // fuck you linus if(j->snd <= i->snd) // fuck you linus break; // fuck you linus s.erase(j); // fuck you linus } // fuck you linus } // fuck you linus int cur = 0, ans = 0; // fuck you linus for(auto i: s) { // fuck you linus if(i.fst <= cur) continue; // fuck you linus ans++; cur = i.snd; // fuck you linus } // fuck you linus printf("%d\n", m-ans); // fuck you linus } // fuck you linus int main() { // fuck you linus freopen("detect.in", "r", stdin); // fuck you linus freopen("detect.out", "w", stdout); // fuck you linus int t; // fuck you linus scanf("%d", &t); // fuck you linus while(t--) slv(); // fuck you linus return 0; // fuck you linus } // fuck you linus

### ZJL 单推人：你玩 Genshin Impact 吗？

/* ZJL Goddess I'm fucking fall in love with you. Let's celebrate ZJL AK CSP-S in advance !!!!!!!!!!!!!!!!!!! %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

ZJL Golden Sentence : Are you playing Genshin Impact ? The people like you are play-Genshin-Impact played . Aren't you regret ?

If you stay~ in your comfort zone > , you'll be lost. */

### 钓鱼佬

int main() { //Çå¿Õ freopen("detect.in","r",stdin); freopen("detect.out","w",stdout); cin>>T; //中间省略 } // freopen("dule.in","r",stdin); // freopen("dule.out","w",stdout);

### 这是真写错了

freopen("duel.in","r",stdin); freopen("duel.out","r",stdout);

### arene

freopen("arene.in","r",stdin); freopen("arene.out","w",stdout);

### 不会写，开钓

include <iostream>

using namespace std; int main(){ freopen("arena.in","r",stdin); freopen("arena.out","w",stdin);

freopen("arena.in","r",stdout);
freopen("arena.out","w",stdiout);
return 0;

}

### "r",stdout

freopen("arena.in","r",stdin); freopen("arena.out","r",stdout);

### 满足你的愿望

include<bits/stdc++.h>

using namespace std; int main() { // feropen("arena.in","r",stdin); // frepoen("arena.out","r",stdout); // feroepn("arena.in","W",stdin); // feroepn("arena.in","w",stdin); freopen("arena.in","r",stdin); freopen("arena.out","w",stdout); int t; cin>>t; while(t--) { cout<<"0\n"; } return 0; } / 我不会T4 就在这里记录答题思路吧 T1-14:30 T1签到题，双指针 T1-14:43 完成 ==100pts T2-14:48 先写暴力 T2-15:37 ans1 o(tnlogn) ans2不会跳 T3-15:38 dp[n][i][j]第n位已经完成，上一个蓝是i，上一个红是j T3-15:51 n可以滚动 o(n^3) ==35pts T2-17:04 单调栈维护ans2 o(tnlogL)=39863137.138648348174443833153873,希望不要卡常 ==90-100pts T3-17:08 放弃，做T4去 T4-17:27 T4好难，看不懂，样例手模都模不出来， T3-17:59 发现dp有一位必定是n-1，改成n^2==50pts,没时间改成o(n)了预计240pts-250pts 开始检查 OK 检查完了 18:19 我想知道我能上电视吗? I want to know can i be seen on the TV? /

### 钓鱼有风险，挂 0 需谨慎

int main(){ freopen("duel.in","r",stdin); freopen("duel.out","w",stdin);

//中间省略

freopen("duel.in","r",stdout);
freopen("duel.out","w",stdout);

return 0; }

### 这是真写反了

freopen("detect.in","w",stdin); freopen("detect.out","r",stdout);

### 对 Genshin 爱得深沉

include<bits/stdc++.h>

define int long long

using namespace std; const int N=2e5+10,M=1e6+10,V=1e5,INF=0x3f3f3f3f3f3f3f3f,mod=998244353; int n,m,a[N],lst[M],s[N],f[N]; namespace Fast_IO { static char buf[1000000],paa=buf,pd=buf,ot[10000000];int length=0;

define getchar() paa==pd&&(paa=(pd=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*pd++

inline int read()
{
    char c(getchar());int x(0),t(1);
    while(!isdigit(c)){if(c=='-') t=-1;c=getchar();}
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return t*x;
}
inline void flush(){fwrite(ot,1,length,stdout);length=0;}
inline void put(char c){if(length==9999999) flush();ot[length++]=c;}
inline void put(string s){for(char c:s) put(c);}
inline void print(int x)
{
    if(x<0) put('-'),x=-x;
    if(x>9) print(x/10);
    put(x%10+'0');
}
inline bool chk(char c){return !(c>='a'&&c<='z'||c>='A'&&c<='Z'||c>='0'&&c<='9');}
inline bool ck(char c){return c!=' '&&c!='\n'&&c!='\r'&&c!=EOF;}
inline void rd(char s[],int&n)
{
    s[++n]=getchar();
    while(chk(s[n])) s[n]=getchar();
    while(ck(s[n])) s[++n]=getchar();n--;
}

} using namespace Fast_IO; inline void solve() { n=read();for(int i=1;i<=n;i++) a[i]=read();f[1]=0; for(int i=1;i<n;i++) s[i]=s[i-1]+(a[i]==a[i+1])*a[i];lst[a[1]]=1; for(int i=2,w,j;i<=n;i++) { f[i]=f[i-1];if(a[i]==a[i-1]){f[i]+=a[i];lst[a[i]]=i;continue;} if(!lst[a[i]]){lst[a[i]]=i;continue;} w=s[i-2]-s[lst[a[i]]];f[i]=max(f[i],f[lst[a[i]]+1]+a[i]+w);lst[a[i]]=i; }print(f[n]);put('\n'); for(int i=1;i<=n;i++) lst[a[i]]=0; } signed main() { // system("fc color.out color2.ans"); freopen("color.in","r",stdin); freopen("color.out","w",stdout); int T=1;T=read();while(T--) solve(); genshin:;flush();return 0; }

### 最后一次了送你上电视吧，uid：562443

include<bits/stdc++.h>

using namespace std; const long long maxn=2e5+5,maxcmw=2e5; long long i,n,m,ans,l,j; long long a[maxn],vis[maxn],dp[maxn]; struct node { long long v,w; }; vector<long long>afo; int main() { freopen("duel.in","r",stdin); freopen("duel.out","w",stdout); scanf("%lld",&n); for(i=1;i<=n;i++) { scanf("%lld",&a[i]); vis[a[i]]++; } for(i=1;i<=maxcmw;i++) { if(vis[i]) { afo.push_back(vis[i]); } } l=afo.size(); dp[0]=afo[0]; for(i=1;i<l;i++) { if(dp[i-1]>=afo[i]) { dp[i]=dp[i-1]; } else dp[i]=afo[i]; //printf("%lld\n",dp[i]); } printf("%lld\n",dp[l-1]); return 0; } //I want go to qiguaixingweidashang!!!!!!!!!!!!!!!!!!!!1111111 //luogu uid:562443 //y1 I want go to qiguaixingweidashang!!!!!!!!!!!!!!!!!!!!1111111 //freopen I want go to qiguaixingweidashang!!!!!!!!!!!!!!!!!!!!1111111 //CCF,give me more points!!!!!!!!!!!!!!!!!!!!!! //If you can't,I'll not (beautiful vocabulary) you,I'll thank you,because I'll AFO.

### 送你上台

include<bits/stdc++.h>

using namespace std; int main(){

freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);

return 0;

} /* Hello~every~body~~ hello. the sentence in the top to say hello is my computer teacher's favorite I'm a ZJ OIer,now I'm a ZJ OIer; I won't be a ZJ OIer after this CSP-S; my first CSP-S and my last CSP-S; yes, I'm in grade 9 now; I'm in Hangzhou,the capital city in Zhejiang. I'm in a junior middle school named 74 78 83 89(translate it in ASCII). I'll AFO soon. and turn to whk. An OIer I was,a whker I will be. and turn to the f** zhongkao with n easy science and t easy maths and difficult politics which I am not good at. I want to go to hez(bingjiang) I want to get an 2= or 1= but impossible I have a lot of problem I finished T1 in 30mins but I'm not sure if it can get 100pts T2 isn't correct,I'm sure,but 2528 bits,yes!2528! T3 was finished by DFS,about 20pts I can get. I don't know how to deal with T4. Oh my god. I'm a rubbish who will go to Genshan high middle school! Yes! I want to get 220pts in CSP-S,which is impossible. I want to get 635pts in zhongkao,which is impossible too. I want to get 110pts in Chinese; I want to get 120pts in Maths; I want to get 118pts in English; I want to get 160pts in Science(all of physics,chemistry and biology); I want to get 110pts in Wenzong(all of geography,history and politics); I want to get 30pts in PE(all of swimming,ball throwing and rope jumping) ; Yes,I want to choose swimming, because I hate running. F** 74 78 83 89(translate it in ASCII too) makes all the Grade 9 students runnning for 800 meters everyday! F** playground and F** gym and F** PE class! I hate it forever! FOREVER! A lot of mistakes I have made here. A lot of mistakes in grammar ,words and phrase. So I cannot get all of them,impossible to get them. just a dream. Yes,I should turn to my terrible whk which rk3 just in my class,for my life. and leave from OI,both my dream and hobby. wow,a huge article. why I can't get everything I want. Love,Friends,Freedom,Knowledge,Courage,Ability,Happiness. GoodBye CCF GoodBye OI love you and f** you, CCF Bye Put me in mihuoxingweidashang in ZJ plz. Boring in last 5mins maybe I can play google little dinosaur? /

### 创意苦力怕

include<bits/stdc++.h>

define Long long long

define inf 0x3f3f3f3f

using namespace std;

int main(){ freopen("arena.in","r",stdin); freopen("arena.out","w",stdout); printf("Creative Creeper False Intersting Solution Sport Basic");

return 0;

}

### CCF I love you + 纳西妲厨子

int main() { // freopen(".in","r",stdin); freopen("arena.out","w",stdout); cout<<"CCF I love you!\n"; return 0; } /*

/ / Nahida is the cutest in the world. RP++! */

### CCF NB

include <bits/stdc++.h>

using namespace std; //CCF NB int h[1000005];

int main() { freopen("color.in", "r", stdin); freopen("color.out", "w", stdout); int t; cin >> t; while(t--) { memset(h, 0, 1000005); int n; long long ans = 0; cin >> n; for(int i = 1; i <= n; i++) { int x; cin >> x; h[x]++; } for(int i = 1; i <=1000005; i++) if(h[i]>1) ans += h[i] * i - i; cout << ans << endl; } return 0; }

### 厨子大赏

/ Some favor in different Mihoyo games Genshin Impact : Collei,Noelle,Navia,Keqing Honkai impact III: Seele(black and white) Padofelis Star rail: Seele Huohuo Zenless Zero Zone : Abby /

### *使 Firra3500 充满了决心

//by Luogu Firra3500 //My Luogu uid:988176

include<bits/stdc++.h>

using namespace std; int main() { freopen("arena.in","r",stdin); freopen("arena.out","w",stdout); // system("title Determination"); system("color C"); cout<<"----------------------------------------------------------------------\n"; cout<<"| *The question \"arena\" is so hard,that fills you with determination.|\n"; cout<<"| |\n"; cout<<"| |\n"; cout<<"| |\n"; cout<<"| |\n"; cout<<"| ** |\n"; cout<<"| |\n"; cout<<"| * |\n"; cout<<"| |\n"; cout<<"| |\n"; cout<<"| Firra3500 LV 1 HP --------- 20/20 |\n"; cout<<"----------------------------------------------------------------------\n"; cout<<" |-----| |-----| |-----| |-----|\n"; cout<<" |FIGHT| | ACT | |ITEMS| |MERCY|\n"; cout<<" |-----| |-----| |-----| |-----|"; return 0; }

### xie bu chu lai le

include <bits/stdc++.h>

using namespace std;

define int long long

define file(name) freopen(#name".in", "r", stdin), freopen(#name".out", "w", stdout)

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

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

using ll = long long; using pii = pair<int, int>;

define fi first

define se second

define all(cont) cont.begin(), cont.end()

constexpr static int N = 1e5 + 5;

int n, m, aa[N], a[N], k, tt, x[4], q[N]; string s[20]; bool d[N << 2]; vector<int> tr[N << 2];

int ind[100];

int now, sz;

inline int ls(int p) {return p << 1; } inline int rs(int p) { return p << 1 | 1; } inline void pushup(int p, int h) { if(d[p] == 0) { int mn = 1e18; for(auto it : tr[ls(p)]) mn = min(mn, a[it]); if(mn < h) { for(auto it : tr[rs(p)]) tr[p].emplace_back(it); } for(auto it : tr[ls(p)]) if(a[it] >= h) tr[p].emplace_back(it); } else { int mn = 1e18; for(auto it : tr[rs(p)]) mn = min(mn, a[it]); if(mn < h) { for(auto it : tr[ls(p)]) tr[p].emplace_back(it); } for(auto it : tr[rs(p)]) if(a[it] >= h) tr[p].emplace_back(it); } } void init(int p, int l, int r, int h) { if(l == r) return ; d[p] = s[h][ind[h]++]; int mid = (l + r) >> 1; init(ls(p), l, mid, h - 1), init(rs(p), mid + 1, r, h - 1); }

void build(int p, int l, int r, int h) { if(l == r) { tr[p].emplace_back(l); return ; } int mid = (l + r) >> 1; build(ls(p), l, mid, h - 1); build(rs(p), mid + 1, r, h - 1); // cout << p << ' ' << ls(p) << ' ' << rs(p) << ' ' << h << '\n'; pushup(p, h); }

void solve() { cin >> n >> m; _f(i, 1, n) cin >> aa[i]; _f(i, 1, m) cin >> q[i]; while(1) { if((1 << k) >= n) break; ++k; } _f(i, 1, k) cin >> s[i]; init(1, 1, 1 << k, k); cin >> tt; while(tt--) { _f(i, 0, 3) cin >> x[i]; _f(i, 1, n) a[i] = aa[i] ^ x[i & 3]; ll ans = 0; _f(i, 1, m) { now = q[i]; int kk = 0; while(1) { if((1 << kk) >= now) break; ++kk; } build(1, 1, 1 << kk, kk); // cout << now << ' ' << kk << ' ' << tr[1].size() << '\n'; ans ^= (1ll i tr[1].size()); // _f(i, 1, (1 << (kk + 1)) - 1) { // cout << i << ":\n"; // for(auto it : tr[i]) cout << it << ' '; // cout << '\n'; // } _f(i, 1, (1 << (kk + 1)) - 1) tr[i].clear(); } cout << ans << '\n'; } }

signed main() { file(arena); ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); solve(); return 0; }

// case A nlog^2n // xie bu chu lai le wuwuwu /ll // qwqwqwqwqwqwq

// lose so easy 16pts // dont fst // luogu 761491 // i love ccf!!

// /bx Milmon

### 樱岛麻衣

// You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // http://www.luogu.com.cn/user/608410.

/** @file include/yingdaomayi

This is a Standard C++ Library file. You should @c #include this file
in your programs, rather than any of the @a *.h implementation files.
This is the C++ version of the Standard C Library header @c stdio.h,
and its contents are (mostly) the same as that header, but are all
contained in the namespace @c std (except for names which are defined
as macros in C). */
```
### kkksc03
```
double s=1.0(p[nkl]a[i]); double kkksc03=1.0(v[i]v[i]+2d[i]s); if(kkksc03>0){ double V1=1.0*sqrt(kkksc03); if(V1>V) num++; else uu++; }
```
### 老生常谈，但他叫 ```Untitled1.cpp```
```
//freopen("duel.in","r",stdin); //freopen("duel.out","w",stdout);
```
![无名](https://cdn.luogu.com.cn/upload/image_hosting/3t8lji7a.png)
```

只出不进

//freopen("color.in","r",stdin);
freopen("color.out","w",stdout);

arena.ans

freopen("arena.in","r",stdin);
freopen("arena.ans","w",stdout);

asdf

int asdf;

哥们你 T2 估太高了吧，还有好恶臭啊

#include<bits/stdc++.h>
using namespace std;
int abcdefg;
int main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    cin>>abcdefg;
    while(1145141919810)
    {
        //好吧其实我不会
        //但是总要写点什么
        //所以来浪费你时间
        //别看我第二题写这么多还消耗了一张草稿纸 
        //其实目的是为了拿十分（可能十分也没有） 
        //评价一下题目难度 
        //第一题 感觉是红题或橙题（好淼 最简单的一题？ 
        //第二题 好像是紫题 
        //第三题 感觉是蓝题或绿题 （找不出规律的规律题还是想不到的算法 
        //第四题 紫题或黑题（还没写就感觉写不出来 
        //三等 120？ 
        //二等 150？ 
        // 一等 200多？
        //还有一堆从头到尾狂敲键盘的
        //是新型发癫方式还是大蛇不知道
        //别扣我分qwq 
    }
}

初（三学）生の独白

#include<bits/stdc++.h>
using namespace std;

#define ls (u<<1)
#define rs (u<<1|1)
#define mid (l+r>>1)
#define lowbit(x) (x&-x)
#define getbit(x,y) (((x)>>(y))&1)
#define mymin(x,y) ((x)<(y)?(x):(y))

#define fre______ "arena"
// #define fre______ "arena1"

namespace indiaPRO {
    bool _check(const char &t) {return '0'<=t&&t<='9';
    }template<typename T>inline void _read(T &x) {
        x=0;bool tmp=0;char t=getchar();
        while(!_check(t)) {if(t=='-'){tmp=1;}t=getchar();}
        while(_check(t)) {x=(x<<1)+(x<<3)+(t^48);t=getchar();}
        if(tmp) x=-x;
    }template<typename T>void _write(const T &x) {
        if(x<0) {putchar('-');_write(-x);return;}
        if(x/10) {_write(x/10);}putchar(x%10^48);
    }inline void read() {
    }inline void write() {putchar('\n');
    }inline void _write() {putchar(' ');
    }inline void _write(const char &t) {putchar(t);
    }template<typename T,typename ...T2>inline void read(T &x,T2 &...oth) {
        _read(x);read(oth...);
    }template<typename T>inline void write(const T &x) {
        _write(x);write();
    }template<typename T,typename ...T2>inline void write(const T &x,const T2 &...oth) {
        _write(x);_write();write(oth...);
    }template<typename T>inline void read(T *l,T *r) {
        while(l!=r) {_read(*l);l++;}
    }template<typename T>inline void write(T *l,T *r) {
        while(l!=r) {_write(*l);_write();l++;}write();
    }
#if defined(fre______) 
void fopen(string s=fre______) {
    freopen((s+".in").c_str(),"r",stdin);
    freopen((s+".out").c_str(),"w",stdout);
    //?????????????????????不是哥们不是我写了个啥啊（本来是stdin）
}
#endif
}
using namespace indiaPRO;

const int N=1e5+5;
int n,m;
int a[N],c[N];

signed main() {
#if defined(fre______)
fopen();
#endif
    puts("OvO,I AK IOI");
#if !defined(fre______)
system("pause");
#endif
    return 0;
}

/*
14:42 打好快读

g++ -o a.exe arena.cpp -O2 -Wall -std=c++14 -static

14:52 看起来秒了T1
样例都过了的话
感觉应该也不用对拍了吧

15:00 开T2
这个n,m大得吓人阿
这咋写

还好我是一个智力正常的初(三学)生
所以我知道车行驶的路程成一个抛物线
抛物线的导函数肯定是一次函数

15:13
肥肠好，经过一点点简单的公式推导，我已经把问题转换成了依托区间的覆盖问题了

妈的你怎么不告诉我有0啊傻逼
15:46 解决第一个子问题

反正离散化过了，这个dp应该不成问题
状态就是保留前i个罚单的最少开启数

这里应该要预处理一个东西
哦我还少了一个优化
就是区间出现包含只要管小的就行了

然后我就发现其实离散化什么用都没有
// for(int i=1;i<=m;i++) a[i+n+n]=p[i];
// a[0]=0;
// sort(a,a+n+n+m+1);
// int cnt=unique(a,a+n+n+m+1)-a;
// write(a,a+cnt);
// for(int i=1;i<=n;i++) {
//     l[i]=lower_bound(a,a+cnt,l[i])-a;
//     r[i]=lower_bound(a,a+cnt,r[i])-a;
//     c[i]=i;
// }
// for(int i=1;i<=m;i++) {
//     p[i]=lower_bound(a,a+cnt,p[i])-a;
// }
// write(l+1,l+n+1);
// write(r+1,r+n+1);
// write(p+1,p+m+1);
16:06 写完预处理
16:09 死循环了看看发生什么事了
16:16 调出小样例
其实感觉还有点问题呢
我现在只要用树状数组写个区间覆盖就行了
16:25 应该正解了，开始测大样例
答案大了，这是怎么会是呢

离散化的确不能删，这样可以大大降低调试难度

16:39 哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈样例2过了

样例四怎么又不过
我怀疑是精度死了

不是哥们别告诉我调不出了吧

真的无法理解
为什么呢
我怎么算都是对的啊
为什么大样例是错的呢

*/

国际歌 + 114514

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    srand(time(0));
    /*
    qi lai, ji han jiao po di nu li
    qi lai, quan shi jie shou ku de ren
    man qiang de re xue yi jing fei teng
    yao wei zheng li er dou zheng
    jiu shi jie da ge luo hua liu shui
    nu li men qi lai, qi lai
    bu yao shuo wo men yi wu suo you
    wo men yao zuo tian xia de zhu ren
    zhe shi zui hou de dou zheng
    tuan jie qi lai dao ming tian
    ying te na xiong nai er jiu yi ding yao shi xian
    zhe shi zui hou de dou zheng
    tuan jie qi lai dao ming tian
    ying te na xiong nai er jiu yi ding yao shi xian
    */
    cout<<rand()%114514;
    return 0;
}

HOMO

const int HOMO=19198100;

Deep ♂ Dark ♂ Fantasy && 大哲学家王境泽

//      Author:WangJingze      //
//      Deep Dark Fantasy      //
#include<bits/stdc++.h>
#define il inline
#define re register
#define ll long long
#define u32 unsigned int
#define u64 unsigned long long
using namespace std;

signed main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    return 0;
}

人是_

//uid 482610，求关
//T3 推到一半发现假了，被创死。
//希望大样例强度足够，T1T2 不要挂
//破碎是新生的约定 我便愿为尘埃

信仰

#include <bits/stdc++.h>
using namespace std;
int main() {
    freopen("arena.in", "r", stdin);
    freopen("arena.out", "w", stdout);
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while (T --)
        cout << rand() << "\n";
        // ^
        // | Wo Bu Zhi Dao A, 12 mins for me is difficult to AC or Part_AC T4
    // wo hao cai a, dan shi Heavy_Data_Struct(luogu_uid = 808180) AKIOI!!!
}
/*
    xi xi fu, if you let my score >= 200, I will give you 2 * 10 ^ 6 Zimbabwe dollars.
*/

更强的信仰

#include<bits/stdc++.h>
using namespace std;
int T,n,a[200005];
namespace A {
    int main() {
        int ans=0;
        for(int i=0; i<(1<<n); i++) {
            int c=0;
            for(int j=1,r=0,b=0; j<=n; j++) {
                if(i&(1<<(j-1))) { // blue
                    if(a[j] == a[b]) c+=a[b];
                    b=j;
                } else { // red
                    if(a[j] == a[r]) c+=a[r];
                    r=j;
                }
            }
            ans=max(ans, c);
        }
        printf("%d\n",ans);
    }
}
namespace B {
    mt19937 rnd(time(0));
    int c[200005];
    long long ans;
    long long getans() {
        int s=0;
        for(int i=1,r=0,b=0; i<=n; i++) {
            if(c[i]) { // blue
                if(a[i] == a[b]) s+=a[b];
                b=i;
            } else { // red
                if(a[i] == a[r]) s+=a[r];
                r=i;
            }
        }
        return s;
    }
    long long getans2(int i) {
        int p=i-1;
        while(p>=1 && c[p]!=c[i]) p--;
        int p2=i-1;
        while(p2>=1 && c[p2]==c[i]) p2--;
        int q=i+1;
        while(q<=n && c[q]!=c[i]) q++;
        int q2=i+1;
        while(q2<=n && c[q2]==c[i]) q2++;

        long long s=0;
        if(a[i]==a[p]) s-=a[i];
        if(a[i]==a[q]) s-=a[i];
        if(a[p]==a[q]) s+=a[p];

        if(a[i]==a[q2]) s+=a[i];
        if(a[i]==a[p2]) s+=a[i];
        if(a[p2]==a[q2]) s-=a[p2];
        return s;
    }
    void SA(){
        double t=1000;
        while(t > 1e-6){
            int x=rnd()%n+1;
            long long d=getans2(x);
            if(d>0 || exp(d/t)*UINT_MAX>rnd()) ans+=d, c[x]^=1;
            t*=0.99;
        }
        for(int i=1; i<=1000; i++){
            int x=rnd()%n+1;
            long long d=getans2(x);
            if(d>0) ans+=d, c[x]^=1;
        }
    }
    int main() {

        a[n+1]=1e9;
        for(int i=1; i<=n; i++) c[i]=rnd()&1;
        ans=getans();
        if(n<=100){
            for(int i=1; i<=100; i++) SA();
        } else {
            SA();
        }
        printf("%lld\n",ans);

        return 0;
    }
}
int main() {
    freopen("color.in", "r", stdin);
    freopen("color.out", "w", stdout);
    scanf("%d", &T);
    for(int nowT=1; nowT<=T; nowT++) {
        scanf("%d",&n);
        for(int i=1; i<=n; i++) scanf("%d",&a[i]);
        if(n<=15) {
            A::main();
        } else {
            B::main();
        }
    }

    return 0;
}

S A 人

inline void sa1()
{
    double t=5000,down=0.95;
    while(t>1e-15)
    {
        int pos=(rand()%n)+1;
        c[pos]=!c[pos];
        long long tmp=calc();
        if(tmp>=ans) ans=tmp;
        else if(exp((tmp-ans)/t)*RAND_MAX<rand()) c[pos]=!c[pos];
        t=t*down;
    }
}
inline void sa2()
{
    double t=3000,down=0.99;
    while(t>1e-15)
    {
        int pos=(rand()%n)+1;
        c[pos]=!c[pos];
        long long tmp=calc();
        if(tmp>=ans) ans=tmp;
        else if(exp((tmp-ans)/t)*RAND_MAX<rand()) c[pos]=!c[pos];
        t=t*down;
    }
}
int main()
{
    freopen("color.in","r",stdin);
    freopen("color.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>T;
    while(T--)
    {
        srand(time(0));
        ans=0;
        memset(c,0,sizeof(c));
        cin>>n;
        if(n>100)
        {
            cout<<rand()*n*n<<endl;
            continue;
        }
        long long sum=0;
        for(register int i=1;i<=n;i++) cin>>a[i];
        srand(time(0));
        for(register int i=1;i<=n;i++) c[i]=rand()%2;
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        srand(time(0));
        for(register int i=1;i<=n;i++) c[i]=(rand()%3)%2;
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();sa1();
        srand(time(0));
        for(register int i=1;i<=n;i++) c[i]=(rand()%3)%2;
        sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();
        sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();sa2();
        cout<<ans<<endl;
    }
    return 0;
}

你高兴的太早了

我不会啊

if (n <= 3005) {
 printf("我不会啊");
 continue;
}

baidalan

//baidalan
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);

QAQ

// too hard QAQ

a.cpp

Ciallo～(∠・ω< )⌒★

if(a[o]<stk[i].l){
  // cout<<"Ciallo : "<<stk[i].l<<" "<<stk[i].r<<"\n";

Miku

struct Miku {
    int v0, a, x;
    int xv;
}de[N];

Megumi

void Megumi()
{
    int i,j;
    cin>>n;
    for(i=1;i<=n;i++)
    cin>>a[i],sv1[i]=a[i],sv2[i]=a[i];
    sort(sv1+1,sv1+1+n);
    svn=unique(sv1+1,sv1+1+n)-sv1-1;
    for(i=1;i<=n;i++)
    a[i]=lysmd(a[i]);
    for(i=1;i<=svn;i++)
    {
        mxx[i]=-INF;
    }
//  for(i=1;?)
}

void katomegumi()
{
    int i,j;
    cin>>n>>m>>L>>V;
    svm=m;
    for(i=1;i<=n;i++)
        cin>>d[i]>>v[i]>>a[i];
    for(i=1;i<=m;i++)
        cin>>p[i];
    sort(p+1,p+1+m);
    m=unique(p+1,p+1+m)-p-1;
}

珂学家

inline void ___()
{
    //怎么跟入门组一样
    //打完ABC不想写D
    //题目没看懂。还是太菜了
    //那咋办
    //要不输出1吧
    cout << "1\n";
    //好了
    //I like Chtholly!
    //I like Chtholly!
    //I like Chtholly!
    //I like Chtholly!
    //遛了喵
}

A-soul 贝拉

void BellaKira()
{
}

但是居然没有塔菲

结尾

用代码里找到的一段注释吧，送给我自己，也送给大家。

/*
要 AFO 了。
此生无悔入 OI。
希望所有 OIer 取得自己满意的成绩。
*/

                                            ——ZJ-S01849

CSP-S 2024 ZJ 迷 惑 行 为 大 赏

写在前头

正文

统计

迷惑行为大赏

Sword to CCF 镇楼

include<Windows.h>

include<bits\stdc++.h>

pragma GCC optimize("O2")

pragma GCC optimize(2)

include <bits/stdc++.h>

include<bits/stdc++.h>

if 0

:

include

define

endif

include<bits/stdc++.h> // fuck you linus

define pair std::pair<int, int> // fuck you linus

define fst first // fuck you linus

define snd second // fuck you linus

include <iostream>

include<bits/stdc++.h>

include<bits/stdc++.h>

define int long long

define getchar() paa==pd&&(paa=(pd=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*pd++

include<bits/stdc++.h>

include<bits/stdc++.h>

include<bits/stdc++.h>

define Long long long

define inf 0x3f3f3f3f

include <bits/stdc++.h>

include<bits/stdc++.h>

include <bits/stdc++.h>

define int long long

define file(name) freopen(#name".in", "r", stdin), freopen(#name".out", "w", stdout)

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

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

define fi first

define se second

define all(cont) cont.begin(), cont.end()

只出不进

arena.ans

asdf

哥们你 T2 估太高了吧，还有好恶臭啊

初（三学）生の独白

国际歌 + 114514

HOMO

Deep ♂ Dark ♂ Fantasy && 大哲学家王境泽

人是_

信仰

更强的信仰

S A 人

你高兴的太早了

我不会啊

baidalan

QAQ

a.cpp

Ciallo～(∠・ω< )⌒★

Miku

Megumi

珂学家

A-soul 贝拉

结尾

CSP-S 2024 ZJ 迷惑行为大赏