处理完输入就是很简单的一题  但是输入好难 勉强找到一种能看懂的... #include<iostream> #include<stdio.h> #include<string> #include<cstring> using namespace std; #define MAX 999999999 #define N 501 int vis[N],map[N][N],dis[N]; int n,m; int Dijkstra(int start,int e…

Here We Go(relians) Again Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 1   Accepted Submission(s) : 1 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description The Gorelians…

Here We Go(relians) Again Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 235 Accepted Submission(s): 146   Problem Description The Gorelians are a warlike race that travel the universe conquering…

Crash and Go(relians) [题目链接]Crash and Go(relians) [题目类型]模拟 &题解: 这就是要严格的按照题意说的模拟就好了,也就是:每次添加进来一个圆,就找以前的,看有没有可以合成的多个圆,有的话就合成一起,这块要注意,合成之后,你一定要再从头跑一遍,因为合成之后的圆,有可能和之前联系不上的圆联系上了,所以这块就要多跑一个循环 [时间复杂度]\(O(n^2)\) &代码: #include <cstdio> #include <i…

Here We Go(relians) Again Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 685    Accepted Submission(s): 335 Problem Description The Gorelians are a warlike race that travel the universe conquer…

根据矩阵建图,然后求最短路径. #include <cstdio> #include <cstring> #include <cstdlib> #define L 2520 #define MAXN 600 #define INF 0x2f2f2f2f int map[MAXN][MAXN]; int dis[MAXN]; int path[MAXN]; int vn; bool visit[MAXN]; void dijkstra() { int i, j, v, m…

最短路,建图太麻烦,略过…… #include <cstdio> #include <cstring> #include <queue> const int INF=9999999; using namespace std; struct node{ int v,i; node(int a,int b){v=a,i=b;} bool operator <(const node& a)const{return v>a.v;} }; int n,m,ma…

题目链接 Problem Description The Gorelians are a warlike race that travel the universe conquering new worlds as a form of recreation. Given their violent, fun-loving nature, keeping their leaders alive is of serious concern. Part of the Gorelian security…

原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=2722 分析:简单最短路,读入数据烦. #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<vector> #define maxn 450 #defi…

题目链接: PKU:http://poj.org/problem? id=3653 ZJU:problemId=1934" target="_blank">http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1934 HDU:http://acm.hdu.edu.cn/showproblem.php? pid=2722 Description The Gorelians are a warlike rac…