POJ 3278 Catch That Cow ——bfs

POJ 3278 Catch That Cow ——bfs

注意vis数组范围

#include #include #include #include #include #include using namespace std;const int maxn = 2 * 1e5 + 10;int s, e, vis[maxn];struct State { int x, step;}state, temp;int bfs() { memset(vis, 0, sizeof(vis)); int ans = 0; queue q; state.x = s, state.step = 0; vis[s] = 1; q.push(state); while(!q.empty()) { temp = q.front(); q.pop(); if (temp.x == e) return temp.step; state.step = temp.step + 1; if (temp.x > 0 && !vis[temp.x - 1]) { vis[temp.x - 1] = 1; state.x = temp.x - 1; q.push(state); } if (temp.x < maxn && !vis[temp.x + 1]) { vis[temp.x + 1] = 1; state.x = temp.x + 1; q.push(state); } if (temp.x * 2 < maxn && !vis[temp.x * 2]) { vis[temp.x * 2] = 1; state.x = temp.x * 2; q.push(state); } }}int main(){ while (scanf("%d %d", &s, &e) == 2) { printf("%d\n", bfs()); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。