bzoj4153 [Ipsc2015]Familiar Couples
Description
Input
Output
#include<cstdio>#include<vector>
const int P=1e9+,N=1e6+;
inline int read(){
int x=,c=getchar();
while(c>''||c<'')c=getchar();
while(c>=''&&c<='')x=x*+c-'',c=getchar();
return x;
}
inline void exch(int&a,int&b){int c=a;a=b;b=c;}namespace Map{
const int mx=;
unsigned int nw=;
unsigned int xs[mx],ys[mx],zs[mx],ds[mx];
inline void clear(){
nw++;
}
inline int get(unsigned int x,unsigned int y,int inc){
unsigned int w=(x*+y*+)%mx;
while(ds[w]==nw){
if(xs[w]==x&&ys[w]==y){
int v=zs[w];
zs[w]+=inc;
return v;
}
w+=;
if(w>=mx)w-=mx;
}
ds[w]=nw;
xs[w]=x;ys[w]=y;zs[w]=inc;
return ;
}
}
int T,n,m,now=,Ans,ans;
int h1[N],h2[N],f1[N],f2[N],sz1[N],sz2[N],nx1[N],nx2[N];
int t[N],d[N];
std::vector<int>v1[N],v2[N];
int main(){
T=read();
while(T--){
n=read();m=read();
Ans=ans=;
Map::clear();
for(int i=;i<=n;i++){
Map::get(i,i,);
f1[i]=f2[i]=i;
v1[i].clear();v2[i].clear();
v1[i].push_back(i);
v2[i].push_back(i);
}
for(int i=,op,a,b;i<=m;++i){
op=read();a=read();b=read();
++now;
if(op==){
if(f1[a]!=f1[b]){
if(v1[f1[a]].size()>v1[f1[b]].size())exch(a,b);
std::vector<int>&vc=v1[f1[a]];
for(int x=;x<vc.size();x++){
int p=vc[x];
int f=f2[p];
if(d[f]!=now)d[f]=now,ans=(ans+Map::get(f1[p],f,-)*1ll*Map::get(f1[b],f,)%P)%P;
else Map::get(f1[p],f,-),Map::get(f1[b],f,);
f1[p]=f1[b];
v1[f1[b]].push_back(p);
}
vc.clear();
}
}else{
if(f2[a]!=f2[b]){
if(v2[f2[a]].size()>v2[f2[b]].size())exch(a,b);
std::vector<int>&vc=v2[f2[a]];
for(int x=;x<vc.size();x++){
int p=vc[x];
int f=f1[p];
if(d[f]!=now)d[f]=now,ans=(ans+Map::get(f,f2[p],-)*1ll*Map::get(f,f2[b],)%P)%P;
else Map::get(f,f2[p],-),Map::get(f,f2[b],);
f2[p]=f2[b];
v2[f2[b]].push_back(p);
}
vc.clear();
}
}
Ans=(Ans+ans*1ll*i%P)%P;
}
printf("%d\n",Ans);
}
return ;
}
bzoj4153 [Ipsc2015]Familiar Couples的更多相关文章
- bzoj AC倒序
Search GO 说明:输入题号直接进入相应题目,如需搜索含数字的题目,请在关键词前加单引号 Problem ID Title Source AC Submit Y 1000 A+B Problem ...
- Sicily 1021. Couples
题目地址:1021. Couples 思路: 想清楚了这道题其实很简单.利用夫妻出现的位置作为下标,并设为同一值,第一对夫妻值为1,第二对为2,以此类推,存储完毕即可进入下一步. 利用栈这个数据结构: ...
- Julia is a high-level, high-performance dynamic programming language for technical computing, with syntax that is familiar to users of other technical
http://julialang.org/ julia | source | downloads | docs | blog | community | teaching | publications ...
- [LeetCode] Couples Holding Hands 两两握手
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum numb ...
- [Swift]LeetCode765. 情侣牵手 | Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum numb ...
- [CC-COUPLES]Couples sit next to each other
[CC-COUPLES]Couples sit next to each other 题目大意: 有\(n(n\le5\times10^5)\)对小伙伴共\(2n\)个人坐成一圈.刚开始编号为\(i\ ...
- 每日英语:Why Rate Your Marriage? A Numerical Score Can Help Couples Talk About Problems
When marriage therapist Sharon Gilchrest O'Neill met with new clients recently, she asked them why t ...
- ZOJ 3161 Damn Couples 动态规划 难度:2
Damn Couples Time Limit: 1 Second Memory Limit: 32768 KB As mentioned in the problem "Coup ...
- LeetCode765. Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum numb ...
随机推荐
- java代码获取客户端的真实ip
java代码获取客户端的真实ip protected String getIpAddr(HttpServletRequest request) { String ip = request.getHea ...
- 2019.1.11 EDVT
Processing Gain and Occupied Bandwidth ESA Basic Setup (11b)Span 110MHzRBW 100kHzVBW 100kHzSweep Tim ...
- Python 字典的遍历
dic = {"赵四":"刘晓光", "刘能":"王晓利", "王木生":"范伟" ...
- MySQL性能优化方法二:表结构优化
原文链接:http://isky000.com/database/mysql-perfornamce-tuning-schema 很多人都将 数据库设计范式 作为数据库表结构设计“圣经”,认为只要按照 ...
- magento的布局文件之谜
magento的布局文件layout.xml文件详解 解析顺序 布局xml文件一般位于app/design/{area}/{package}/{theme}/layout/目录下.Layout文件一般 ...
- UIImageView有关的帧动画
纯代码:设置imageView帧动画 @interface ViewController () { UIImageView *_imgView; NSMutableArray<UIImage * ...
- win10笔记本实现双屏显示的自如切换
前言 使用电脑的过程中想一边看内容,一边进行编辑,这就涉及到双屏显示并实现扩展分屏,本文就介绍一下这些操作. 工具 win10-thinkpad-E470:另一块显示屏(博主的是戴尔的显示器):一条外 ...
- opencv-python教程学习系列8-opencv图像算术运算
前言 opencv-python教程学习系列记录学习python-opencv过程的点滴,本文主要介绍图像的算术运算,坚持学习,共同进步. 系列教程参照OpenCV-Python中文教程: 系统环境 ...
- 转:Linux实时将所有输出重定向到文件
转自: Linux的重定向机制十分好用,我们经常需要在服务器上挂起一个服务程序,然后将该程序的所有输出重定向到某个文件,这样即使我们注销了用户,程序依然在linux服务器上运行着. 但是重定向的输出经 ...
- CF1096. G. Lucky Tickets(快速幂NTT)
All bus tickets in Berland have their numbers. A number consists of n digits (n is even). Only k dec ...