摘要:
D. The Child and Sequencetime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAt the children's day, ... 阅读全文
摘要:
Mad scientist Mike has constructed a rooted tree, which consists ofn vertices. Each vertex is a reservoir which can be either empty or filled with wat... 阅读全文
摘要:
#include #include#include#include#includeusing namespace std; int g[505][505]; int dx[505],dy[505];bool vx[505], vy[505];int dis[505]; int n, x, y;... 阅读全文
摘要:
#include #include#include#includeconst int maxn = 301;const int INF = (1 t) slack[y] = t; } return false; }int KM() ... 阅读全文
摘要:
#include#includeusing namespace std;bool map[505][505];int n, k;bool vis[505];int linker[505];void sscanf(){ int x, y; scanf("%d%d",&n,&k); for(int i=... 阅读全文
摘要:
#include #include using namespace std; #define DIGIT 4 //四位隔开,即万进制 #define DEPTH 10000 //万进制 #define MAX 2251... 阅读全文
摘要:
Beautiful PeopleTime Limit:10000/5000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others) Special JudgeSubmitStatusProblem Description The most... 阅读全文