Le Petit Prince

1123: [POI2008]BLO Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 1301  Solved: 591 [Submit][Status][Discuss] Description Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 所有t

#include #include #include #include using namespace std; #define clear(a) memset(a,0,sizeof(a)) #define maxn 1010 bool mark[maxn],vis[maxn]; int point,all,indexx,cnt,num,n,m,x,y,ans; int h[maxn],col[m

Road Construction Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 12499   Accepted: 6284 Description It's almost summer time, and that means that it's al

#include<stdio.h> //强连通分量 void tarjan(int u) { low[u] = dfn[u] = ++ idx; s.push(u); for (int i = h[u]; i; i = e[i].nxt) { int v = e[i].v; if(!dfn[v]) tarjan(v), low[u]

2427: [HAOI2010]软件安装 Time Limit: 10 Sec  Memory Limit: 128 MB Submit: 1913  Solved: 757 [Submit][Status][Discuss] Description 现在我们的手头有N个软件，对于一个软件i，它要占用Wi的磁盘空间，它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机