NOIP 2024 JS 迷惑行为大赏
MatrixGroup · · 休闲·娱乐
选手代码下载
本次江苏共有
免责声明：以下代码不代表作者本人观点。
示例
以下是一个代码展示格式的示例。
JS-0000
（以上为选手的准考证号。）
[edit.cpp/assign.cpp] 你 被 骗 了
（以上表示以下代码段出现在了哪些程序中，和作者对其的评价。）
//freopen("input.txt","r",stdin);（以上表示代码片段。）
选手
选手按照准考证号顺序排序。
JS-0001
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] MagicDark 老师晚上好
// MagicDark[edit.cpp/assign.cpp/query.cpp] 为什么？？？
/*
why
*/[traverse.cpp] 为什么要遍历呢
/*
why
traverse
*/JS-0005
[traverse.cpp] 致不存在的边界情况
if(n==1){ //corner case
cout<<"1\n";
return;
}JS-0012
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 无线星光老师晚上好
// Author: InfiniteStarlightJS-0013
[edit.cpp] 游记人
/*
8:18 data.zip
query&traverse: tree problems nice!
assign seems mysterious
I guess traverse is T4, edit is T1
password is memory@2107
8:35 Read all the problems. I think t1 is not hard.
9:05 T1 is so hard. guopaile
9:13 What the hell is T2?
9:21 Passed the examples of T2.
9:52 wohui k=1 le!!!
10:52 Passed T3.
12:22 Passed the chain part of T4. How T4???
*/JS-0015
[assign.cpp/traverse.cpp] modint 爱好者
struct modint{
int num;
modint(){
num=0;
}
template<class type>
modint(type x){
num=x%mod;
}
modint<mod>(const modint<mod>&x){
num=x.num;
}
friend istream& operator>>(istream& in,modint<mod>&inp){
in>>inp.num;
inp.num%=mod;
return in;
}
friend ostream& operator<<(ostream& out,modint<mod>&&oup){
out<<oup.num;
return out;
}
operator int(){
return num;
}
};
template<int mod>
modint<mod> operator+(modint<mod>a,modint<mod>b){
return ((long long)(a.num)+(long long)(b.num))%mod;
}
template<int mod>
modint<mod> operator-(modint<mod>a,modint<mod>b){
return ((long long)(a.num)-(long long)(b.num)+mod)%mod;
}
template<int mod>
modint<mod> operator*(modint<mod>a,modint<mod>b){
return ((long long)(a.num)*(long long)(b.num))%mod;
}
template<class type>
type fp(type a,long long b){
if(b==1)return a;
auto w=fp(a*a,b/2);
if(b&1)return w*a;
return w;
}
template<int mod>
modint<mod> operator/(modint<mod>a,modint<mod>b){
return (a*fp(b,mod-2));
}JS-0016
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我超，圆
// sis puella oierJS-0017
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 暴，戾，语，言
{edit.cpp 开头}
// F{edit.cpp 结尾}
// U{assign.cpp 开头}
// C{assign.cpp 结尾}
// K{traverse.cpp 开头}
// C{traverse.cpp 结尾}
// C{query.cpp 开头}
// F{query.cpp 结尾}
// .JS-0018
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] Hawkrad 老师晚上好
#define Hawkrad
#ifdef Hawkrad[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 会赢吗
//mia san mia
//bayren will win tonightJS-0021
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 这就是我们的 NOIP 啊你们有这样的 NOIP 吗
// this is my noip.[assign.cpp/traverse.cpp] %b6e0
b6e0(1e9+7);JS-0028
[edit.cpp/query.cpp] YH 老师晚上好
#ifdef _YH_DEBUGJS-0031
[edit.cpp] 呃呃，呃呃
// 呃呃，怎么又不会做 t1 了。
// 这么不牛吗？？？？
// 首先看起来贪心没啥道理，因为你都不知道咋贪。
// 特殊性质 A, B, C 是 trivial 的。
// 然后其实就是，01 内部顺序不会变，就有点能贪心的道理，对吗[assign.cpp] 先放着
// 09:05 过样例了，先放着。[traverse.cpp] 致敬传奇 irris T3 写 8KB
// 有点唐，现在才知道咋做。
// 现在相当于每个点钦定 2 个方向，要求所有方向的交里至少有一条边是合法的。
// 答案再乘以 prod_{deg[u] >= 2} (deg[u] - 2)!
// 我咋写了 3h 不能要了。。。。JS-0041
[traverse.cpp] 所以我放弃了读入
// for(int i=1;i<n;i++){
// }JS-0044
[query.cpp] 所以我放弃了输出
freopen("query.in","r",stdin);
//freopen("query.out","w",stdout);JS-0045
[traverse.cpp] 除以
/*
count the possible trees after vertex-edge transfer
count then one by one,and then /k
*/JS-0049
[assign.cpp] lim，毁灭吧
// save memory by destroying `lim`JS-0052
[query.cpp] 所以我放弃了计算
signed main()
{
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
}JS-0056
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我有雨雨症
//Rain Rain RainJS-0057
[edit.cpp/assign.cpp/traverse.cpp] 我趣，后面忘了
/*
When a shadow falls across your world,
And your enemy wants nothing but your annihilation.
Where will you find your allies,
in a desperate struggle for survival?
*/[query.cpp] 再见，祝好
#include <iostream>
using namespace std;
int main()
{
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
cout<<"GOODBYE OI";
return 0;
}JS-0058
[edit.cpp/assign.cpp/query.cpp] rp++
//NOIP rp++[query.cpp] 输
//T2 failJS-0059
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 你最棒。
// Patience Persistence Passion
// Come on. You are the best!JS-0061
[edit.cpp] 提醒自己
/*
*** read the problems carefully and at least twice
** always take a positive and calm attitude
1. do bruteforce first and take the 1=
2. freopen, return 0, basic CE problems
3. list out of range, STL RE problem
4. menset, memory and time limit
5. cerr, extra output, other problems
6. remember to duipai
always be confident of yourself! XZYZ and HJJ must win!
check the version, filename and in/output at last
*/JS-0067
[query.cpp] 祝好喵
/*
so no ha na wo saka se ba a to wa
ka re ru no ga so no sa da me ka
so no i no chi chi ra shi te tsu na gu
o mo i wo su be te u ke to tte
take no hana
la la la la
*/
/*
R.I.P. Akyuu
R.I.P. Karl_Aurora
*/
/*
Dear Akyuu can revive after 100 years,
but Karl_Aurora can't. :(
*/JS-0070
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我超，原
/*
See, sometimes it's rainy
Sometimes it's cloudy
That's what journey means
Can't see
The scene ahead is blurry
But we still must pursue the dream
*/[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我超，二次原
/*
Will there be that day
Tell me
Please tell me
*/[query.cpp] 再见。
// Goodbye, OI!JS-0071
[edit.cpp] xiaruize 老师晚上好
//Author: xiaruizeJS-0074
[edit.cpp] 多测要清空
// duo ce yao qing kong[assign.cpp] 注意 ull
//zhu yi ullJS-0075
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 保佑喵
//sxy bless pr[edit.cpp] 抽象 T1
//08:30~09:46 76 min
//chouxiang T1[assign.cpp] lim!
//lim!
//09:47~12:47[traverse.cpp] 永远，永远
else puts("Love sxy forever!");JS-0087
[traverse.cpp] rp 加加感叹号感叹号感叹号
int main()
{
freopen("traverse.in","r",stdin);
freopen("traverse.out","w",stdout);
cout<<"rp++!!!"<<endl;
return 0;
}JS-0088
[edit.cpp] 多测要清！空！
//many Tests CLEAR!!!!!!![traverse.cpp] 输入入入入入入入输出
#include<bits/stdc++.h>
using namespace std;
int x;
int main(){
freopen("traverse.in","r",stdin);
freopen("traverse.out","w",stdout);
while(cin>>x){}
cout<<5;
return 0;
}JS-0095
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] import 大神啊
// import bless from molly[query.cpp] 明天会更好
if (n > 20000)
{
puts("Best wishes for the tomorrow!");
return 0;
}JS-0098
[assign.cpp] 神秘调试
//puts("112erarwe");JS-0103
[traverse.cpp] 为什么是过去时？？？
void did18()
{
cout<<1<<endl;
}JS-0105
[edit.cpp] 中文大神
struct node
{
int l;
int r;
int ling;
int yi;
};JS-0108
[assign.cpp] 所以我放弃了做 B
void solveB(){
}JS-0111
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] noip2024 rp++
//noip2024 rp++JS-0120
[traverse.cpp] 所以我
（以上为代码全文。）
JS-0128
[assign.cpp/traverse.cpp] 你在干啥啊？
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
}JS-0135
[traverse.cpp] 1e9+7
#include<bits/stdc++.h>
using namespace std;
const int N=1e9+7;
int main()
{
freopen("traverse.in","r",stdin);
freopen("traverse.out","w",stdout);
return 0;
}JS-0136
[query.cpp] 告别
int main(){
//freopen("query.in","r",stdin);
//freopen("query.out","w",stdout);
//This is a test to test whether the bytes are correct
//Farewell to NOIP
return 0;
}
/*-----------------THE END-----------------*/JS-0138
[edit.cpp] 60pts
// T1
// for case A,B,C 60pts[assign.cpp] 猪脑过载.jpg
// T2
// 0pts
// I tried, but failed. Pig brain overloaded.[traverse.cpp] 永无止境的 rp++
// T3
// 0pts - 100pts
// while(1) rp++;[traverse.cpp] 你就说快不快吧
// just say if it's fast! ni3 jiu4 shuo1 kuai4 bu2 kuai4 ba ![query.cpp] 无论如何
// T4
// tried for A, wrong algo, O(nq)
// I even haven't got the time to write a standard LCA qwq
// 0pts
// This is my first NOIP in senior high.
// It was a bit harder than I thought.
// I got 200pts in CSP-S.
// When being asked how much I may get in NOIP2024,
// 100, maybe, I said.
// Now I may get only 60 or less.
// I'm too weak.
// Anyway, I've tried.
// In NOIP2023, I thought it's my last OI.
// Now I'm OIing again!
// Everything will change.
// Let's do better next year!
// It's 12:53 now.
// Everything checked.
// Let's get some food after all this mess.
// I'd like sweet one.JS-0139
[edit.cpp] 啊啊啊啊啊
void so5() {
cout << "Ahhhhhhhhhhhhhhh!!!\n";
}JS-0141
[traverse.cpp] 所以我放弃了暴力
int main(){
//freopen("traverse.in","r",stdin);
//freopen("traverse.out","w",stdout);
int v,t;
scanf("%d%d",&v,&t);
while(t--){
u.clear();
p=0;
m=0;
memset(d,0,sizeof(d));
scanf("%d%d",&n,&k);
for(int i=1;i<n;i++){
int b,c;
scanf("%d%d",&b,&c);
a[b].push_back(c);
a[c].push_back(b);
u[{b,c}]=u[{c,b}]=i;
l[i]=b;
l2[i]=c;
}
for(int i=0;i<k;i++)
scanf("%d",&d[i]);
q(l[d[0]],0,1,0);
q(l2[d[0]],0,1,0);
printf("%d\n",p);
}
return 0;JS-0146
[assign.cpp] 所以我放弃了 dfs
void dfs(int x)
{
}[traverse.cpp] 这是 traverse？
signed main()
{
n=read();
q=read();
for(int i=1;i<n;i++)
{
u=read();
v=read();
addedge(u,v);
addedge(v,u);
}
dfs(1);
while(q--)
{
u=read();
v=read();
k=read();
int res=0;
for(int i=u;i<=v;i++)
{
for(int j=i+k-1;i<=v;i++)
{
res=max(res,dep[LCA(i,j)]);
}
}
printf("%lld\n",res);
}
return 0;
}（总之就是 query.cpp 去掉了文件读写相关）
JS-0150
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 开（物理） freopen
//open the freopenJS-0151
[edit.cpp/assign.cpp] memory@2107
/*
memory@2107
*/JS-0164
[traverse.cpp] 你好呀
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("traverse.in", "r", stdin);
// freopen("traverse.out", "w", stdout);
ios::sync_with_stdio(0);
cout.tie(0), cin.tie(0);
cout << "hello" << endl;
}[query.cpp] 你好鸭
#include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("query.in", "r", stdin);
// freopen("query.out", "w", stdout);
ios::sync_with_stdio(0);
cout.tie(0), cin.tie(0);
cout << "hello" << endl;
}JS-0166
[edit.cpp] 祝好。
// oi life
//ends
//start from 2020
//daitangchen:afo on NOV 30,2024
//byeJS-0170
[assign.cpp] 推理缜密
/*
1. no chain
2. has chain but satisfied
unsatisfied chain = only last one unsatisfied
else = satisfied
ans = PI satisfied
long long?
*/JS-0173
[edit.cpp] 啊啊啊啊啊啊啊
if(tot1==n){cout<<tot2<<'\n';continue;}// AAAAAAAAAAAAAA
if(!tot1){cout<<n-tot2<<'\n';continue;}// AAAAAAAAAAAAAA
if(t1==t2){// BbbbbbbbbbbbbbbbbbJS-0178
[edit.cpp] 祝好……
//AFOJS-0184
[edit.cpp] 要素过多
/*
Observation #1:
elements that cannot be changed separate the array into blocks.
Observation #2:
by swapping adjacent elements, you can obtain any array.
Now we can count the occurences of 0 & 1 and use the greedy approach.
Time Complexity O(n). Expected 100pts.
==============================
testcase time memory
edit1 0.00s 3320kb
edit2 0.09s 6764kb
*/
/*
There are plenty of ways you can hurt a man
And bring him to the ground
You can beat him, you can cheat him, you can treat him bad
And leave him when he's down
But I'm ready, yes i'm ready for you
I'm standing on my own two feet
Out of doorway the bullets rip
Repeating the sound of the beat
-- Another One Bites The Dust, Queen
*/
/*
09:22 submitted a, exp 100pts.
11:17 submitted b, exp 100pts.
12:25 submitted d, exp 32pts(subtasks [6, 13]).
12:50 submitted c, exp 4pts(subtask 18).
*/[assign.cpp] 书接上回
/*
Observation #1:
the answer (before modulo) is 0 <==> a variable is assigned multiple times.
Observation #2:
the reason why a set of assignment is invalid is because of the fixed variables.
Observation #3:
fixed variables separate the array into blocks. (why this again??? lord)
Now we can calculate the answer using quick-pow and inv.
But your code should be well-writen otherwise you will get TLE.
Time Complexity O(m (log n + log m + log v))?? Expected 100pts.
==============================
testcase time memory
assign1 0.00s 3676kb
assign2 0.00s 3668kb
assign3 0.15s 6584kb
max-data 0.55s 6856kb
*/
/*
There are plenty of ways you can hurt a man
And bring him to the ground
You can beat him, you can cheat him, you can treat him bad
And leave him when he's down
But I'm ready, yes i'm ready for you
I'm standing on my own two feet
Out of doorway the bullets rip
Repeating the sound of the beat
-- Another One Bites The Dust, Queen
*/[traverse.cpp] 再来一次
/*
There are plenty of ways you can hurt a man
And bring him to the ground
You can beat him, you can cheat him, you can treat him bad
And leave him when he's down
But I'm ready, yes i'm ready for you
I'm standing on my own two feet
Out of doorway the bullets rip
Repeating the sound of the beat
-- Another One Bites The Dust, Queen
*/[query.cpp] 最后一击
/*
subtask [6, 13] : n, q <= 10^5, chain
<=> find interval minimum using sparse table.
Time Complexity O(q log n). Expected 32pts.
===============================
testcase time memory
query3 0.12s 16804kb
*/
/*
There are plenty of ways you can hurt a man
And bring him to the ground
You can beat him, you can cheat him, you can treat him bad
And leave him when he's down
But I'm ready, yes i'm ready for you
I'm standing on my own two feet
Out of doorway the bullets rip
Repeating the sound of the beat
-- Another One Bites The Dust, Queen
*/JS-0185
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 中英双语
//kai long long,look out for the bian liang ming,duo ce yao qing kong!!!JS-0192
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] Skadi_H 老师晚上好
//Skadi_HJS-0202
[edit.cpp] 手动清空
//multi tasks,clear by hand!!!JS-0213
[edit.cpp] 零昏！
// 0pts
namespace tc17t20 {JS-0217
[traverse.cpp] 我毫无头绪。
//I don't have any thoughts at all.（以上为代码全文。）
JS-0220
[edit.cpp] 恶臭人
else {
cout << 114514 << "\n";
}JS-0221
[assign.cpp] 莽就对了
if(n<=12&&m<=12&&v<=2){//12345,mang jiu dui leJS-0222
[traverse.cpp] 所以我放弃了
#include<bits/stdc++.h>
using namespace std;
long long read(){
long long a=0;int f=1;
char c;
c=getchar();
while(c<'0'||c>'9'){if(c=='-'){f=-1;c=getchar();}}
while(c>='0'&&c<='9'){a=a*10+c-'0';c=getchar();}
return a;
}
int v,T;
int main(){
freopen("traverse.in","r",stdin);
//freopen("traverse.out","w",stdout);
c=read();
T=read();
if(c<=6){
while(T--){
}
return 0;
}
return 0;
}[query.cpp] 不演了
#include<bits/stdc++.h>
using namespace std;
long long read(){
long long a=0;int f=1;
char c;
c=getchar();
while(c<'0'||c>'9'){if(c=='-'){f=-1;c=getchar();}}
while(c>='0'&&c<='9'){a=a*10+c-'0';c=getchar();}
return a;
}
int main(){
freopen("query.in","r",stdin);
//freopen("query.out","w",stdout);
return 0;
}JS-0225
[traverse.cpp] 你给我跑哪里来了这还是 traverse 吗
while(q--){
int l,r,k;
cin>>l>>r>>k;
}（省流：该程序和 query.cpp 除了 freopen 别无二致。）
JS-0226
[edit.cpp] 摸摸，会好的。
/*
T1 bu hui xie :(
wo ke yi qu si le
zhe xia zhen de yao bao ling le
*/JS-0230
[edit.cpp] 特色性质
// feature A done 20ptsJS-0231
[edit.cpp] falied
//I tried,and I falied.[assign.cpp] 我始终铭记
//Goobye,my OI career.I will miss you.[query.cpp] 六年之期
//Perhaps,I have to be AFO.Six years is a long time,and I came,did,and now leave.JS-0233
[edit.cpp] 大样例
/*
1
997
0000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000111001100101110111011100010111111000001110010101110011100011010011110011010100110001110000110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000100000000000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
1111111111111011111111100001000010110000101101011100001100110000110000010000000000000001010000001000111000100010000111111111111111111101000011110000000010010000001111010101111100110000000000000000000000000000000001000000001000001110010110101011011100001100101010101101000000000000001100111111001001101101111000000001001001111001111100001010001001000010001101000100010100010101010110000111110100101100001010101010000100111111011100000011111111001011010011010100101010000000001111111011011100010100110110000010111000110000000000101101001110100010000000010000000000000101010111011000100001000000010000000110011001111111111110101111100000000000100000001000000000010111001110010101001111001100000000000100000001001010001111111111111111111111011001011000000101111000011111110011111111111111000010000000010011001000000000010010000100000011011110011100101010010000001000100000010101011000100000101000000011110111110010011000100000000100011000101010001110010110001110011111111110110000000000110010100000011
1111111111111011111111011111111110111111111111111010100111111111111011101010100110000001101000011111011110010000101011111101111111110110111111101010111101101111111111100110111111100011111111111111111111111111111110111111111101011111111111111111111111100110111111111110110111111111110111011011000011101111001111111010111111110111111111111111111111100111001110111101001101100011111011111011011111100101111111110011000100100110111010101011001110100111110110111101111101111111100111111100111110110110111111111111011111101110111010000011111111111110111110101110111110101111011100110111101111101001011111101101111011111111111111111011101011111111111111111111111111011110010111011111111111101101111111111001110100111101100111111111111111110110110111110111111111101101101000111101110111010011110100100010101101011111111111111111111111111101110111111111111111100100101010011111101111110111011111111111010011011101011111111111011111111010011110111111111011111100111101011110111111101110111111001110100000111
1111111111111011111111011111111110111111111111111010100111111111111011101010100110000001101000011111011110010000101011111101111111110110111111101010111101101111111111100110111111100011111111111111111111111111111110111111111101011111111111111111111111100110111111111110110111111111110111011011000011101111001111111010111111110111111111111111111111100111001110111101001101100011111011111011011111100101111111110011000100100110111010101011001110100111110110111101111101111111100111111100111110110110111111111111011111101110111010000011111111111110111110101110111110101111011100110111101111101001011111101101111011111111111111111011101011111111111111111111111111011110010111011111111111101101111111111001110100111101100111111111111111110110110111110111111111101101101000111101110111010011110100100010101101011111111111111111111111111101110111111111111111100100101010011111101111110111011111111111010011011101011111111111011111111010011110111111111011111100111101011110111111101110111111001110100000111
*/JS-0240
[edit.cpp] 满昏！
//8:56 pass pretest 1
//9:03 pass pretest 2
//100 pts![assign.cpp] 话说回来
//10:56 35pts[traverse.cpp] 英语仙人
//spA: line spB: flowerJS-0241
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我趣，幸运星
#define Izumi using
#define Konata namespace
#define suki std
Izumi Konata suki;[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 盼君勿忘
//>>>DON'T forget to DELETE the // before FREOPEN!!!<<<[edit.cpp] 思路打开
/*
silu:
yi buke jiaohuan de dian wei fenjiexian
chuli meiliangge fenjiexian zhijian de qujian
*/[assign.cpp] 中英夹杂
/*
silu for specialA:
if a[i]=x[i], b[i] must be x[i+1]
if a[i] != x[i], b[i] can be any number
*/[traverse.cpp] 思路很好，但是没分
/*
silu:
xian yong bian chongxin jiantu
specialA: ans=1
specialB: wanquantu(jiedian shu wei n-1)
*/（这个程序获得了
[query.cpp] 减
//silu for specialA: bianli qiuchu shendu, qujian zuidazhi -k+1JS-0242
[query.cpp] 这不是 a 吗
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5,M = N*2;
int main(){
cout << sizeof(a);
return 0;
}JS-0245
[assign.cpp] 乱码仙人
freopen("assign.out","w",stdout);//lhjsodfiuwensgvohwoerhgsodhgoiwertgJS-0248
[query.cpp] 憋不住了
// fuck CCF
// ******JS-0257
[traverse.cpp] 你是？
#include <bits/stdc++.h>
using namespace std ;
int main() {
// freopen("traverse.in", "r", stdin) ;
// freopen("traverse.out", "w", stdout) ;
string s = "ssvsfdg" ;
cout << s.substr(2, 3) ;
return 0 ;
}（以上为代码全文。）
JS-0265
[query.cpp] qwq.in
#include<bits/stdc++.h>
using namespace std;
int main()
{
//freopen("qwq.in","r",stdin);
//freopen("qwq.out","w",stdout);
return 0;
}（以上为代码全文。）
JS-0267
[assign.cpp] 不可能！绝对不可能！
if(tail < 0){
cout << "impossible"; // debug
break;
}[traverse.cpp] 欲言又止
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("traverse.in", "r", stdin);
freopen("traverse.out", "w", stdout);
cout << 2
return 0;
}（以上为代码全文。）
[query.cpp] 对线段树的爱
#include <bits/stdc++.h>
using namespace std;
int seg[1001], arr[1001] = {1, 2, 3, 4, 5, 6}, tag[1001];
#define left(p) (p*2)
#define right(p) (p*2+1)
#define mid(x,y) ((x+y)/2)
void build(int l, int r, int p){
if(l == r){
seg[p] = arr[l];
}else{
build(l, mid(l,r), left(p));
build(mid(l,r)+1, r, right(p));
seg[p] = seg[left(p)] + seg[right(p)];
}
}
void push_down(int l, int r, int p){
seg[p] += tag[p]*(r-l+1);
if(1 != r){
tag[left(p)] += tag[p];
tag[right(p)] += tag[p];
}
tag[p] = 0;
}
void update(int l, int r, int s, int t, int p, int c){
push_down(s, t, p);
if(r < s || l > t)
return;
if(l <= s && t <= r){
tag[p] += c;
push_down(s, t, p);
return;
}
update(l, r, s, mid(s,t), left(p), c);
update(l, r, mid(s, t)+1, t, right(p), c);
seg[p] = seg[left(p)] + seg[right(p)];
}
int query(int l, int r, int s, int t, int p){
push_down(s, t, p);
if(r < s || l > t)
return 0;
if(l <= s && t <= r){
return seg[p];
}
return query(l, r, s, mid(s,t), left(p)) + query(l, r, mid(s, t)+1, t, right(p));
}
int main(){
// build(0, 5, 1);
// cout << query()
// update(1, 3, 1);
return 0;
}（以上为代码全文。）
JS-0271
[assign.cpp/traverse.cpp/query.cpp] 如此如此，令人令人
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int a[N],dep[N];
vector<int> g[N];
inline long long read();
void dfs(int u,int fa){
for(auto v:g[u]){
if(v==fa)continue;
dep[v]=dep[u]+1;
dfs(v,u);
}
}
int main(){
freopen("test.in","r",stdin);
freopen("query.out","w",stdout);
long long n=read();
for(int i=1;i<n;++i){
int u=read(),v=read();
g[u].push_back(v);
g[v].push_back(u);
}
dep[1]=1;
dfs(1,0);
int q=read();
while(q--){
int l=read(),r=read(),k=read();
printf("%lld\n",);
}
return 0;
}
inline long long read(){
long long x;
scanf("%lld",&x);
return x;
}（以上为代码全文。）
JS-0272
[assign.cpp] 请别遗忘
// Remember to check the freopen![traverse.cpp] 我能在每个测试点
// 3 ptsJS-0273
[traverse.cpp] 不断重复的 rp++
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cout << "rp++" << endl;
}JS-0275
[assign.cpp] 看不懂.jpg
typedef struct ufrfre{
int c;
int d;
}Q;JS-0280
[edit.cpp] 大家看到的记得去玩月计
/*
//freopen("edit.in","r",stdin);
//freopen("edit.out","w",stdout);
my luogu name: terabyte_connection
011101
111010
111010
101101
101111111
110111011
100111000
011111111
011000100
111000111
NOIP ji
8:20
ya suo bao de data jing ran ke yi zhi jie da kai.
hao sheng qi
8:25
xian duan shu wan gong
8:28
ban zi da hao le
xia fa mi ma
password:memory@2107
9:26 T1 bu hui zuo
9:35 kai T2
10:04 bu hui
10:10 T1
10:42 T1
11:06 hai shi T1
11:07 bu xie T1!
11:10 zhao dao yi ge T1 fu za du 2^(2^(n^2)) de chao jue jie fa
11:11 waht can i say
11:38 T4 bao li
12:13 T4 bao li hao le
12:30 T3 bao li
12:31 added: T1 jiu shi chun chun de ni tian ti mu
12:39 T3 ru xia
if(c==18)printf("1\n");
else printf("%lld\n",(ll)rand()%mod);
12:41 20+5?+4+10 AFO
12:49 fa xian zi ji T4 xie de shi O(n) fu za du de lca.
12:50 wu li hui tian. hai you shi feng zhong
from the darkest night i come ~
da jia kan dao de ji de qu wan project moon
*/[assign.cpp] 欢迎
/*
//freopen("assign.in","r",stdin);
//freopen("assign.out","w",stdout);
my luogu name: terabyte_connection
suzhou foreign language school welcomes you!
*/[traverse.cpp] 诈骗犯
/*
//freopen("traverse.in","r",stdin);
//freopen("traverse.out","w",stdout);
my luogu name: terabyte_connection
suzhou foreign language school welcomes you!
*/[query.cpp] 线段树好闪
// bu hui st biao,zhi hui xian duan shu.qwqJS-0282
[assign.cpp] NOIP 笑传之冲错暴
//funniest of the series: I wrote a wrong brute but a correct solutionJS-0286
[traverse.cpp] 空即是色
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("traverse.in","r",stdin);
freopen("traverse.out","w",stdout);
return 0;
}（以上为代码全文。）
[query.cpp] 色即是空
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);
return 0;
}（以上为代码全文。）
JS-0293
[query.cpp] 歌词大神
/*
This world, concrete flowers grow
Heartache, she only do what she know
Weekends, still popping on the low
Better days coming for sure
*/JS-0294
[edit.cpp] 期望得分
// 40pts expectedJS-0294
[edit.cpp] 所以我放弃了调试
//freopen("edit2.in","r",stdin);
// freopen("edit2.out","w",stdout);[edit.cpp] 不嘻嘻
//baolingla
//buxixi
//sad face
//QvQ[query.cpp] 所以我放弃了放弃
freopen("edit2.in","r",stdin);
freopen("edit2.out","w",stdout);[query.cpp] 梅开二度
//baolingla
//buxixi
//QvQJS-0302
[assign.cpp] 如此 assign，如何 assign？
signed main(){
freopen("assign2.in","r",stdin);
freopen("assign.out","w",stdout);
cin>>t;
while(t--){
cin>>n>>m>>v;tmp=v*v-v;
for(int i=1;i<=m;i++) cin>>c[i]>>d[i],num[c[i]]=d[i];
dp[0]=1;for(int i=1;i<=n;i++) dp[i]=dp[i-1]*tmp%mod;
cout<<dp[n]<<'\n';
}
return 0;
}[query.cpp] 诈骗犯举办了
freopen("query2.in","r",stdin);
freopen("query.out","w",stdout);（这份代码没有输出，合理推测这个 freopen 是为了诈骗的。）
JS-0304
[edit.cpp] 不 OK
cin>>s[0]>>s[1]>>t[0]>>t[1];//0 buOK 1 OKJS-0306
[edit.cpp/assign.cpp/traverse.cpp] hbs 老师晚上好
//by hbs
// remember to clear the dataJS-0309
[edit.cpp] 我超，源
//How can i debug it QAQ
//I wanna play Arcaea uwu[assign.cpp] 这是我最后一次将过去怀缅
// My Last NOIP[traverse.cpp] 未完成的故事
#include <bits/stdc++.h>
using namespace std;
int main()
{
cout << "xie bu wan le qwq";
}JS-0317
[edit.cpp] 毕竟，毕竟
/*
* Oh, no! I cannot find the correct solution of the first problem.
* But, after all, I've got the first prize in last year's NOIP.
* So, the situation seems not to be so bad.
* (((
*/[assign.cpp] 永远……
/*
* I love Hatsune Miku forever!
*/[assign.cpp] 然而，然而
/*
* But adorable Miku couldn't provide me with any points...(
*/[query.cpp] 会的。一定会的。
/*
* AFOed.
* This is where the dream ends.
* After graduating from the high school, the fight will continue.
* My own compiler, game, OS... are there waiting to be created or completed.
* So, let's throw away today's unhappiness and open up a new life with a positive state.
* Don't give up what you love because of anything.
* Just as Techer said, "Our purpose will absolutely be reached."
* I'll continue struggling for them,
* Even if the hope is weak,
* Even if the road is long,
* Even if the current generation will not see its achievement or enjoy its advantage,
* Even if each of my participants have given up.
* The only reason of my effort is that I love it or that it's benefit to the people.
* Hmmmmm... The contest will be over soon.
* But the struggle carries on!
*/（这位选手还有一些发到洛谷上也许被禁专栏的内容，欢迎自行前往阅读。）
JS-0323
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 吾日三省吾身
/**
multiple cases data clear ?
using ll instead of int ?
memory limits available ?
brute force ? least dp ?
file in / out correct ?
data structure used ?
subcases points get ?
keep a positive thought.
do your best and do NOT give up!
*/[query.cpp] 卡车走丢
// track lostJS-0327
[edit.cpp/assign.cpp/traverse.cpp] 0x72656C
//I love 0x72656C[edit.cpp/assign.cpp/traverse.cpp] 重要的事情说三遍
//use long long if necessary!!!
//use long long if necessary!!!
//use long long if necessary!!![edit.cpp/assign.cpp/traverse.cpp] 清空！！！
//clear data!!![edit.cpp/assign.cpp/traverse.cpp] write your code here
//do not write anything after this!!!
return 0;JS-0335
[edit.cpp] 你好，再见。
// Hello, my friend from luogu or somewhere else.
// I believe there will be someone who reads my code several days after the contest.
// I was writing the following words at 08:16, 2024/11/30. Read them please.
//
// I am a grade 11 student. This is my first, and probably my last time of NOIP. I wish I could get a good grade.
// It has been only 1 year, 1 month and 19 days since I began to learn OI.
// I did not know anything about OI until my classmate invited me on 2023/10/12.
// However, I began programming when I was in grade 5.
// I learned Python, Java, C++, JavaScript and Lua by myself.
// My favorite game is Minecraft, and I became a Minecraft modder in grade 7.
// Recently I am working on the mod Sweet Potato Reborn, a mod about agriculture and magic.
// You can download it on MCMOD, Modrinth or Github.
//
// How to contact with me:
// luogu @QWERTY_770
// Github @QWERTY_770
// QQ group(programming & mod development) 912759411
//
// int magic_number = 17381738;
// int another_magic_number = 23342334;JS-0337
[assign.cpp] 为什么段错误？？？？？
//x[j] = 0;Why segmentation fault!!!!!?????[assign.cpp] 给我我的
//Give me my 15 points!![traverse.cpp] 遍历失败
//"The World is fair, I totally lose this time..."
//wo bian li ge ji mao[query.cpp] 下次一定
//"CCF can you be kind next time?"
//wo cha xun ge ji maoJS-0339
[query.cpp] 好像不注释掉也没分
//freopen("query.in","r",stdin);
// freopen("query.out","w",stdout);JS-0340
[assign.cpp] 啥啊
freopen("edit2.in","r",stdin);
//freopen("edit.out","w",stdout);JS-0342
[traverse.cpp] 既要也要
if(c==18){
cout<<1<<endl;
}
else{
cout<<1<<endl;
}[query.cpp] 祝好——
//afo（省流：这份 query.cpp 比 traverse.cpp 只多了一行这个注释。）
JS-0345
[assign.cpp/traverse.cpp/query.cpp] 哇这个好可爱呀
//*++++++++++++++++++++++++++*JS-0348
[query.cpp] 所以
（以上为代码全文。）
JS-0353
[query.cpp] 我超，崩 3
//Some deserts in this world were oceans once.
//Somewhere shrouded by the night, the sun will shines.
//Sometimes I see a dying bird fall to the ground.
//But it used to fly so high.
//I thought I were no more than a bystander till I feel a touch so real.
//I will no longer be a transient till I see smiles with tears.
//If I have never known the sour of farewell and pain of sacrifies,
//What else should I engrave on mind?
//Frozen into icy rocks, that how it starts.
//Crumbled like the sands of time, that how it ends.
//Every page of the tragedy is thrown away,
//Burnt out in the frame.
//A shoulder for the past, let out the cries imprisoned for so long.
//A pair of wings for me at this moment, to soar above the world.
//Turn into a shooting star thar briefly shines that warms up every heart.
//May all the beauty be blessed.
//I will never go
//It's the way we back home
//Brighter than tomorrow and yesterday
//May all the beauty be blessed
//Wave goodbye to the past when hopes and faith has grown so strong ans sound
//Unfold the pair of wings for me again to soar above this world
//Turn into a moon that always tell the warmth and the brightness of the sun
//May all the beauty be blessed.
//rp++JS-0365
[traverse.cpp] 永不后悔
//This is the last time I attend NOIP.
//I have learnt C++ for about 21months,I thank Teacher Chen and many my classmates.
//I never regret about learning about it.
//I Thank CCF very much too.JS-0367
[edit.cpp] 会好的。
//maybe the last time to be here
//I want a good end
//God bless you!
//the last show of sxzoi2023
//but it is also mine :(JS-0386
[traverse.cpp] 精神胜利法
for(int i=1;i<=666;i++){
cout<<"I AK NOIP!!!"<<'\n';//I AK NOIP!!!
}JS-0394
[query.cpp] 莫队
//mo dui!!!JS-0398
[edit.cpp] 自信
// Believe in yourself. Never say die;JS-0402
[assign.cpp] 什么玩意
/*zhetmdiyitifsssefseeeeeeeeeeeefffffffffffffffffffffffffffffffffffffffffffffffffshenmewanyi,fuckkkkkkkkkkk,tmasaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaassdsdsdsdsdsdsd66666666zuihoudianzenmebuduil???????????????????????/
*/
/*woleile*/[traverse.cpp/query.cpp] 所
（以上为代码全文。）
JS-0407
[traverse.cpp] traverse？
freopen("query.in","r",stdin);
freopen("query.out","w",stdout);（省流：全文同 query.cpp）
JS-0410
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 为了 Sally
//for SallyJS-0421
[assign.cpp/traverse.cpp/query.cpp] 失去的 rp++
/*for (int i=1;i<=114514;i++){
cout<<"NOIP2024 RP++"<<endl;
}*/JS-0423
[traverse.cpp/query.cpp]
JS-0425
[assign.cpp]
int a[1000000005];JS-0426
[edit.cpp] edit 是这样的
//paid 2.5h and found it was false,so only got A and B
//T_T AFOJS-0430
[traverse.cpp] 再见了。
//good bye, NOIP. good bye,My dream.[query.cpp] 一去不回还 风起水起难靠岸
//I won't be back again.JS-0431
[traverse.cpp] 茶之宇宙
int main()
{
freopen("traverse.in","r",stdin);
freopen("teaverse.out","w",stdout);
cout<<3<<endl;
return 0;
}JS-0432
[assign.cpp] La Disparition
（以上为代码全文。）
JS-0434
[assign.cpp] 谨以此诗
/*
* out-worn heart, in a time out-worn
* come clear of the nets of wrong and right
* laugh, heart, again in the grey twilight
* sigh, heart, again in the dew of the morn
*
* jin yi ci shi ji nian wo 6 nian de xin jing shi guang
* goodbye, and thanks for all
*/JS-0437
[assign.cpp] 你复制了谁的题面？？
/*
• 选取 {1, 2} 作为遍历起始边,并把 {1, 2} 打上标记;
• {1, 2} 与 {2, 3} 相邻且未标记,将 {2, 3} 设为当前访问边,并把 {2, 3} 打上标记。
• {2, 3} 与 {2, 4} 相邻且未标记,将 {2, 4} 设为当前访问边,并把 {2, 4} 打上标记。
• {2, 4} 所有相邻的边都被标记,将当前访问边设为遍历 {2, 4} 之前的边 {2, 3}。
• {2, 3} 所有相邻的边都被标记,将当前访问边设为遍历 {2, 3} 之前的边 {1, 2}。
• {1, 2} 所有相邻的边都被标记,且 {1, 2} 是遍历起始边,故遍历结束。
*/JS-0441
[edit.cpp/assign.cpp/query.cpp] 拼写大师
//defintion[assign.cpp] 让我再看这定格的默片一遍 就一遍
cout << "At least I've been here for once.";[traverse.cpp] A Void
（以上为代码全文）
JS-0448
[assign.cpp]
int x[1000000000+10];JS-0449
[assign.cpp] 痛失 10 分
freopen("assign2.in","r",stdin);
freopen("assign.out","w",stdout);JS-0456
[query.cpp] 不想查询只想修改
#include <bits/stdc++.h>
using namespace std;
int T;
/*
0 1 1 1 0 1
* * * ! * !
1 1 1 0 1 0
* ! * * ! *
111010
101101
*/
bool all01(string s)
{
char c=s[0];
for(int i=1;i<s.size();i++)
{
if(s[i]!=c)
return false;
}
return true;
}
void f()
{
freopen("edit.in","r",stdin);
freopen("edit.out","w",stdout);
int n;cin>>n;
string s1,s2,t1,t2;
cin>>s1>>s2>>t1>>t2;
if(all01(s1)==true)
{
int cnt=0;
for(int i=0;i<n;i++)
{
if(s1[i]==s2[i])
cnt++;
}
cout<<cnt<<endl;
}
}
int main()
{
cin>>T;
for(int i=0;i<T;i++)
f();
return 0;
}（以上为代码全文。）
JS-0460
[assign.cpp] 中文大师
//you tot ge queding
//you n-tot weiqueding
//geshu=v^(n-tot)
//geshu*(v^n-(n-1)(v-1))JS-0468
[query.cpp] 复杂度计算仙人
// O(n*n*q + n*n*logn)JS-0469
[traverse.cpp/query.cpp] 消失
（以上为代码全文。）
JS-0471
[traverse.cpp/query.cpp] 你好，世界！
cout << "Hello world!" << endl;JS-0475
[edit.cpp] 痛失
freopen("edit2.in","r",stdin);
// freopen("edit.out","w",stdout);JS-0500
[query.cpp] 不存在
（以上为代码全文。）
JS-0505
[assign.cpp] 星星好看捏
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("assign.in","r",stdin);
freopen("assign.out","w",stdout);
/*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*/
return 0;
}（以上为代码全文。）
[traverse.cpp] 你是否有很多问号
#include<iostream>
using namespace std;
int main(){
/*
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
???????????????????????????????????????????????????????????????????
*/
}（以上为代码全文。）
JS-0507
[query.cpp] 未完成的篇章
for(int i=1;i<)JS-0509
[assign.cpp] 空
（以上为代码全文。）
JS-0520
[traverse.cpp]
10000102011040410609108161102511236114491166411881121001232112544127691299613225134561368913924141611440014641148841512915376156251587616129163841664116900171611742417689179561822518496187691904419321196001988120164204492073621025213162160921904222012250022801231042340923716240252433624649249642528125600259212624426569268962722527556278892822428561289002924129584299293027630625309763132931684320413240032761331243348933856342253459634969353443572136100364813686437249376363802538416388093920439601400004040140804412094161642025424364284943264436814410044521449444536945796462254665647089475244796148400488414928449729501765062551076515295198452441529005336153824542895475655225556965616956644571215760058081585645904959536600256051661009615046200162500630016350464009645166502565536660496656467081676006812168644691696969670225707567128971824723617290073441739847452975076756257617676729772847784178400789617952480089806568122581796823698294483521841008468185264858498643687025876168820988804894019000090601912049180992416930259363694249948649548196100967219734497969985969922599856100489101124101761102400103041103684104329104976105625106276106929107584108241108900109561110224110889111556112225112896113569114244114921115600116281116964117649118336119025119716120409121104121801122500123201123904124609125316126025126736127449128164128881129600130321131044131769132496133225133956134689135424136161136900137641138384139129139876140625141376142129142884143641144400145161145924146689147456148225148996149769150544151321152100152881153664154449155236156025156816157609158404159201160000（以上为代码全文。）
JS-0526
[traverse.cpp] 两句批话
//cao,wei shen me hai you ren zai pai a ,fan si le,shan guang deng ba wo yan jing kuai yao shan xia le,fan zheng wo ye bu hui zuo, bu ru xie liang ju pi hua[traverse.cpp] 你被骗了
void giveup(){
cout<<"Never gonna give you up."<<endl;
cout<<"Never gonna let you down."<<endl;
cout<<"Never gonna run around and desert you."<<endl;
cout<<"Never gonna make you cry."<<endl;
cout<<"Never gonna say goodbye."<<endl;
cout<<"Never gonna tell a lie and hurt you."<<endl;
}[traverse.cpp] nonsense
//Nothing able to write.Write some nosense so it won't seem so empty.
//Nothing able to write.Write some nosense so it won't seem so empty.
//Nothing able to write.Write some nosense so it won't seem so empty.
//Nothing able to write.Write some nosense so it won't seem so empty.JS-0530
[assign.cpp] 慢速幂
int fastpower(int bot,int power){
if(power==1) return bot;
if(power%2==0) return (fastpower(bot,power/2)%p)*(fastpower(bot,power/2)%p);
else return (fastpower(bot,power/2)%p)*(fastpower(bot,power/2+1)%p);
}JS-0531
[assign.cpp] 看不懂，我该怎么办？
/** Heppc bsmppe uep lsrc **/
/** Heppc jesppe uep lsrc **/
/** Heppc lsrcuzc bsfskeuue jesppe rci **/JS-0538
[edit.cpp] 原神启动动动动动
//Genshen impart start!!!!!!
//Genshen impart start!!!!!!
//Genshen impart start!!!!!!
//Genshen impart start!!!!!!
//Genshen impart start!!!!!!JS-0539
[traverse.cpp] travese
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const int mod=1e9+7;
int main(){
freopen("travese.in","r",stdin);
freopen("travese.out","w",stdout);
return 0;
}（以上为代码全文。）
JS-0550
[traverse.cpp] 你在 traverse 什么
freopen("edit2.in","r",stdin);
//freopen("edit.out","w",stdout);JS-0556
（这位选手有一些发到洛谷上也许被禁专栏的内容，欢迎自行前往阅读。）
JS-0561
[edit.cpp] 大抵如此
//ying gai hui you 50 fen ba
//9:20 xie wan de[assign.cpp] 估计仙人
//11:10 gu ji 30JS-0566
[query.cpp] 郭沫若
// 我的我要爆了JS-0584
[edit.cpp] 未完成的乐章
//unfinished[assign.cpp] 我去，月计
/*
Frozen stairs carpet in blood red
Seating goodbyes left unsaid
Goodbyes left unsaid
Despite our promises here I am
Following your steps
Following your steps
Drop by drop
As your unchanging reality
Dampen my sleeve
You kissed them off
Through the fibers of my hankerchief
I Am Fire
Burn those who dare to care for me
And my fure are memories
Fure are memories
And they perish with the heat
Perish with the heat
So I move on
Flower Of Iron
Shivered up to hide the imposters in me
So why did you leave
Why did you leave
Don't let the words out of me
Impostors about to speak
So I chewed on HuaMeiTang
For whom the shelves are hold onto the pages
Hold onto the pages
Their pain,their joy were given
Value as they were rated
Isn't it ironic
Greed is unlimited
Freedom is a limited resource
Extra large for you means less for me
There's less for me
I banged the drums
Court on hell
Demanding a now trail
You got the wrong head
Would you take mine instead
Take mine instead
Stop Leading Me On
The world of Titan
Allows me to leave
Only in the mud down its feet
Though you are not with me
You are not with me
And they admit defeat
Cause when they thought that every nice thing about me has become CanXiang
You showed me there is still a place of umbrellas inside me
Without you it could never be
So sincerely thank you for everything
It pains me to think
That my happiness turned out to be every one
Who had struggled me under my feet
Don't go another way
I just want to choose my fate
I'm on last White NaiTang
I Am Iron
In my blood that steams roots deep
With brushes on my knees
Brushies on my knees
Ans ribs crushed down into pieces
Crushed down into pieces
Nothing left to hold on
Actually wait
I still have one regret
Before you leave me that eve
You are my everything
Before the words out of me
l bit my rib said nothing
And just suck on HuaMeiTang
*/JS-0590
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] OIer 的七宗罪
/*
1. multitest: clear everything, mind the "\n"
2. beizeng shangjie
3. long long/ binary search upperbound
4. calculate the memory!!!
5. 0/1 corner case
6. non-void function return value
7. test all the samples before the end
*/JS-0591
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 文明中国人
/*
长江 黄河 还有黑龙江
男人 女人 还有变性人
拉屎不洗手 根本不是人
随地吐痰 吐中爸爸有可能
塞车 插队 他妈的过分
电梯抽烟 小心性无能
下雨收衣服 上下爽一爽
不要逃税 我们共建新香港
*/JS-0592
[edit.cpp/assign.cpp/traverse.cpp] **你所要检查的
/*
Things to check:
1. file
2. memory/time limit
3. int/long long overflow
4. problem of double
5. array size
6. return value of functions
7. clearing of multiple testcases
*/JS-0594
[query.cpp] 还真是板子题
// ban zi ti, ji de yuan ti dan shi wang ji zen me 1log le, tai tang le :( hong wenJS-0595
[assign.cpp] 为啥游记写这题上啊
/*
08:13 why traverse3.in was lost
08:19 why jubao -> tousu
08:26 cannot extract
09:02 pass t2 test
09:17 pass t1 test
10:30 pass t3 test
12:09 pass t4 test 1~3 test 4 ~5s
*/JS-0596
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 简明扼要
/*
files mods
*/JS-0597
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 我超，______ / 作者本人
/*
妄想着我们还好
想着我还很好
妄想故事不曾有过悲伤走向
--- 绝世丑角
*/JS-0598
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 这么会猜
/*
1. duipai if big sample is weak
2. do not use "link","y1","tm" as global var
3. leave 1h for bf. think of all subtasks.
4. overflow? RE?
5. shadow?
6. multi-TC clear fully?
7. tricky or adhoc? skip adhoc
order guess: edit assign query traverse
*/JS-0599
[assign.cpp] 正體字大師
int solve(int ed) {
if (ed == 1) return 1;
if (~mem[ed]) return mem[ed];
int tot = fpow(v, 2 * (a[ed].x - a[1].x)); // 總方案數
// 到 ed 為止且合法的方案數
// 枚舉第一個不合法段的開始位置
// 所有的不合法方案均在第一個不合法處統計
for (int i = 1; i < ed; i++)
for (int j = i + 1; j <= i + 1; j++) {
// iter++;
// 前面必須合法
int a1 = solve(i);
// [i, j] 不合法
int len = a[j].x - a[i].x; // 這一段的長度
// [i, j-1] 一定要合法，之後不合法
int a2 = fpow(v, len - (j - i)) * (v - 1) % p; // 這一段不合法的方案數
int a3 = fpow(v, 2 * (a[ed].x - a[j].x)); // 後面隨便
tot -= a1 * a2 % p * a3 % p;
tot = (tot % p + p) % p;
}
// cerr << "answer for ed = " << ed << " is " << tot << endl;
return mem[ed] = tot;
}JS-0600
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 默写歌词大神啊
//you're half a world away
//yet in my mind I whisper every single word you sayJS-0602
[edit.cpp] NOIP T1 是这样的
//9:49 AC #1
//9:53 AC #2[assign.cpp] 哦哦哦啊啊啊
//10:25 AC #1
//10:25 AC #2
//10:25 AC #3[traverse.cpp] StackOverflow
//12:40 get 76pts
//stack died on this computer qwq[query.cpp] 可爱
// 12:54 get 8pts
//QAQ
//wish data more water! (and I can get 4pts more)
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//QAQ rp++
//I have 284 (maybe)JS-0606
[edit.cpp] 献给她
/*
Best Wish 4 Her.
Nothing 4 Me.
*/[assign.cpp] 我超，Testify
Let me forget every thing
And leave no trace of you
What an I carrying out of this horizon
And dispair
If it does not you
I can hurt anyone
In the name of justice
Your shadow
Gets in the way of
My light
And TestifyJS-0614
[edit.cpp] 真的正确吗？？？
/*
We use greedy and place the things from the beginning to the end.
Wtf I passed the big data with greedy. Is it REALLY CORRECT???
*/[assign.cpp] 真的 NOIP T2？？？
/*
start reading at 09:15
difficult to calculate it directly. count the number of illegal ones? 09:20
just SOOO easy? is it really NOIP T2??? Try it! 09:23
Fail on big data 2, so sad! 09:40
Stupid mistake. Passed all. 09:43
*/[traverse.cpp] 噫！好！我会了！
/*
It's difficult too! sad. 09:58
Let's try to draw and see what we can get.
That is, you find iterating edges on a tree has a very similar process to iterating the vertexs.
planning to go to the restroom on 10:15
let's first consider about one edge, then two, to see the pattern of the spawnning tree,
and how two trees are the same.
ok back from the restroom
IT'S ALREADY 1H AFTER FINISHING T2! YOU HAVE TO BE QUICK! already half of the full time!
should i really do the right solution, or just part of it and work on T4??? what should i do? 10:37
well I will work on T4 on 11:00. don't worry about it.
I get O(n^2), and it's 32pts 10:50
oh no I cannot focus on it! what am I thinking???
I'll push the time of thinking T4 to 11:15, caues I think I got something in T3 10:59
omg actually it's O(nk), which is 68pts, if we have A and B it's 84 pts
Read T4. have no touzhu. 11:04
I'll leave T4 1h, as it's force is easy. I cannot AK anyway. 11:15
so i still have 45 mins
OK! using tree-dp, I think I got the point! 11:24
oh god I maybe cannot finish the code... 11:50
My head is going to explode!!!!!!!!!!!!!!!!!!!! 12:10
OMG! I passed all big data! thank god! 12:28
*/JS-0616
[assign.cpp] 无意之链
/*
minus useless chain
*/JS-0626
[traverse.cpp] 幸运之人
//Do you know who is the luckiest people in the world? Let me tell you!
//Just do it!
//Possible everything!
const int mod=1e9+7;
void inline solve(){
cout << rand()%mod << endl;
}JS-0629
[assign.cpp] 乱码高手
// Real random stuff below:
// bbzdwvrwirbcyupvsyhxbwllpgyqihqjiqognhevzfxzcouumdtqagbpnbhvkxhtnvbafgyelvfnmzceraizoriaetndocsxyrhkyfdqhmswztfueedzubawgiumusrjeqtexzvelpcmihioomnimnenerotbritettohuadwnywottetnsotwhneffeocotmrfanqevyzhutyexqzdoaysnpx
// Some spaces: [traverse.cpp] 古典密码高手
// Eenlih,AOFo 041.12.22mr F tgLart
// Etmtdsoe10102+2206=38+0+0:rc eais
// T tre t se mprrainSP ianheway rto nS-C mgo yfoziehda oyr
//JS-0631
[edit.cpp] 这也太难了
// 09:07 100+0+0+0=100
// T1 shi fou guo yu nan le[assign.cpp] 如此分解
/*
_ 2 2 2 _ _ 2 _ _ 2
4 3 3 60 60
64-4
v*v
60=2*2*3*5
*/
// 10:50 100+100+0+0=200[query.cpp] 一小时后
// 11:40 100+100+0+32=232[traverse.cpp] 终末一击
// 100+100+16+32=248JS-0639
[edit.cpp/assign.cpp] 如你所愿
//freopen("woyaoshangmihuoxingwei","w",stdout);
//freopen("wish the writer rp++"."w",stdout);[edit.cpp/assign.cpp] 字符画高手
/*
N N OO IIIII PPPPPP 222 00 222 44
NN N O O I P P 2 2 0 0 2 2 4 4
N N N O O I P P 2 0 0 2 4 4
N N N O O I PPPPPP 2222 0 0 2222 4 4 RP++;
N N N O O I P 2 0 0 2 444444444
N NN OO IIIII P 222222 00 222222 4
*/JS-0644
[edit.cpp] /*20*/
//60+/*20*/ == 80-20 pts[assign.cpp] 你在干啥啊？
//\
ELF>+@@8@@@@ <<``` pxxx888 XXXDDStd888 PtdrrrQtdRtd/lib64/ld-linux-x86-64.so.2GNUGNUqKUqK^nafs<GNU.$)V`I .3:&(M#MB#emPvKF-,crbA9*c*?K-s1 yTAQ)9 F4kKzM b 8/n(B X}" `!U_!?bo@r/libc.so.6fflush__printf_chksetlocalembrtowcstrncmpstrrchrdcgettexterror__stack_chk_failiswprintreallocabort_exitprogram_invocation_name__ctype_get_mb_cur_maxcallocstrlenmemset__errno_locationmemcmp__fprintf_chkstdoutlseekmemcpyfclosemallocmbsinitnl_langinfo__ctype_b_locgetenv__freadingstderrfilenofwrite__fpendingprogram_invocation_short_name__cxa_finalizebindtextdomainstrcmp__libc_start_mainfseeko__overflowfputs_unlockedfree__progname__progname_full__cxa_atexitquote_quoting_optionsVersion_IO_stdin_usedquoting_style_valsquoting_style_argsexit_failureprogram_nameversion_etc_copyrightGLIBC_2.3GLIBC_2.3.4GLIBC_2.14GLIBC_2.4GLIBC_2.2.5_ITM_deregisterTMCloneTable__gmon_start___ITM_registerTMCloneTableiitiiiui,, g(g0g8g@hHhPhXg`kbh#hkg`px*23/79 (08@HPX` h!p"x#$%&'()+,-HHHtH5J~%K~hhhhhhhhqhahQhAh1h!hhhhhhhhhhhqhahQhAh1h!hhhh h!h"h#h$h%h&h'qh(a%}D%{D%{D%{D%{D%{D%}{D%u{D%m{D%e{D%]{D%U{D%M{D%E{D%={D%5{D%-{D%%{D%{D%{D%{D%{D%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%zD%}zD%uzD%mzD%ezD|wrmhAWAVIAUATUSH=<HHzI~H5<[bI>[H5uIH5c<H=;<WH=/<+H=t?6InH5=<HH5-<HIA11HMA8-u0EHMPEt"ID@E)wHHHACH9MdM.*@DIH=yHW(H;W0<HJHO(AEIUA<\uAMQMEHHcH>I>IH5HOH5:H=:H=:H=4D[ACIH5xI>aL9UH=xHG(H;G0 HPHW( IH=xDHG(H9G0HPMHW(\AU0FwIAJDMI>H5GXH5:H=9H=9H=3H=wHG(H;G0 HPHW(H1[]A\A]A^A_AuF<IME11MALD$E}L$YL$LD$H0ADFAAMADNAIDDMAMAnMA[MAHMA5MA"AIAEDEEtIAeAnuE1EuIAq@hDIA\fDAEIUIM9tH=(vHG(H;G0HPHW( QfMI>H5DH57H=7H=7~H=1SD[IE~ DMhDAUMEIDMA\MA mwRHtH5Y6L7jH=uL7H6F)Y^\LD$L$L$LD$M'D[I1D1I^HHPTLV0H/H=sH=itHbtH9tHsHtH=9tH52tH)HH?HHHtHusHtfD=tu+UH=RsHtH=fsds]wG<%wH&3HcH>[email protected]%AsdH%(HD$x1t.H541H=rLH1f?H541H54LLH1L%r1H55kLHL%qr1H5;5FLHL%Lr1H55!LHL%'r1H55LHL%r1H55LHlL%q1H55LHGL%q1H56LH"H561oH2H1H2H\$0H2H$H2HD$H2HD$H2HD$H2HD$`HD$hHD$ H2H\$@H2HD$(HD$8HD$HH\$PH"2HD$XHf.HxHHtHuL`H5C21MH6H72H11HHtH521H56"Hk1HL6H1L-t1NI9H>LE1H56LLH1H5Hv1H11HHtH5Z1uCH561eH0H5H1L%0L-0EL%~01H55Hd0H1UH==o@@=%o@ATSHH=n'tP=nHt8 uH=n'uGH[A\1H55H=nIHt(3M1HHk51=m3HHQ511fDSH/HuHtKL@LH)H~;[email protected]'Ax-u HXHmHnHm[DLHmHm[Hm7H=4 f.UHSH0'UuMPTu^PFuRx-uLx8uFxu@}`H4Hs4HEH[]fDGuPBux1ux8t#H94HC4HEH[]x0ux3ux0uxu}`H4H4HEH[]AWIAVIAUATUSDHH$HT$HL$HD$(H$DD$HD$xH$DL$dHD$pdH%(H$13DT$HD$hD$cAH3DL\$HcH>fDAt~1DT$H5:3L\$L\$DT$HHD$xH3H9o1DT$H52L\$L\$DT$HHD$pH2H9E1#H\$pDT$8E1L\$0H_H\$PL\$0HD$ DT$8D$$HD$XD$1EI9AIuHD$<AE}AH|$"D$H,AHD$ HHIu8Hv2DT$HDD$@DL$8HT$0DT$HDD$@DL$8HT$0IL9HT$ Ht$PHDT$HL\$@DD$8DL$0DL$0DD$8L\$@DT$Hk|$cm@~%H2@HcH>DDDEA1Ht$(HtuEA|$cD t1M9vC''IT$I9vCD'$IT$I9vCD''IAM9vC'\IHM9sC,'|$IED@|$)E11E1T$81|$c+EFHD!PE1H|$hYDT$HL\$@DD$8DL$0DL$0DD$8I@L\$@DT$HIUBf%@A"T$ALD$E1$HD$XD$cD$H/E1AHD$ HD$PIMA"E1D$$HD$XHQ/D$cAD$HD$ HD$PZD$M!HD$XE1D$$H/D$cAAHD$ HD$PlH.E1E1D$$AHD$XD$cD$HD$ HD$P&D$E1E1$HD$XD$cD$HD$ HD$PD$E1E1$HD$XD$cD$HD$ HD$PD$E1$HD$XD$cD$CD$fE1IIuHD$xA*H!|$cA|$DEHELt$xLL$jD$HT$8A_H IH$dH3%(-HL[]A\A]A^A_E1AAu)D$dt"HCL9sH|$|?f1E1?IE1AtD$1'(E1DL$cL$tH|$ y\\|$E11|
//made by cat /usr/bin/echo|tr -d '\0-\37\177-\377' | head -c 3000[traverse.cpp] 原来是诈骗犯
/*//freopen("freopem.in",w,"stdin");never gonna give you up
//freipen("terverse.out",r,"stdout"); asign asin sin in n
traverse1.in edit2.out query3.ans assign.cpp*/ /*//freopen("freopem.in",w,"stdin");never gonna give you up
//freipen("terverse.out",r,"stdout"); asign asin sin in n
traverse1.in edit2.out query3.ans assign.cpp*/ /*//freopen("freopem.in",w,"stdin");never gonna give you up
//freipen("terverse.out",r,"stdout"); asign asin sin in n
traverse1.in edit2.out query3.ans assign.cpp*/ /*//freopen("freopem.in",w,"stdin");never gonna give you up
//freipen("terverse.out",r,"stdout"); asign asin sin in n
traverse1.in edit2.out query3.ans assign.cpp*/ /*//freopen("freopem.in",w,"stdin");never gonna give you up
//*??*??*///*?/8?*??*/8/?8/?*?/?*?8??*??8/?*?/*/*[query.cpp] 真是抽象
//60+100+28+52 == 230 pts,shen me chou xiang wan yi,2>1,4>3?
// (what an abstract thing ccf does!)
//* 4 cha dian mei jia wen cao
// (t4 I'm lucky not to miss//freopen)JS-0646
[edit.cpp/assign.cpp] 循此苦旅，以达繁星
//please give me full 100pts qwq
//AD ASTRA PER ASPERA
//NOIP2024 RP++JS-0650
[query.cpp] 可爱捏
puts("QwQ");JS-0653
[query.cpp] 寄了
//?+?+?+?=? ji le
// on 10/30 12:35JS-0655
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] Jorisy 老师晚上好
// Code by Jorisy. GL & HF.[query.cpp] 对不起。
// Sorry, not full brute force in T3 & T4.JS-0657
[assign.cpp] 我去，B<A
// WTF B<AJS-0659
[edit.cpp] 成功！
//09:56 successfully pass the "edit2.in"[assign.cpp] 前车之鉴
unordered_map<int, int> mp;//I'm afraid to use unordered_map.
/*One of my classmates used unordered_map but not map in a large test
, and he got TLE.(Actually if he used map, he would not TLE)
His name's Shi Ruiheng.
10:25 I try to use g++ to compile and success, so I think CCF will
suppose unordered_map
*/[assign.cpp] 真是惊喜
//10:52 get the right thought
//11:20 find out the thought was fake.
//then find another right thought
//12:17 wasn't able to accept
//The end.
//12:32 While I didn't know what happened, my code accepted assign2.in
//What a surprise!
//12:39 assign3.in accepted[traverse.cpp] 真没有中文吗 111
/*
How could I meet a computer without Chinese twice?
First, take part in CSP2024-S and complete the test in
Suzhou University
Second, take part in NOIP2024 and complete the test in
Nanjing Foreign Language School
What a pity!
I'd like to play some jokes.
Will a "confused actions in NOIP2024 Jiangsu Province"
be made after the test?
11.30 08:12 NOIP rp++
08:17
I find out that the voice of the "Tips before NOIP"
is so nervous that it stop for several times.
08:19
I want to say that the space of the sit is so small!
I even can't sit right straight in front of the computer.
There's a Peppa Pig drawn on the desk.
08:23
I'm pleased that I had finished and tested the FHQTreap on time.
I don't need to be nervous because I'm only 14 years old.
08:28
The Password of the zip was wrong!
08:50
time += 2min
12:23
I'll fight with T2 until the bell ring.
12:34
alive in death, T2 accepted
12:50
I find that query.cpp is 659b and I'm JS-0659
12:57
em......I read T3 and T4 carefully and seriously, but I am still
not able to do them.
*/[query.cpp] 来年再见
/*
12:32 T2 accepted
I'm not heartbroken now!
Actually I don't want to try T3 or T4 any more
so I'll eat chocolate in the rest of the time.
I love chocolate.
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("query.in", "r", stdin);
freopen("query.out", "w", stdout);
printf("See you next year, NOIP");
return 0;
}JS-0660
[edit.cpp] 诈骗专家
//freopen
// freopen
//freopen("edit.ans","w",stdout);
//froepen
// Never Gonna Give You Up~JS-0662
[traverse.cpp/query.cpp] 也要回归空白
（以上为代码全文。）
JS-0663
[edit.cpp/assign.cpp/traverse.cpp] 对 CCF 的爱
//Luogu UID: 688191
//I LOVE CCF!!![traverse.cpp] 不会暴力可爱捏
//qwq
//bu hui bao liJS-0674
[assign.cpp] 还是化竞大佬
//Mr JYY and DZD, I'am going to participate in ChO, this is my last NOIp, plz dont let my T1 greedy boom zero. -KuroVIXEN known as TE.
//Add me into the meme code list. -For the leakersJS-0678
[traverse.cpp] 最后一次
//last time for noip
//people around me is eating fried dumplings and fried onion
//i smell it
//200pts for all
//i went to restroom 4 times
//too nervousJS-0679
[assign.cpp] カスミ
int kasumi(int x, int y)
{
int re = 1;
while (y)
{
if (y & 1)
re = re * x % p;
x = x * x % p;
y /= 2;
}
return re;
}JS-0685
[edit.cpp] 772909 你好呀
//luogu uid 772909 JS-0695
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] Leozhang_2012 你好呀
//luogu
//Username:Leozhang_2012
//Uid:902029JS-0696
[query.cpp] 终结之时
// est. 100 100 40 8
// 123455
// 456713
// 4Fe(OH)2 + O2 + 2H2O ===== 4Fe(OH)3
// ^
// 2Al + 2NaOH + 6H2O ===== 2Na[Al(OH)4] + 3H2|
// Al2O3 + 2NaOH + 3H2O ===== 2Na[Al(OH)4]
// ^
// /_\ ^
// S + 2H2SO4 ===== 3SO2| + 2H2O
/*
* Today my OI career comes to an end.
*
* In the past six years, I have both enjoyed and suffered a lot on my road of coding.
*
* But now the greatest enemies have come: the lack of time and interest.
*
* As time has to go ahead, old things have to gradually fade away.
*
* I would like to thank all those people who supported me along the way, including my three teachers, my parents, my brother, my classmate HCZ and all the people from CCF.
*
* Goodbye.
*
* LilacInSky, at D405-47, NFLS, 30 Nov 2024 12:55:40
*/JS-0702
[edit.cpp] 暴力 ed
//
//__Cloud__
//Without "Chinese input solution" , I almost can't do anything
//I like Netease_Cloud_Music too
//But I can't recommend music to you now
//OK! That's just right
//------------A line---------------
//Baolied T1 at 11:25
//Preparing to read T3
//[assign.cpp] 小故事
//
//I'm __Cloud__ . Luogu 781707 (Maybe it's wrong)
//I don't have a "Chinese input solution"
//What a pity!
//But I also want to "make a big living"
//And I hope I can be on the Luogu website
//...
//So let's start...
//It's my first time to take part in NOIP
//And I even solve T2 before T1
//Oh,I'm hacked by a haking data.QWQ
//Luckily,that data is small
//AC at 10:25
//It seems that I do well
//------------A line---------------
//I like AI and Chat_GPT
//Once I asked Chat_GPT a question
//1,1,4,5,1,(?)
//And it can't answer it
//That's really fun
//[traverse.cpp] 所以我放弃了此题
//
//Here's __Cloud__ again!!!
//T_T
//Baoling T3 is also just right
//Why it's "many tests" again?
//I'm becoming red tempreture(did I spell it correctly)
//------------A line---------------
//Let's talk about something about chicken!
//...
//------------A line---------------
//I would like to recommend a rapper I found in the Netease_Cloud_Music
//He is "ZhouZhouMG"
//He graduated in 2024 at "QingDaoKeJiDaXue"
//He only have fewer than 1000 fans in Bilibili
//He is a ...
//OK , just go to listen to his music
//He won't let you be disappointed (Actully maybe Yes)
//------------A line---------------
//12:23,I give up this question
//AFO
//JS-0706
[query.cpp] 光荣提名
//Daniel_lele will AK NOIP&NOI&IOIJS-0707
[assign.cpp] 字符画大神
/*
KINICH
# # ### # # ### #### # #
# ## # ## # # # # #
## # # # # # # #####
# ## # # ## # # # #
# # ### # # ### #### # #
*/JS-0712
[edit.cpp] 二重宣传
/*
//freopen rand() mian luogu rp++
haishi wo,shuangchong xuanchuan ge.
t1 2.5~3h mei tiaochulai,chadian jide wo yuandi baozha
jiu zheyang ba.
*/JS-0715
[assign.cpp] 即刻取模
//Just mod it.[traverse.cpp] 别样大战
/*
bie yang de zha pian da sai.
*/[query.cpp] Lucas 大神
/*
now is 8:09.
by the size and datas,
I think traverse is T4.
RP++
freeopen("qury.txt","w",stdin);
freeopen("queery.ans","r",wfilterr);
never gonna give you up
now is 8:13.
why wzy and dyf and qys are sit on the floor?
now is 8:23.
RP++
now is 8:35.
all right.traverse is T3.
now is 9:15.
100+0+0+0.
now is 9:48.
kill T2?
now is 10:18.
kill T2!
100+100+0+0!
T2 green/blue?
now is 10:47.
kill T3?can I?
now is 11:12.
why T3 must use Lucas?
*/JS-0721
[query.cpp] 見てください
（以上为代码全文。）
JS-0723
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 永不遗忘
"w", stdout);//never forget[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 天波老师晚上好
//SkyWave Loves OIJS-0725
[edit.cpp] 你要上迷惑行为
//freopen("edit.in","r",stdin);
//freopen("edit.out","w",stdin);
//wo yao shang mi huo xing wei
//si ke le 3.5h T1, wo zhen shi tang wan le
//%%% markding@luogu
//%%% AgOH@luogu
//%%% keda@luogu
//%%% lijinghao168@luogu
//%%% yingluosanqian@luog
//zybtxdy
//hnc tql
//young2011 yydsJS-0726
[edit.cpp] 用时 2h，鉴定为黄
/*
Seems like greedy.
2h spent on qiandao problem.
wandanle.
diffculty: yellow.
*/[assign.cpp/traverse.cpp] modint 大神
template <ll MOD>
struct modular {
ll val;
modular() {
val = 0;
}
modular(ll x) {
val = x;
val %= MOD;
if (val < 0) {
val += MOD;
}
//assert(val < MOD);
}
modular operator+(const modular &b) const {
return modular(val + b.val);
}
modular operator-() const {
return modular(-val);
}
modular operator-(const modular &b) const {
return (*this) + (-b);
}
modular operator*(const modular &b) const {
return modular(val * b.val);
}
modular operator+=(const modular &b) {
return *this = *this + b;
}
modular operator*=(const modular &b) {
return (*this) = (*this) * b;
}
bool operator==(const modular &b) const { return val == b.val; }
};
using mll = modular<(ll)1000000007>;[assign.cpp] 用心思考
/*
all - invaild.
the way to cal the number of invaild sol is easy.
just let the fist equals to d_i,the lasts equal to d_{i+1}.
in the middle can be any numbers.
if you connect i to i+1 if the condition is satisified,
its a (group of) link.
it seems scary at first.
but once you think carefully, its easy.
(wait for a sec actually i dont even know if the solution is correct)
diffculty: green
*/[traverse.cpp] 确有问题
/*
c'm on i cant solve it.
wo tai cai le.
I'm weak in counting you know.
keywords:
//freopen
#define int long long
kkksc03
chen_zhe
sudo pacman -Syu
confusing behavier
Seems huan gen dp.
think about juhua tu.
It's not diffcult to find that the final edge graph
is a wan quan tu.
think about when a node can be leaf.
only when it has odd number of edges out.
otherwise it can't be leaf(except the last one)
so, for wan quan tu that have odd number of nodes,
the final tree must be a link.
The number of that is n!.
Otherwise, there will be 2 leaf at the end of a link.
(n-2)!*C(2,n)/2.
ok.
i can get the part point of the link only.
there must be some problem with my thoughts.
*/[query.cpp] 只得放弃
/*
it seems theres many part points.
cuz im lazy, i will go to think about t2.
try to solve the part point of link.
actually its just range max query.
use st table.
wait. it's not that easy to get that.
...............
it's actually query the maxinum value of
the mininum value of a range.
use binary search.
I guess T3 is blue and T4 is purple or black.
i'm back to check out t1 and t2.
fast lca in 30 min.
look
*/JS-0730
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] LuoFeng_Nanami 老师晚上好
//LuoFeng_Nanami ver.[edit.cpp] 真的有中文啊 111
//是我沙比。多侧不晴空。
//bocchi the rock!
//矩阵群姐姐其实说的是假的。只要在 Settings/Regions & Language 里加上中文(Intelligent Pinyin) 就可以打中文了！
//冬日绘版维护珂珂，请联系 QQ 1502956746 or Luogu 759710，5r per token!
//我们立足于合约计划，但并不支持拜月[assign.cpp] 再次提名
//orz zxx
//他现在应该三题了
//10:05 有一点思路，上个厕所想想
//10:51 done. 200pts now.[query.cpp] 别说批话了
//100 + 100 + 28 + 20. 12:43
//初三了还达不到 300.退役了JS-0733
[edit.cpp] 再次「祝福」
//wu wu wu wu wu wo shi fei wu, wo lian di yi ti dou bu hui aaaaaaaaaa......
//10:31
//ma ge bi de duo ce mei qing kong
//hai de wo tiao le 1 xiao shi
//wo shi sha bi
//jing shi hou ren:
//namespace li mian ding yi bian liang shi bu hui qing kong de
//shen zhi dou bu shi sui ji fu zhi, shi zhi jie yong zhi qian de zhi
//11:15
//hai zai zuo T1, hou mian kan le wan quan mei si lu
//bu guo 20 fen de bao li wo hai mei da,kan kan neng bu neng na dao
//na dao jiu shi 60 fen le,zhe yang hao dai ye bu kui yu lai zhe yi ci
//11:48
//xia xie le yi ge bao li,gu ji lian 20 fen dou na bu dao....
//12:12
/*
f**k C*F
f**k N**P
sha bi C*F
wan damn le zhi you 40 fen
hui jia ru he jiao dai a
C*F wo quan ni shu ju chu shui yi dian ting dao mei you
zhe yang wo cai neng you 60 fen
zai ci zhu fu
f**k c*f
f**k c*f
f**k f*f
from __O_w_O__
*/[query.cpp] 初心不改
/*
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
f**k c*f
from __O_w_O__
*/JS-0736
[edit.cpp] 请你默写下半句
#define int long long//Ten-year OI one empty,???????[query.cpp] 会有人看见的。
// Maybe someone will see my words.
// 8:00 finish creating the folders and cpps
// 8:14 feel bored,empty the Trash
// 8:16 listen to the rules,I bet edit is the first problem
// 8:19 try to open noip.pdf,where's the password ?!!
// 8:29 can't extract the pdf,see the example
// 8:30 empty the Trash
// 8:32 open the pdf
// 9:09 I can't solve the first problem!!!
// 10:23 GG
// 10:33 eat chocolate
// 11:24 empty the Trash
// 12:17 delete .in and .out
// 12:18 empty the Trash
//The real heart-cold is always not walawala.
//Prediction:70ptsJS-0747
[edit.cpp/assign.cpp/traverse.cpp/query.cpp] 永远。
// pza & fyy foreverJS-0753
[query.cpp] too hard, can't solve
printf("This problem is too difficult for me to solve.");JS-0756
[edit.cpp] 阅读理解能力有待提升
/*
du cuo ti le
lang fei le 1 h
*/JS-0757
[edit.cpp] 你在 if 什么原神东西
else if(genshin == 1 && impact == 1 && 114514 == 1919810){JS-0762
[query.cpp] 空
（以上为代码全文。）
JS-0765
[edit.cpp/assign.cpp/query.cpp] 大写的气势
//DAMNGEROUS SPYMH IS DAMNGEROUS TAKE AWAY MY TALENT THROW AWAY MY HEALTH YOU CAN CALL ME LOYALTY BUT YOU ARE NO DAMN GOOD FOR MEJS-0766
[edit.cpp/assign.cpp/traverse.cpp] 我可以说什么呢
/*
Man!What can I say?
My luogu account is jljlzzz
----------------------------
NOIP2024
Today I passed away,
I was killed by NOIP.
Out of the huge group of JULAO,
I'm just a JURUO.
The problems are too difficult
for a weak OIER like me.
I can just wait,
wait and wait for the end.
What can I do?
What can I say?
I can't do anything.
I can't say anything.
Cuz' I am a JURUO.
A JURUO can neither do nor say anything.
I can only wait.
Or I'll be JIN-SAI-SAN-NIANed.
Time is lesser.
I need to try now.
If someone can see this,
I will be very thankful.
stO ----- Orz
stO |. .| Orz
stO | ^ | Orz
stO ----- Orz
stO JU--|--LAO Orz
stO | Orz
stO | Orz
stO / \ Orz
*/