Submission #2245265


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int dy[] = {-1, 0, 0, 1};
int dx[] = {0, -1, 1, 0};

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int H, W;
  cin >> H >> W;

  pii S, G;
  cin >> S.first >> S.second;
  cin >> G.first >> G.second;
  S.first--, S.second--;
  G.first--, G.second--;

  int P[110][110];
  int ans = 0;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      cin >> P[i][j];
      ans += P[i][j];
    }
  }

  bool used[110][110] = {};
  priority_queue<pii> que;
  que.emplace(0, S.first * W + S.second);
  while (!que.empty()) {
    pii p = que.top(); que.pop();
    int y = p.second / W, x = p.second % W;
    if (used[y][x]) continue;
    ans += p.first;
    used[y][x] = true;
    for (int i = 0; i < 4; i++) {
      int ny = y + dy[i], nx = x + dx[i];
      if (ny >= 0 && ny < H && nx >= 0 && nx < W && !used[ny][nx]) {
        que.emplace(P[y][x] * P[ny][nx], ny * W + nx);
      }
    }
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task D - Game on a Grid
User legosuke
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1141 Byte
Status WA
Exec Time 5 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 30
WA × 2
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 4 ms 512 KB
subtask1_08.txt AC 5 ms 512 KB
subtask1_09.txt AC 4 ms 512 KB
subtask1_10.txt AC 4 ms 384 KB
subtask1_11.txt AC 4 ms 512 KB
subtask1_12.txt AC 4 ms 384 KB
subtask1_13.txt AC 5 ms 512 KB
subtask1_14.txt AC 4 ms 512 KB
subtask1_15.txt AC 5 ms 512 KB
subtask1_16.txt AC 3 ms 384 KB
subtask1_17.txt AC 1 ms 384 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt AC 1 ms 384 KB
subtask1_20.txt AC 3 ms 384 KB
subtask1_21.txt AC 5 ms 512 KB
subtask1_22.txt AC 5 ms 512 KB
subtask1_23.txt AC 5 ms 512 KB
subtask1_24.txt AC 1 ms 256 KB
subtask1_25.txt AC 1 ms 256 KB
subtask1_26.txt AC 1 ms 256 KB
subtask1_27.txt AC 1 ms 256 KB
subtask1_28.txt WA 1 ms 256 KB
subtask1_29.txt AC 1 ms 256 KB