DTL66的博客

D - How Many TablesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner tim

E - More is betterTime Limit:1000MS Memory Limit:102400KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Mr Wang wants some boys to help him with a project. Because the project is ra

所产生的

WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1694 Accepted Submission(s): 1012Problem DescriptionIt’s an interesting experience to mo

1.非路径压缩： 递归版：__int64 findroot(__int64 x){ if(x!=fa[x]) return findroot(fa[x]); return fa[x];}非递归版：__int64 findroot(__int64 x)//查找x的根节点{ __int64 r=x; while(r!=fa[r]) r=fa[r]; r

畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 46626 Accepted Submission(s): 24814Problem Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条

Problem H: 蛤玮的机房Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 421  Solved: 163SubmitStatusWeb BoardDescription蛤玮成为了实验室主任,现在学校要求他建好一个机房里的通信网络.这个网络中有n台主机，现在已知建设好了m条线路，可以让一些主机直接或间接通信，为了使

PortalTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1459    Accepted Submission(s): 745Problem DescriptionZLGG found a mag