传送门

简直就是模板题啊！

#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#define N 101using namespace std;int n, m, cnt;int X1[N], Y1[N], X2[N], Y2[N], head[N], to[N * N], nex[N * N], belong[N], ans[N];bool vis[N];inline int read()inline void add(int x, int y)inline double dis(double a, double b, double c, double d)inline bool dfs(int u)}}return 0;}inline int solve()return ret;}int main()}printf("%d\n", solve() + n);for(i = 1; i <= m; i++) ans[belong[i]] = i;for(i = 1; i <= n; i++)return 0;}