P7763 题解

P7763 题解

巨佬写得太好了，本蒟蒻瑟瑟发抖

题意

给定一张无向图，问能否通过这个操作，让图变成完全图。

• 选定一个节点，翻转与其相邻的所有的边的状态。

题解

注意到一条边仅有两个节点产生贡献。对于每一个边 $(u,v)$，不难得到：

• 如果此边存在，那么 $u$ 的操作次数加上 $v$ 的操作次数为偶，即它们的奇偶性一样。
• 否则，$u$ 的操作次数加上 $v$ 的操作次数为奇，即它们的奇偶性不同。

可以看出，这题变成了一道食物链。可以用扩展域的做法通过此题。

Code

#include <bits/stdc++.h>

#define int long long
// FOR templates.
#define rep(i, s, n, k) for(int i = s;i <= n;i += k)
#define repn(i, s, n, k) for(int i = s;i < n;i += k)
#define pre(i, s, n, k) for(int i = s;i >= n;i -= k)
#define pren(i, s, n, k) for(int i = s;i > n;i -= k)
// Abbr for STL.
#define pii pair<int, int>
#define pdd pair<double, double>
#define mpi map<int, int>
#define pii pair<int, int>
#define pdd pair<double, double>
#define vc vector<int>
#define mpp map<int, int>
#define arr(k, n) int k[n]
#define all(v) v.begin(), v.end()
// CIN templates, proven very useful.
#define cn(n) int n;cin >> n
#define cm(n) cin >> n
// Abbr for funcs.
#define pb push_back
#define mset memset
// #define files
using namespace std;
const int MAXN = 0x3f3f3f3fLL;
const int MOD1 = 1000000007LL;
const int MOD2 = 998244353LL;
int d[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int gcd(int a, int b) {if(b == 0) return a;return gcd(b, a % b);}
inline int lowbit(int x) {return x & (-x);}
inline int lcm(int a, int b) {return a * b / gcd(a, b);}

int fa[10001]; vector<pii> ge;
map<pii, int> mp;
void add_edge(int u, int v){
	ge.pb(make_pair(u, v));
	mp[make_pair(u, v)]++;
}
int FindFather(int n){
	if(fa[n] == n) return n;
	return fa[n] = FindFather(fa[n]);
}
void Union(int u, int v){
	fa[FindFather(u)] = FindFather(v);
}


signed main(){
#ifdef files
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cn(n); cn(m);
    rep(i, 1, m, 1){
    	cn(u); cn(v); add_edge(u, v);
	}
	rep(i, 1, 2 * n + 1, 1) fa[i] = i;
	rep(i, 1, n, 1){
		rep(j, i + 1, n, 1){
			if(!mp[make_pair(i, j)]){
				if(FindFather(i) == FindFather(j)){
					cout << "NE" << endl;
					return 0;
				}
				Union(i, n + j); Union(n + i, j);
			}
			else{
				if(FindFather(i) == FindFather(n + j) || \
				   FindFather(n + i) == FindFather(j)){
					cout << "NE" << endl;
					return 0;
				}
				Union(i, j);
			}
		}
	}
	cout << "DA" << endl;
    return 0;
}

/*
 *  things to check
 *  1.  int overflow or long long memory need
 *  2.  recursion/array/binary search/dp/loop bounds
 *  3.  precision
 *  4.  special cases(n=1,bounds)
 *  5.  delete debug statements
 *  6.  initialize(especially multi-tests)
 *  7.  = or == , n or m ,++ or -- , i or j , > or >= , < or <=
 *  8.  keep it simple and stupid
 *  9.  do not delete, use // instead
 *  10. operator priority
 *  11. is there anything extra to output?
 *  12. THINK TWICE CODE ONCE, THINK ONCE DEBUG FOREVER
 *  13. submit ONCE, AC once. submit twice, WA forever
 *  14. calm down and you'll get good rank
 *  15. even a bit wrong scores zero
 *  16. ...
 **/