JustDo的专栏

#include #include #include using namespace std; int a, b, c, t; int map[50][50][50]; int dir[6][3] = {{-1,0,0},{1,0,0},{0,-1,0},{0,1,0},{0,0,-1},{0,0,1}}; struct location{ int x, y, z; }; bool rig

Hiking Trip Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1267    Accepted Submission(s): 552 Problem Description Hiking in the m

Rescue Time Limit: 2 Seconds      Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save

#include #include #include #include #define maxm 35 using namespace std; int n, m, t; char map[maxm][maxm][maxm]; bool visit[maxm][maxm][maxm]; int dir[6][3] ={0,-1,0,0,1,0,0,0,-1,0,0,1,1,0,0,-1,0,0}

#include #include #include #include using namespace std; int n, m; char map[205][205]; bool visit[205][205]; int dir[4][2] ={-1,0,1,0,0,-1,0,1}; int bx, by; struct point{ int x, y, step; friend boo

#include #include #include #include using namespace std; int bx, by, ex, ey; bool visit[8][8]; int dir[8][2]={-1,-2,-2,-1,-2,1,-1,2,1,2,2,1,2,-1,1,-2}; struct node{ int x, y, step; };