qq_51737737的博客

题意：在一个有权无向联通图上，找出一颗生成子树，使得生成子树所有边的或最小。思路：从高位到低位贪心，如果高位为1的舍去任然可以有生成子树 则可以舍去//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#de

银河英雄传说//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_with_stdio(false);

The Number of Imposters//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb push_back#define pii pair<int,int>#define IOS ios::sync_w

Cube Stacking题意：每次第 x 堆可以放在 第 y 堆上 ，多次询问，x下有多少石头思路：sum[x]表示以x为根连通块大小，ans[x]为x下有多少石头//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include<bits/stdc++.h>#define int long long#define fi first#define se second#define pb pus