菜鸟成长ing

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 20005; const int Mod = 1000000007; int n,m,R,ans; int p[maxn]; struct node { int x,y,w; }

#include "stdio.h" #include "queue" #include "iostream" #include "functional" #include "math.h" #include "algorithm" using namespace std; const int maxn = 1005; const int mod = 1000000007 ; const int

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 1005; const int Mod = 1000000007; const int inf = 1<<30; int n,m,Max; int p[maxn]; bool vi

题目链接

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 1005; const int Mod = 1000000007; int s,n,m,c; double ans; struct Node { int x,y; }point[

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 2005; const int Mod = 1000000007; const int inf = 1<<30; int n; char str[maxn][10]; bool v

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 55; const int Mod = 1000000007; int n,m,ans; struct node { int u,v,w; }edge[maxn*maxn]; i

题目链接

#include "stdio.h" #include "string.h" #include "queue" #include "iostream" #include "functional" #include "math.h" #include "algorithm" using namespace std; const int maxn = 105; const int mod = 1000

#include #include #include #include #include using namespace std; typedef long long LL; const int maxn = 1005; const int Mod = 1000000007; int s,n,m,c; double ans; struct Node { int x,y; }point[

#include #include #include #include #include #include #include #include using namespace std; const int maxn = 2005; const int inf = 1<<30; int n; int map[maxn][maxn],dis[maxn]; bool vis[maxn]; string

#include #include #include using namespace std; int n,ans; int p[105]; struct node { int s,e,dis; }road[5000]; bool cmp( node a,node b) { return a.dis<b.dis; } int find(int x) { return x!=p[x]

#include "stdio.h" #include "string.h" const int maxn = 105; const int inf = 1<<30; int n; int map[maxn][maxn],dis[maxn]; bool vis[maxn]; int prime() { int i,j,min,pos,ans = 0; //起点 答案 vis[1

#include #include #include #include #include using namespace std; const int maxn = 105; const double inf = 100000000.0; int n,m; double dis[maxn]; bool vis[maxn]; struct Node { int x,y; }node[maxn];

#include #include #include #include #include #include #include using namespace std; typedef __int64 LL; const int maxn = 50005; const int inf = 2000000001; int n,m,q; int p[maxn],r[maxn]; struc