heaventouch

摘要： Air RaidTime Limit:1000MSMemory Limit:10000KTotal Submissions:6184Accepted:3703DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never 阅读全文

摘要： COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:15975Accepted:6293DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies si 阅读全文

摘要： Muddy FieldsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7340Accepted:2715DescriptionRain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 14 #include15 struct node{16 int x;17 int y;18 }edge[55][55];19 char c[55][55];20 int g[1500][1500];21 int vis[1500];... 阅读全文