Qianyri的博客

POJ2386 Lake Counting/*BFS 0MS 592K */#include <stdio.h>#include <utility>//pair<>#include <queue>#define x first#define y secondusing namespace std;int M,N;const i...

HDU6386 Age of Moyu BFS+优先队列#include<stdio.h>#include<string.h>#include<queue>using namespace std;const int MAX=1e5+5;const int INF=0x3f3f3f3f;struct E{ int to,nxt,c;...

codeforce1064 D. Labyrinth给定矩阵，*表示障碍，向左最多L步向右最多R步，求其所有可能能到达的点的个数双端队列 决策优先性#include<bits/stdc++.h>using namespace std;const int MAX=2e3+5;int n,m,a,b,c,d,ans;char s[MAX][MAX];struct P...