WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 25394 Accepted: 9083DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that
Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12409 Accepted Submission(s): 4541 Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54057 Accepted Submission(s): 14562Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>//#define INPUTusing namespace std;/** Problem : ZOJ1649 - Rescue Begin Time : 7:00 p.m. 17th/Mar/2012 End Time : 22:17 17th/Mar/2012
GarlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1184 Accepted: 515DescriptionThe New Year garland consists of N lamps attached to a common wire that hangs down on the ends to which outermost lamps are affixed. The wire sags under
打模板一定要注意!#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 350;const int INF = 0x7fffffff;int n, w[N][N], lx[N], ly[N], le[N];bool S[N], T[N];void update(){ int a =