Submission #923995

---

Source Code Expand

import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.function.BiFunction;

public class Main {
  Scanner sc = new Scanner(System.in);

  public static void main(String[] args) {
    new Main().run();
  }

  int[][] ofs = {
      {-1, 0},
      {0, -1},
      {0, 1},
      {1, 0}
  };

  class Node {
    int x, y, value;

    Node(int x, int y, int value) {
      this.x = x;
      this.y = y;
      this.value = value;
    }

    Node(Node n) {
      this(n.x, n.y, n.value);
    }
  }

  int h, w;
  int[][] field;
  long MOD = 1_000_000_007;

  long[][] dp;

  void run() {
    h = ni();
    w = ni();
    field = new int[h + 2][w + 2];
    dp = new long[h + 2][w + 2];
    PriorityQueue<Node> queue = new PriorityQueue<>((a, b) -> b.value - a.value);
    for (int i = 1; i <= h; ++i) {
      for (int j = 1; j <= w; ++j) {
        field[i][j] = ni();
        dp[i][j] = 1;
      }
    }
    for (int i = 1; i <= h; ++i) {
      for (int j = 1; j <= w; ++j) {
        Node node = new Node(j, i, field[i][j]);
        queue.add(node);
      }
    }

    while (queue.size() > 0) {
      Node atom = queue.poll();
      for (int i = 0; i < 4; ++i) {
        int nx = atom.x + ofs[i][0];
        int ny = atom.y + ofs[i][1];
        if (field[ny][nx] == 0) {
          continue;
        }
        if (field[atom.y][atom.x] <= field[ny][nx]) {
          continue;
        }
        dp[ny][nx] += dp[atom.y][atom.x];
        dp[ny][nx] %= MOD;
      }
    }

    long sum = 0;
    for (int i = 1; i <= h; ++i) {
      for (int j = 1; j <= w; ++j) {
        sum += dp[i][j];
        sum %= MOD;
      }
    }
    System.out.println(sum);
  }

  int ni() {
    return Integer.parseInt(sc.next());
  }

  void debug(Object... os) {
    System.err.println(Arrays.deepToString(os));
  }

  class BIT<T> {
    int n;
    ArrayList<T> bit;
    BiFunction<T, T, T> bif;

    BIT(int n, BiFunction<T, T, T> bif, T defaultValue) {
      this.n = n;
      bit = new ArrayList<>(n + 1);
      for (int i = 0; i < n + 1; ++i) {
        bit.add(defaultValue);
      }
      this.bif = bif;
    }

    void update(int i, T v) {
      for (int x = i; x <= n; x += x & -x) {
        bit.set(x, bif.apply(bit.get(x), v));
      }
    }

    T reduce(int i, T defaultValue) {
      T ret = defaultValue;
      for (int x = i; x > 0; x -= x & -x) {
        ret = bif.apply(ret, bit.get(x));
      }
      return ret;
    }
  }

}

Submission Info

Judge Result