#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define mem(a,b) memset(a,b,sizeof(a));
#define all(x) (x).begin(),(x).end()
#define abs_(x) ((x)<0?-(x):(x))
#define sz(x) ((int)(x).size())
#define ull unsigned long long
#define pb push_back
#define fi first
#define se second
using namespace std;
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("crystal.in","r",stdin);
freopen("crystal.out","w",stdout);
int n,m;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
if(n==5 && m==5)cout<<3;
if(n==5 && m==8)cout<<4;
return 0;
}
//shayebuhui wuwuwu
```
(全文)
### 102
#### T2
我只是想骗个分能有什么坏心思呢?
```cpp
//欸,不是。CCF,我只是想骗个分啊你为什么这么刁难我?TELL ME,WHY!?
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("subway.in","r",stdin);
freopen("subway.out","w",stdout);
int c,n,m,d,q;
cin>>c>>n>>m>>d>>q;
if(c==0&&n==2n&&m==5&&d==20&&q==2)
cout<<"32\n17\n";
if(c==0&&n==3&&m==7&&d==20&&q==2)
cout<<"35\n16\n";
if(c==0&&n==15&&m==136&&d==20&&q==200)
cout<<"(注:此处省略若干)";
if(c==0&&n==480&&m==481&&d==20&&q==90000)
cout<<"(注:此处省略8万余行)";
```
### 104
#### T3
祝好。
```cpp
// a treat for me
// afo on 2026/10/31.
// Oct31==Dec25?
// trick||treat!
// I'm sorry for my parents
// bye oi.
// J2 S[2,3]
// why to do this
// i think my oi dont have any problems
// why,i give it so many times
// ccf lv7?
// i cant have it in this world
// im a loser
// it only have 8 mins.
// if give me then anythimes.
// if give me next year.
// if i wouldnt study oi...
// i will be a lose student.
// now too.
// Away From OI on Oct 31.
// 4mins.
// luogu's contest i can get 100+ pts
// /kel
// can i have the future?
// nobody knows.
// /bx ylx dyh zbl qhm qyl hyt sya cm mxh kkc dsa.
// not me.
// why...
```
(全文)
### 109
#### T3
一如既往的低。
```cpp
#include<bits/stdc++.h>
#define ll long long
using namespace std;
/*
希望CCF的数据强度一如既往的高,我才初一,不会退役的把 Update by10.30 18:27:00 chenmo_0310_lixin
*/
int c,t;
int main(){
freopen("migrate.in","r",stdin);
freopen("migrate.out","w",stdout);
cin>>c>>t;
if(t==2)cout<<"1\n2";
if(t==17)cout<<"8129\n16\n9\n7\n12\n0\n0\n0\n2\n1\n0\n2\n3\n6\n0\n2\n0";
return 0;
}
```
### 134
#### T2
破防了。
```cpp
//破防了我去,,,,,,,,,我咋啥也不会了,,,,,,,,,,,,,,,
```
并非全文,但代码 CE 了。
### 143
#### T2
一分没挂,恭喜。
```cpp
//O(nmlogm+qn) is trivial
//how to go better
//consider link sth between the routes
//then U know what to do with the d!
//that's easy
//make a 190*500000 match? sounds crazy
//you facing still a big challenge
//the good point is that you could floyd
//well done!
//the rest?
//is O(qd^2) acceptable
//of course
//that's it
//200 at last!
```
### 157
上 $3$ 个也是重量级啊。
#### T1
游记来着。
Wait, half an HOUR just passed? Man I should not have started that Tetris game.⪓⪓⪓⪓⪓⪓
```cpp
/*
14:19 Waiting for contest to begin...
Bored.
Found that in Code::Blocks IDE when use mouse to hover above words it will show the description.
Cool! A dictionary!
Hmm,let me see what this will take me...
14:22
What's a 'generic term'? Weird.
Apparently 'taxonomic' means categorization or something like that.
14:25
Bored. Waiting. I should just wait...and wait...and wait...
14:28
A clock precise to the millisecond. Just what I need for a coding competition.
14:33
Problem A seems simple.
Let me try...
14:45
Solved A!
So simple that probably everyone solved it.
B seems to be a graph problem. Let the nodes be the No. of the subway.
14:49
Problem statement B makes me sad.
Way to long.
14:57
Why the problem order in the submitting system is different from the problem order in the statement???
15:00
The real challenge in B is understanding the statement.
Why this is a Floyd! But how will I build the graph...
15:02
HOW WILL I BUILD THE GRAPH???
15:06
1st:build a graph with n+m nodes.O(sigma k)=5*10^5
2nd:for each subway line node run dij.O(n*dij)=O(500*forgot QAQ)
3rd:use the results to build the graph for the subways.O(n^2)=2.5*10^5
4th:run Floyd on the subway graph.O(n^3)=1.25*10^8 is this possible?
5th:read the query and print.O(q)=1*10^5
15:20
No wait.
1st:build a graph with n+m nodes.O(sigma k)=5*10^5
2nd:build the graph for the subways.O(n*m*min(d,n))=5*10^8 is this possible?
3rd:run Floyd on the subway graph.O(n^3)=1.25*10^8 is this possible?
4th:read the query and print.O(q)=1*10^5
Really,could anybody remember the time complexity of dij?
(ans:everyone except me)
7*10^8.Maybe?Let me calculate the min possible points earned when judge runs 1*10^8 per sec.
15:25
At least 50 points. This is definitely Floyd, so I'm going to assume it will pass.
3.2.1.Go! Start programming!
15:28
Wait. Why is there a 'number of test case' input? For easier sub-solutions?
15:38
Time complexity calculation non-optimal.
2nd:build the graph for the subways.O(n*m*min(d,n))=5*10^8 is this possible?
->
2nd:build the graph for the subways.O(sigma k*min(d,n))=1*10^8
Much better now!
total estimate around 2.5*10^8.
15:45
Oh no. Time complexity worse than I thought.
4th:read the query and print.O(q)=1*10^5
->
4th:read the query and print.O(q*d*d)=4*10^7
Not much though.
Re-calculation needed.
1st:build a graph with n+m nodes.O(sigma k)=5*10^5
2nd:build the graph for the subways.O(sigma k*min(d,n))=1*10^8
3rd:run Floyd on the subway graph.O(n^3)=1.25*10^8 is this possible?
4th:read the query and print.O(q*d*d)=4*10^7
Total equal to around 3*10^8.
Maybe?
15:50
Version 1 of B done!
16:35
B passed all large samples.
Time longest 0.5 s-probably no TLE.
16:37
answer to the password:today is not Christmas.
17:06
Wait, half an HOUR just passed? Man I should not have started that Tetris game.⪓⪓⪓⪓⪓⪓
18:20
Could not solve C.
100+100+0+0=200
Gonna test A&B.
*/
```
#### T3&T4
不可以,总司令!
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("hub.in","r",stdin);
freopen("hub.out","w",stdout);
int c,T;
cin>>c>>T;
for(int i=1;i<=T;i++)
cout<<"0\n";
//No, commander, no!
return 0;
}
```
```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("migrate.in","r",stdin);
freopen("migrate.out","w",stdout);
int c,T;
cin>>c>>T;
for(int i=1;i<=T;i++)
cout<<"0\n";
//No, commander, no!
return 0;
}
```
### 168
#### T1
CTRL+F,`int`,`long long`,CTRL+ALT+ENTER。
```cpp
#include <bits/stdc++.h>
#define AK return
#define csp 0
using namespace std;
long long n,m;
long long ans=0;
long long a[500010];
long long p[500010];
bool fa=1,fb=1;
long long fbs=-1;
long long fm=m;
long long l=1,r=1;
signed main()
{
//bu kai long long jian zu zong!
freopen("crystal.in","r",stdin);
freopen("crystal.out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
for(long long i=1;i<=n;i++)
{
cin>>a[i];
}
```
#### T4
I can speak Chinese!
```cpp
#include <bits/stdc++.h>
#define AK return
#define csp 0
using namespace std;
int main()
{
//freopen("hub.in","r",stdin);
//freopen("hub.out","w",stdout);
AK csp;
/*
大家好
我终于知道怎么写中文了
使用ibus engine就可以了
*/
}
```
### 177
#### T4
咋这么难?!
```cpp
bool check(int x) {
// za quan shi tu lun
if (rand() % 2 == 0) return 0;
return 1;
}
// J zha le T2 mei tiao chu lai sai hou yi kan T3 hui zheng jie T4 hui bao li po beng le
// S neng you 1= ma T1 wei zheng jie zui hou yi ge da yang li mei guo qian mian ji ge guo le
// qi wang 75+0+0+0 JL neng you 1= ma
// zui hou yi nian le
// oi-chat .netlify .app
void solve() {
int n, k;
cin >> n >> k;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
vec[u].push_back(v);
vec[v].push_back(u);
}
// za zhe me nan
```
### 189
#### T1
你给我 $100$ 分我都认了。
虽然 T1 确实没挂。
```cpp
//ji ba zhe ci de1 bu fen fen zen me dou zhe me bu hao xie
// T2 T3 T4 dou shi rngdle shui beng de zhu
//gan jue T3 8 fen ying gai mei wen ti T2 44 fen ke neng you hen da wen ti
//T4 15 fen bu zhi dao wei shen me di er ge yang li RE le,di yi ge guo de
//ai jiu zhe yang ba,zhi qiu T1 bu gua,ni gei wo 100 fen wo dou ren le
```
### 266
#### T1
咋复制的题面?!
```cpp
/*小 R 有 n 颗能量水晶,其中第 i (1 ≤ i ≤ n) 颗的能量值为整数 a i 。
小 R 想用其中若干颗能量水晶合成一颗大水晶,用于合成的水晶必须具有相同的
能量值。小 R 希望参与合成的水晶尽可能多。他可以进行 至多
. m 次操作。每次操作可
以任选一颗水晶,将其能量值增加 1;同一颗水晶可以被重复选择。
你需要帮助小 R 求出,进行至多 m 次操作后,他最多能用多少颗能量水晶合成一
颗大水晶。
Oct31==Dec25?
*/
```
#### T4
kskbl,zdjd
```cpp
//kskbl4109
```
### 268
#### T2
祝好
```cpp
#include <bits/stdc++.h> //wei shen me bu guo yang li!! wo xie le 3 ge xiao shi |`_`| gei wo ji fen ba...
```
### 271
#### T1
恭喜,但仍然改变不了 CCF 失去一些东西的事实。
```cpp
//wo qu
//wo hao xiang A le t1
//15:29 (tiao le ban tian fa xian sort fang cuo wei zhi le
//xie xie CCF
//xie xie shuang zhi zhen
//qsy I love you!
```
#### T2
唯一一个诈骗的。
歌没听过。
```cpp
//才发现可以用中文口牙!
//最后十分钟
//预计100+0+16+0
//t1好简单www希望补药炸……
//freopen feropen mian
//嘿嘿骗一下
//天空之下万事寥落 ————星尘/Mocker44《诗空茫》
//就这样吧!
```
### 278
#### T1
Believe yourself!
```cpp
/*
Believe yourself!
If the code don't run, 99% is your problem!
Believe yourself!!!!!
da jia xie xun huan de shi hou you zhe dian a !
*/
// 5min solved
// zhe me eazy?
// long long is save?
// nevermind, I trust you.
// small sample accepted, but large sample wrong???why???
// cyt sleep at 15:57
// awake at 16:39
// using 42min.
// binaray ans?
// yes.
// solved at 16:22
// i think this is yellow
// cyt is still sleeping.
```
### 341
#### T2
six sevennnnnnnnnnnnnn!
```cpp
//676767 /
// / -----------
// / /
// / /
// / /
// /------- /
// / \ /
// | | /
// \ / /
// \ / /
// ------ /
// /
```
## 编译错误
警钟敲烂!
共 $74$ 名选手。
### 010
#### T4
《bits/stdc++》
```cpp lines=1-1
#include <bits/stdc++>
using namespace std;
int main()
{
freopen("hub.in","r",stdin);
freopen("hub.out","w",stdout);
cout<<'1'<<endl;
cout<<'2';
}
```
### 013
#### T2&T3&T4
`"migrate.out"."w"`
```cpp lines=7-7
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("migrate.in","r",stdin);
freopen("migrate.out"."w",stdout);
return 0;
}
```
其余死因相同,不再展示。
### 014
这还是 c++ 吗?
```cpp
include<bits.bts/s> >
std using namespace;
int(main)
for{
foropen("crystal"in"c")
foropen("crystal"in"c")
}
int a <=1
for (int i<=0 ;i++)
{
count << a << a;
int a <=0;
}
for(int a <=0 ;i++){
int a std;
for (int a<=0 i++){
int a<=0;
forward_iterator_tag;
forward(int <=0 a++);
long(int (a));
string(int a <=b)
return 0;
for read(i<=50){
count<<a<<i++;
i++;
a++;
}
for(int a <= 0)
count<<
}
return 0;
```
(全文)
上述是 T1,其余死因相同,不再展示。
### 026
#### T4
以为是 PHP。
```cpp
0 1
99999 1000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
(以下省略100000行大样例)
```
### 035
`long long ll;`
#### T1
```cpp
#include<bits/stdc++.h>
using namespace std;
long long ll;
const int maxn=5e5+10;
ll a[maxn],sum[maxn];
```
### 050
#### ALL
众所周知 $1 \times 2=2$,所以两个单引号=双引号!
```cpp
freopen("a,out",''w'',stdout);
```
其余死因相同,不赘述。
### 364
#### T2
一万年内无人能看懂。
```
共一万余行空行中夹杂 166 个 12345678910100000000000000000000
行数间隔随机
```
### 156
#### T4
学 OI 有助于~改善~精神状态。
不管了,来打 florr.io 吧!
```cpp
呃啊啊啊啊啊啊啊啊啊
我要死了……;
我要打florr.io
t1似乎能过??
t2有分???
今年初二了,我太废物了
我好像要
A FFFFFFFFFFFF OOOOOOO
A A F O O
A A F O O
A A F O O
AAAAAAAAA FFFFFFFFFFFF O O
A A F O O
A A F O O
A A F O O
A A F OOOOOOO
了
(逻辑混乱)
(缺乏语言能力??)
```
### 148
#### T4
该数组共需 4TB。
>如果以绝对最低的总价为目标,目前最经济的方案是采用大容量的DDR4 ECC服务器内存来凑齐4TB,总价大约在13.6万元人民币左右。
>
>By DeepSeek
```cpp
bool a[2000005][2000005],b[2000005];
```
### 250
#### T1
真是一对笑面虎,两头乌角鲨啊!
甚至准考证号。
```cpp
const ll N=1e18;
int n,m,ans=1;
struct A{
long long a,c;
}b[N];
```
### 344
#### T3
mighub
```cpp
hub#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("migrate.in","r",stdin);
freopen("migrate.out","w",stdout);
long long c,t,n,d;
cin>>c>>t;
for(int i=0;i<t;i++)
{
x[200003]={ };
cin>>n>>d;
for(int j=0;j<n;j++)
{
cin>>x[i];
}
}
cout<<1<<endl;
cout<<2<<endl;
return 0;
}
```