码代码的猿猿

摘要： 容斥原理+状压Card CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1940Accepted Submission(s): 907Special JudgeProblem DescriptionIn your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if yo 阅读全文

摘要： 并查集+左偏树。。。。。合并的时候用左偏树，合并结束后吧父结点全部定成树的根节点，保证任意两个猴子都可以通过Find找到最厉害的猴子 Monkey KingTime Limit:10000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionOnce in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way an... 阅读全文

摘要： 水概率DP。。。。LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1359Accepted Submission(s): 552Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the pl 阅读全文

摘要： Making the GradeTime Limit:1000MSMemory Limit:65536KTotal Submissions:3436Accepted:1608DescriptionA straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an alt... 阅读全文

摘要： 左偏树是一种不平衡的二叉树，特点是：堆+快速的合并 每个结点包含4个元素v,d,r,l。。。。右边的D总是比左边的D小。。。向左偏。。。。合并操作都是向右边的子树递归的，时间复杂度低O（log(n1)+log(n2)）。因为合并比较快。。。所以。。基本操作大都是用合并完成的。。。。。写起来非常简单。。。。 1 #include 2 #include 3 #include 4 5 using namespace std; 6 7 const int maxn=100010; 8 int tot=0; 9 10 struct leftistheapnode11 {12 int v... 阅读全文

摘要： Ubuntu下1：下载xrdp sudo apt-get install xrdp2: urs/share/applications 下找到 远程桌面 设置成这样Windows下1;Win+R mstsc 打开远程连接 输入要链接机器的IP选择VNC-ANY 输入IP 和刚才设置的密码链接成功 阅读全文

摘要： Give Me Your HandTime Limit:2 Seconds Memory Limit:131072 KB Special JudgeBellyWhite and MightyHorse are two students of Marjar University. They are best friends and also roommates living in the same dorm. There areKstudents living in that dorm, including BellyWhite and MightyHorse.BellyWhite posted 阅读全文

摘要： 水概率。。。。SGU里难得的水题。。。。495. Kids and PrizesTime limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardICPC (International Cardboard Producing Company) is in the business of producing cardboard boxes. Recently the company organized a contest for kids for the best desi 阅读全文

摘要： 以前做过的题目了。。。。补集+DP Check the difficulty of problemsTime Limit:2000MSMemory Limit:65536KTotal Submissions:4091Accepted:1811DescriptionOrganizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following.. 阅读全文

摘要： D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the pri 阅读全文