Submission #49836

#TimeUsernameProblemLanguageResultExecution timeMemory
49836aomeWall (CEOI14_wall)C++17
60 / 100
2074 ms51988 KiB
#include <bits/stdc++.h> using namespace std; const int N = 405; const long long INF = 1e18; struct Edge { int x, y, w, d; }; struct State { long long v; int x, y, d; State (long long v, int x, int y, int d) : v(v), x(x), y(y), d(d) {} bool operator < (const State& rhs) const { return d > rhs.d; } }; const int dx[] = {0, 0, -1, 1}; const int dy[] = {-1, 1, 0, 0}; int n, m; bool a[N][N]; bool vis[N][N]; bool mark[4][N][N]; long long dis[N][N]; long long f[4][N][N]; vector<Edge> G[N][N]; void dijkstra() { for (int i = 1; i <= n + 1; ++i) { for (int j = 1; j <= m + 1; ++j) { dis[i][j] = INF; } } priority_queue<State> pq; pq.push(State(dis[1][1] = 0, 1, 1, 0)); while (pq.size()) { long long v = pq.top().v; int x = pq.top().x, y = pq.top().y; pq.pop(); if (v != dis[x][y]) continue; for (auto i : G[x][y]) { if (dis[i.x][i.y] > v + i.w) { dis[i.x][i.y] = v + i.w; pq.push(State(v + i.w, i.x, i.y, 0)); } } } } void rec(int x, int y) { if (x == 1 && y == 1 || vis[x][y]) return; vis[x][y] = 1; for (auto i : G[x][y]) { if (dis[i.x][i.y] + i.w != dis[x][y]) continue; if (i.x == x) { mark[1][x][min(i.y, y)] = mark[0][x][max(i.y, y)] = 1; } else { mark[3][min(i.x, x)][y] = mark[2][max(i.x, x)][y] = 1; } rec(i.x, i.y); return; } } void solve() { for (int i = 1; i <= n + 1; ++i) { for (int j = 1; j <= m + 1; ++j) { for (int k = 0; k < 4; ++k) { f[k][i][j] = INF; } } } priority_queue<State> pq; pq.push(State(f[1][1][2] = G[1][1][1].w, 1, 2, 1)); while (pq.size()) { long long v = pq.top().v; int x = pq.top().x, y = pq.top().y, d = pq.top().d; pq.pop(); if (v != f[d][x][y]) continue; // cout << x << ' ' << y << ' ' << d << ' ' << v << '\n'; if (d == 0) { for (auto i : G[x][y]) { if (i.d == 1) continue; if (i.d == 0 && mark[3][x][y]) continue; if (i.d == 2 && (mark[0][x][y] || mark[3][x][y])) continue; if (f[i.d][i.x][i.y] > v + i.w) { f[i.d][i.x][i.y] = v + i.w; pq.push(State(v + i.w, i.x, i.y, i.d)); } } } if (d == 1) { for (auto i : G[x][y]) { if (i.d == 0) continue; if (i.d == 1 && mark[2][x][y]) continue; if (i.d == 3 && (mark[1][x][y] || mark[2][x][y])) continue; if (f[i.d][i.x][i.y] > v + i.w) { f[i.d][i.x][i.y] = v + i.w; pq.push(State(v + i.w, i.x, i.y, i.d)); } } } if (d == 2) { for (auto i : G[x][y]) { if (i.d == 3) continue; if (i.d == 2 && mark[0][x][y]) continue; if (i.d == 1 && (mark[0][x][y] || mark[2][x][y])) continue; if (f[i.d][i.x][i.y] > v + i.w) { f[i.d][i.x][i.y] = v + i.w; pq.push(State(v + i.w, i.x, i.y, i.d)); } } } if (d == 3) { for (auto i : G[x][y]) { if (i.d == 2) continue; if (i.d == 3 && mark[1][x][y]) continue; if (i.d == 0 && (mark[1][x][y] || mark[3][x][y])) continue; if (f[i.d][i.x][i.y] > v + i.w) { f[i.d][i.x][i.y] = v + i.w; pq.push(State(v + i.w, i.x, i.y, i.d)); } } } } } int main() { ios::sync_with_stdio(false); cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> a[i][j]; if (a[i][j]) { mark[0][i][j + 1] = mark[0][i + 1][j + 1] = 1; mark[1][i][j] = mark[1][i + 1][j] = 1; mark[2][i + 1][j] = mark[2][i + 1][j + 1] = 1; mark[3][i][j] = mark[3][i][j + 1] = 1; } } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m + 1; ++j) { int w; cin >> w; G[i][j].push_back({i + 1, j, w, 3}); G[i + 1][j].push_back({i, j, w, 2}); } } for (int i = 1; i <= n + 1; ++i) { for (int j = 1; j <= m; ++j) { int w; cin >> w; G[i][j].push_back({i, j + 1, w, 1}); G[i][j + 1].push_back({i, j, w, 0}); } } dijkstra(); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i][j]) rec(i, j); } } // for (int i = 1; i <= n + 1; ++i) { // for (int j = 1; j <= m + 1; ++j) { // for (int k = 1; k < 4; k += 2) { // if (mark[k][i][j]) { // cout << i << ' ' << j << ' ' << k << '\n'; // } // } // } // } solve(); cout << f[2][1][1]; }

Compilation message (stderr)

wall.cpp: In function 'void rec(int, int)':
wall.cpp:58:13: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  if (x == 1 && y == 1 || vis[x][y]) return;
      ~~~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...