A12951 | Xor Spanning Tree
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
In the galaxy far far away is the ancient interplanetary republic of Bubbleland, consisting of $N$ planets. Between them, there are $M$ bidirectional wormholes, each connecting a pair of planets. Bubbleland is a very centralized republic, having a capital planet Whiteplanet, from which any another planet can be reached using these wormholes. It is also guaranteed that no wormhole connects planet to itself and that no two different wormholes connect same pair of planets.
We call a path that begins at one planet, visits other planets and each of them at most once and returns to starting point a tour. Interplanetary Safety Regulations guarantee that each planet belongs to at most one tour and that there are at most $42$ tours.
After many eons of usage, wormholes need to be repaired and each wormhole has the cost $W_{i}$ which needs to be payed for reparation. Unfortunately, the Senate of Bubbleland is short on budget. Therefore, they have decided only to fix as many wormholes as they need in order to have all planets reachable from capital and to pay as little money as they have to for this repair. However the way in which the Senate calculates the cost is different. Cost of the set of reparations is binary xor of costs of each individual reparation, that is if reparations to be made have costs $A_{1},A_{2},...,A_{k}$ , the cost of entire set is $A_{1} \oplus A_{2} \oplus ... \oplus A_{k}$ .
Now the Senate would like to know how much money do they have to pay and also the number of different ways to achieve that cost modulo $1000000007$ .
We call a path that begins at one planet, visits other planets and each of them at most once and returns to starting point a tour. Interplanetary Safety Regulations guarantee that each planet belongs to at most one tour and that there are at most $42$ tours.
After many eons of usage, wormholes need to be repaired and each wormhole has the cost $W_{i}$ which needs to be payed for reparation. Unfortunately, the Senate of Bubbleland is short on budget. Therefore, they have decided only to fix as many wormholes as they need in order to have all planets reachable from capital and to pay as little money as they have to for this repair. However the way in which the Senate calculates the cost is different. Cost of the set of reparations is binary xor of costs of each individual reparation, that is if reparations to be made have costs $A_{1},A_{2},...,A_{k}$ , the cost of entire set is $A_{1} \oplus A_{2} \oplus ... \oplus A_{k}$ .
Now the Senate would like to know how much money do they have to pay and also the number of different ways to achieve that cost modulo $1000000007$ .
输入格式
First line of input contains two numbers $N (1 \leq N \leq 100.000)$ , the number of planets and $M (1 \leq M \leq 100.041)$ , the number of wormholes. Following $M$ lines contain three numbers $U, V (1 \leq U \neq V \leq N)$ and $W (1 \leq W \leq 100.000)$ , meaning that there exists a wormhole connecting planets $U$ and $V$ , with repair cost of $W$ .
输出格式
Output two numbers, the smallest possible cost of entire reparation and the number of different valid reparations with that cost modulo $1000000007$ .
输入输出样例
输入 #1
6 6 4 1 5 5 2 1 6 3 2 1 2 6 1 3 3 2 3 4
输出 #1
1 1
We can repair wormholes $1$ , $2$ , $3$ , $5$ and $6$ , paying $5 \oplus 1\oplus 2 \oplus 3 \oplus 4=1$ , one can check that this is the cheapest repair in which all of the planets are connected and the only valid repair with that cost.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted