zhousilijames的专栏

#include #include #include #include using namespace std; int n,m,cow[305][305],mo[305]; const int MAX=100000; int main() { cin>>n>>m; for(int i=0;i<=n;i++) { fill(cow[i],cow[i]+n

#include #include #include #include using namespace std; int T,n,m,w,edge; const int MAX=6000; struct edges { int to,from,cost; }eg[MAX]; int dis[MAX]; bool isnegative() { memset(dis,0,sizeof

#include #include #include #include #include using namespace std; const int MAX=1005; const int INF=10000000; int n,m,x,dis[MAX],dis0[MAX]; typedef pair P; struct edge {     int to,cost;

#include #include #include #include #include using namespace std; const int INF =100000000; const int C=250; int k,c,m,id,dis[C][C]; bool used[C]; struct edge { int to,cap,rev; }; vector g[C]; v

#include #include #include #include #include using namespace std; const int INF=100000000; int n,m,d[1500][20]; struct edge { int to,p,r,c; }; struct state { int cost,s,v; state(int cost,

#include #include #include #include #include #include using namespace std; const int INF=1100000000; const int mx=100000+1000; struct edge { int to,cost; }e; vector g[mx]; int n,m,s,t,d[mx]; bool

#include #include #include #include #include #include #include using namespace std; typedef pair P; const int INF =10000000; int n,m,d[2100],mp[2100][2100],num,nmp[2100][2100]; struct edge { in