Coding A World

Problem Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, th

ExplorationTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1385 Accepted Submission(s): 378Problem Description Miceren likes exploratio

#include"stdio.h" #include"string.h" #include"vector" using namespace std; #define N 11000 const int inf=1<<20; vectorg[N]; int s,t,n; int f[N],pre[N],ans[N]; bool vis[N]; int findset(int x) { if(

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3956    Accepted Submission(s): 1983 Problem Description A school bought t

Frogs' Neighborhood Time Limit: 5000MS   Memory Limit: 10000K Total Submissions: 7295   Accepted: 3150   Special Judge Description 未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名

Sorting It All Out Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 27929   Accepted: 9655 Description An ascending sorted sequence of distinct values is on

Park Visit Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2321    Accepted Submission(s): 1029 Problem Description Claire and her

The Unique MST Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20679   Accepted: 7255 Description Given a connected undirected graph, tell if its minimum s

Transport Goods Time Limit: 2 Seconds      Memory Limit: 65536 KB The HERO country is attacked by other country. The intruder is attacking the capital so other cities must send supports to the

Arbitrage Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15806   Accepted: 6648 Description Arbitrage is the use of discrepancies in currency exchange rat

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 19527   Accepted: 6375 Description In the age of television, not many people attend theat

Reward Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3554    Accepted Submission(s): 1077 Problem Description Dandelion's uncle i

D - Tree and Hamilton Path Time limit : 2sec / Memory limit : 256MB Score : 1100 points Problem Statement There is a tree with N vertices, numbered 1 through N. The i-th edge in th