Mining Station on the Sea Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2997 Accepted Submission(s): 913 Problem Description The ocean is a treasure house of resources and the development o…
Tour Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2925 Accepted Submission(s): 1407 Problem Description In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000…
Special Fish Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2189 Accepted Submission(s): 826 Problem Description There is a kind of special fish in the East Lake where is closed to campus of…
奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10760 Accepted Submission(s): 4765 Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子.这可是一件大事,关系到人民的住房问题啊.村里共有n间房间,刚好有n家老百姓,考虑…
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3299 Accepted Submission(s): 1674 Problem Description On a grid map there are n little men and n houses. In each unit time, every l…
A new Graph Game Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2360 Accepted Submission(s): 951 Problem Description An undirected graph is a graph in which the nodes are connected by undire…
#include<stdio.h> #include<math.h> #include<string.h> #define N 200 #define inf 999999999 int Max(int a,int b ) { return a>b?a:b; } int Min(int a,int b) { return a>b?b:a; } int map[N][N],lx[N],ly[N],s[N],t[N],link[N],n,m,ot…
Mining Station on the Sea Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2584 Accepted Submission(s): 780 Problem Description The ocean is a treasure house of resources and the development…
