【HDOJ】2757 Ocean Currents

简单BFS。

  1 /* 2757 */
  2 #include <iostream>
  3 #include <queue>
  4 #include <cstdio>
  5 #include <cstring>
  6 #include <cstdlib>
  7 using namespace std;
  8
  9 #define MAXN 1005
 10
 11 typedef struct node_t {
 12     int k, t;
 13     node_t() {}
 14     node_t(int kk, int tt) {
 15         k = kk; t = tt;
 16     }
 17     friend bool operator <(const node_t &a, const node_t &b) {
 18         return a.t > b.t;
 19     }
 20 } node_t;
 21
 22 int n, m;
 23 int bx, by, ex, ey;
 24 char map[MAXN][MAXN];
 25 int visit[MAXN][MAXN];
 26 int dir[8][2] = {
 27     -1,0, -1,1, 0,1, 1,1,
 28     1,0, 1,-1, 0,-1, -1,-1
 29 };
 30
 31 inline bool check(int x, int y) {
 32     return x<0 || x>=n || y<=0 || y>=m;
 33 }
 34
 35 int bfs() {
 36     int xx, yy;
 37     int x, y, t;
 38     int i, j, k;
 39     node_t nd;
 40     priority_queue<node_t> Q;
 41
 42     memset(visit, 0x3f, sizeof(visit));
 43     visit[bx][by] = 0;
 44     nd.t = 0;
 45     nd.k = bx*1000+by;
 46     Q.push(nd);
 47
 48     while (!Q.empty()) {
 49         nd = Q.top();
 50         xx = nd.k/1000;
 51         yy = nd.k%1000;
 52         if (xx==ex && yy==ey)
 53             return nd.t;
 54         Q.pop();
 55         for (i=0; i<8; ++i) {
 56             x = xx + dir[i][0];
 57             y = yy + dir[i][1];
 58             if (check(x, y))
 59                 continue;
 60             if (map[xx][yy] == i)
 61                 t = nd.t;
 62             else
 63                 t = nd.t + 1;
 64             if (visit[x][y] > t) {
 65                 visit[x][y] = t;
 66                 k = 1000*x+y;
 67                 Q.push(node_t(k, t));
 68             }
 69         }
 70     }
 71
 72     return 0;
 73 }
 74
 75 int main() {
 76     int i, j, k;
 77     int t;
 78
 79     #ifndef ONLINE_JUDGE
 80         freopen("data.in", "r", stdin);
 81         freopen("data.out", "w", stdout);
 82     #endif
 83
 84     while (scanf("%d%d",&n,&m) != EOF) {
 85         for(i=0; i<n; ++i) {
 86             scanf("%s", map[i]);
 87             for (j=0; j<m; ++j)
 88                 map[i][j] -= ‘0‘;
 89         }
 90         scanf("%d", &t);
 91         while (t--) {
 92             scanf("%d%d%d%d",&bx,&by,&ex,&ey);
 93             --bx; --by; --ex; --ey;
 94             if (bx==ex && by==ey)
 95                 k = 0;
 96             else
 97                 k = bfs();
 98             printf("%d\n", k);
 99         }
100     }
101
102     return 0;
103 }
时间: 2024-12-28 12:52:18

【HDOJ】2757 Ocean Currents的相关文章

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]

【HDOJ】3509 Buge&#39;s Fibonacci Number Problem

快速矩阵幂,系数矩阵由多个二项分布组成.第1列是(0,(a+b)^k)第2列是(0,(a+b)^(k-1),0)第3列是(0,(a+b)^(k-2),0,0)以此类推. 1 /* 3509 */ 2 #include <iostream> 3 #include <string> 4 #include <map> 5 #include <queue> 6 #include <set> 7 #include <stack> 8 #incl

【HDOJ】1818 It&#39;s not a Bug, It&#39;s a Feature!

状态压缩+优先级bfs. 1 /* 1818 */ 2 #include <iostream> 3 #include <queue> 4 #include <cstdio> 5 #include <cstring> 6 #include <cstdlib> 7 #include <algorithm> 8 using namespace std; 9 10 #define MAXM 105 11 12 typedef struct {

【HDOJ】2424 Gary&#39;s Calculator

大数乘法加法,直接java A了. 1 import java.util.Scanner; 2 import java.math.BigInteger; 3 4 public class Main { 5 public static void main(String[] args) { 6 Scanner cin = new Scanner(System.in); 7 int n; 8 int i, j, k, tmp; 9 int top; 10 boolean flag; 11 int t

【HDOJ】2425 Hiking Trip

优先级队列+BFS. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <queue> 5 using namespace std; 6 7 #define MAXN 25 8 9 typedef struct node_st { 10 int x, y, t; 11 node_st() {} 12 node_st(int xx, int yy, int tt)

【HDOJ】1686 Oulipo

kmp算法. 1 #include <cstdio> 2 #include <cstring> 3 4 char src[10005], des[1000005]; 5 int next[10005], total; 6 7 void kmp(char des[], char src[]){ 8 int ld = strlen(des); 9 int ls = strlen(src); 10 int i, j; 11 12 total = i = j = 0; 13 while (

【HDOJ】2795 Billboard

线段树.注意h范围(小于等于n). 1 #include <stdio.h> 2 #include <string.h> 3 4 #define MAXN 200005 5 #define lson l, mid, rt<<1 6 #define rson mid+1, r, rt<<1|1 7 #define mymax(x, y) (x>y) ? x:y 8 9 int nums[MAXN<<2]; 10 int h, w; 11 12