注意到集结操作相当于合并一些点 于是我们可以使用并查集 对于每一行.每一列维护一个链表,储存里面的点 查询x时,在并查集中找到x的祖先u,此时x的坐标就是u的坐标 然后扫描u所在行列的链表,依次删除每个点,并把这些点合并成一个新点,同时计算贡献 对于修改操作,可以看作是分离,新建一个点代表修改后的点,然后对于原来的点减掉贡献即可 #include<cstdio> #include<map> #define N 300010 #define P 1000000007 typedef…

题面以及思路:https://blog.csdn.net/glqac/article/details/38402101 代码: #include <bits/stdc++.h> #define LL long long using namespace std; const LL mod = 1000000007; const int maxn = 2000010; struct node { LL x, y; int cnt; node(){} node(LL x, LL y, int cnt…

ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 790    Accepted Submission(s): 420 Problem Description Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, called…

HDU 4876 ZCC loves cards 题目链接 题意:给定一些卡片,每一个卡片上有数字,如今选k个卡片,绕成一个环,每次能够再这个环上连续选1 - k张卡片,得到他们的异或和的数,给定一个L,问能组成[L,R]全部数字的情况下,R的最大值是多少 思路:暴力C(20, 6),然后对于每一个序列去全排后模拟计算值, 只是之前要有个剪枝.全排前.先把k个数随机取数(即不用连续),然后假设这样还满足不了,那么连续的情况肯定也满足不了.直接结束.不进入全排.这样一来因为满足不了的情况实际上是占…

http://acm.hdu.edu.cn/showproblem.php?pid=4882 ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 97    Accepted Submission(s): 55 Problem Description Though ZCC has many Fans,…

ZCC Loves Codefires 题目链接: http://acm.hust.edu.cn/vjudge/contest/121349#problem/B Description Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, called "Memset137". It was on Codefires(CF), an online competitive programming site, th…

pid=4873" target="_blank" style="">题目链接:hdu 4873 ZCC Loves Intersection 题目大意:给出N,D,表示在一个D维的坐标上.坐标范围为0~N-1.在这个坐标系中有D条线段,分别平行与各个坐标轴,每秒会依据题目中的伪代码随机生成各个线段的位置.两条直线相交的话会得一分,问每秒得分的期望. 解题思路:总的情况(ND−1∗C(2N))D,两条直线相交的得分C(2D)∗s2∗ND−2∗(ND−…

 ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 223    Accepted Submission(s): 123 Problem Description Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, ca…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4882 ---------------------------------------------------------------------------------------------------------------------------------------------------------- 欢迎光临天资小屋:http://user.qzone.qq.com/593830943…

题目链接:hdu 4876 ZCC loves cards 题目大意:给出n,k,l,表示有n张牌,每张牌有值.选取当中k张排列成圈,然后在该圈上进行游戏,每次选取m(1≤m≤k)张连续的牌,取牌上值的亦或和.要求找到一个圈,使得L~R之间的数都能够得到,输出R.假设R < L输出0. 解题思路:暴力,首先预处理出来每种选取的亦或值,然后在该基础上从能够组成L的状态中挑选一个,L+1的状态中挑取一个,知道说总的挑取出全部状态中选中的牌的个数大于K为值,然后用全排序去查找最大的R. #includ…