点羽染墨

#include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;struct node{ int x,y;};node a[1005];int n;int ma[1

#include #include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;int a,b,s;struct node{ int x,y; bool oper

开始的时候想错了，以为必须是邻接点才能使用卫星信号所以开始错了好几次！后来看了网上的说法才知道不是直接求出s-1大的边就可以了！（其实还是不明白题意）#include #include #include #include #include #include #include #include #include #include #include #define

#include #include #include #include using namespace std;struct node{ int x,y;};int fa[100015];int find(int x){ while(fa[x]!=x){ x = fa[x]; } return x;}int d[100015];node b[100015];i

#include #include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;int n,m,t;int ma[110][110];int main(){ in

#include #include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;int n,m;int x[1005];int y[1005];int fa[1005

#include using namespace std;int n;double x[105],y[105];double d[105];int used[105];double ma[105][105];double mst(){ d[0] = 0.0; double ans = 0.0; for(int i = 0;i < n;i++){ double min =

#include #include #include #include #include using namespace std;int ma[25][25];int d[25];int vis[25];int fun(int x,int y){ queue que; que.push(x); vis[x] = 1; d[x] = 0; while(1){

#include #include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;int v[][2] = {{1,0},{0,1},{-1,0},{0,-1}};int

#include #include #include #include #include #include #include #include #include #include #define INF 100000000using namespace std;int a[1005];int b[1005];int dp[1005][1005];int mai

#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def