Napoleon2004的博客

#include<queue>#include<cstdio>#include<cstring>using namespace std;const int inf=0x3f3f3f3f,MAX=205;int n,m,c[MAX][MAX],dep[MAX];int bfs(int s, int t){ queue<int>q;...

#include<bits/stdc++.h>using namespace std;int r,c,a[30],b[30],pre[50],h[50][50];bool vis[50];int bfs(int s,int t){ int i,p; memset(vis,0,sizeof(vis)); queue<int>q;q.push(s); pre[s...

#include<bits/stdc++.h>using namespace std;const int M=210;bool visit[M];int m,n,pre[M],r[M][M];int bfs(int s,int t){ int i,p; queue<int>q; pre[s]=s; visit[s]=1; q.push(s); mems...

#include<bits/stdc++.h>using namespace std;const int M=510,Inf=0x3f3f3f3f;map<string,int>mp;bool visit[M];int l,pre[M],r[M][M];string q[M],p[M];int bfs(int s,int t){ int i,p; mems...

#include<queue>#include<cstdio>#include<vector>#include<cstring>using namespace std;const int M=110,inf=0x3f3f3f3f;struct node{ int x,y,l;};vector<node>g;int n,...