@[IceMeteor](/user/93465) 貌似是吧（
by Aleph1022 @ 2020-08-16 11:58:30
好，正在造hack数据
by CrTsIr400 @ 2020-08-16 11:59:44
```cpp
#include<bits/stdc++.h>
#define F(i,a,b,c) for(register int i=(a);(b);i=(c))
#define Fu(i,a,b) F(i,(a),i<=(b),i+1)
#define Fd(i,a,b) F(i,(a),i>=(b),i-1)
const int inf=1073741823;typedef long long LL;int Fl,ch;template<typename t>int in(t&a){a=0;ch=getchar();Fl=1;while(((ch<'0')||(ch>'9'))&&ch!=EOF)Fl=(ch=='-')?-Fl:Fl,ch=getchar();if(ch==EOF)return 0;while((ch>='0')&&(ch<='9'))a=a*10+ch-'0',ch=getchar();a*=Fl;return 1;}template<typename t,typename ...ARGS>int in(t&a,ARGS&...args){return in(a)+in(args...);}
using namespace std;
int cen=10,l[1048577],r[1048577],cnt=1;
void maketree(int p,int dep)
{
if(dep==cen)return;
l[p]=++cnt;
maketree(cnt,dep+1);
r[p]=++cnt;
maketree(cnt,dep+1);
}
int main()
{
memset(l,-1,sizeof(l));
memset(r,-1,sizeof(r));
freopen("hack.txt","w",stdout);
printf("1047553\n");
Fu(i,1,1024)
{
maketree(cnt,1);
r[cnt]=cnt+1,++cnt;
}
Fu(i,1,cnt)printf("%d %d\n",l[i],r[i]);
return 0;
}
//BY 线段树蒟蒻
```
hack专用代码
by CrTsIr400 @ 2020-08-16 12:09:59
洛谷IDE被我卡住了QAQ
by CrTsIr400 @ 2020-08-16 12:14:29
https://www.luogu.com.cn/problem/U107483
测试hack
by CrTsIr400 @ 2020-08-16 12:22:06
淦
全部都hack不掉
by CrTsIr400 @ 2020-08-16 12:26:00
建议改名：@SegmentTreeGod （雾
by Aw顿顿 @ 2020-08-16 12:42:50
反正我过了/cy
by critnos @ 2020-08-16 15:06:49
当年写的 $\mathcal O(n)$ 哈希，我感觉我会被卡（
by 囧仙 @ 2020-08-16 17:25:08
@[SegmentTreeJuruo](/user/121995)
应该卡不掉的。
by OptimisticForever @ 2020-08-18 08:36:58