问题 E: Star Wars

内存限制：256 MB 时间限制：1 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：1 通过：1

链接：https://ac.nowcoder.com/acm/contest/57361/E
来源：牛客网
The new round of Star Wars has begun.

In this round of Star Wars, our side has established

n

bases in the universe. At the beginning of the war, all bases had zero troops and there were no wormholes. A wormhole connects two different bases and can be bidirectional.

You need to help the commander-in-chief write a program to answer some questions based on the battlefield situation.

We use

last\text{last}

to represent the answer of the last

4

operation and initialize

last=0\text{last}=0

.
The first line contains two integers

n

(

1≤n≤3×1051\le n\le 3\times10^5

) and

q

(

1≤q≤3×1051\le q\le 3\times10^5

), which represent the number of bases and the number of instructions that the commander-in-chief will give you.
Next

q

lines, each line contains one instruction. There are four types of instructions:
- `1 x y` Our side added a wormhole connecting

x

and

y

.
- `2 x y` The enemy destroyed a wormhole connecting

x

and

y

. It is guaranteed that this wormhole existed before this operation.
- `3 x c` base

x

increased

c

(

0≤c≤1090\le c\le 10^9

) troops.
- `4 x` Find the sum of troops that can be reached from base

x

through at most one wormhole.
You need to transform the input

x, y, c

into

230)x\oplus (\text{last}\ \text{mod}\ 2^{30}),y\oplus (\text{last}\ \text{mod}\ 2^{30}),c\oplus (\text{last}\ \text{mod}\ 2^{30})

to get the real data, where

⊕\oplus

means binary XOR.

For each

4

operation, output a line representing the answer.

110
210
210

2023牛客暑期多校训练营7

问题 E: Star Wars

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签

问题 E: Star Wars

题目描述

输入格式

输出格式

输入样例 复制

输出样例 复制

分类标签

输入样例复制

输出样例复制