Analysis
给定两种操作:
- Select an edge of GGG and delete it from GGG.删一条边
- Select a connected component of GGG which doesn’t have any loop, then delete it from GGG.删一个连通块
那么对于第一种操作, 会使得边数 − 1 -1 −1,对于第二种操作, 会使得点数 − k -k −k, 边数 − ( k − 1 ) -(k-1) −(k−1)。
任何一种操作都会使得点数+边数的和( n + m n + m n+m)减少一个奇数( 1 o r 2 k − 1 1\ or\ 2k-1 1 or 2k−1),因此判断 n + m n + m n+m的奇偶性输出即可。
Analysis
#include
using namespace std;
signed main(){
int n, m, a, b; cin >> n >> m;
if((n + m) % 2 == 0) cout
关注
打赏
- 回坑记之或许是退役赛季?
- [LCT刷题] P1501 [国家集训队]Tree II
- [LCT刷题] P2147 洞穴勘测
- 2022-2023 ICPC Brazil Subregional Programming Contest VP记录
- [线段树套单调栈] 2019-2020 ICPC Asia Hong Kong Regional Contest H.[Hold the Line]
- The 2021 ICPC Asia Nanjing Regional Contest E.Paimon Segment Tree 区间合并线段树/维护矩阵乘法
- CF580E - Kefa and Watch 线段树维护哈希
- HDU5869 Different GCD Subarray Query 离线查询/区间贡献
- 27.CF1004F Sonya and Bitwise OR 区间合并线段树
- 26.CF1000F One Occurrence