oj.uz

Submission #1024724

# Submission time Handle Problem Language Result Execution time Memory
1024724 2024-07-16T09:43:29 Z joelgun14 Portals (BOI14_portals) C++17
100 / 100
 765 ms 68248 KB 
// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int r, c;
  cin >> r >> c;
  char a[r + 2][c + 2];
  for(int i = 0; i <= r + 1; ++i)
    for(int j = 0; j <= c + 1; ++j)
      a[i][j] = '#';
  for(int i = 1; i <= r; ++i) {
    for(int j = 1; j <= c; ++j) {
      cin >> a[i][j];
    }
  }
  // for each grid cell, find closest 
  pair<int, int> s, t;
  for(int i = 1; i <= r; ++i) {
    for(int j = 1; j <= c; ++j) {
      if(a[i][j] == 'S')
        s = mp(i, j), a[i][j] = '.';
      else if(a[i][j] == 'C')
        t = mp(i, j), a[i][j] = '.';
    }
  }
  pair<int, int> cw[4][r + 2][c + 2];
  for(int i = 0; i < 4; ++i)
    for(int j = 0; j <= r + 1; ++j)
      for(int k = 0; k <= c + 1; ++k)
        cw[i][j][k] = mp(-1, -1);
  int w[r + 2][c + 2];
  queue<pair<int, pair<int, int>>> bfs;
  vector<pair<int, int>> nxt = {mp(0, 1), mp(1, 0), mp(-1, 0), mp(0, -1)};
  for(int i = 1; i <= r; ++i) {
    for(int j = 1; j <= c; ++j) {
      if(a[i][j] == '.') {
        bool h = 0;
        for(auto p : nxt) 
          h |= a[i + p.fi][j + p.se] == '#';
        if(h)
          bfs.push(mp(0, mp(i, j)));
      }
    }
  }
  memset(w, -1, sizeof(w));
  while(bfs.size()) {
    int d = bfs.front().fi, x = bfs.front().se.fi, y = bfs.front().se.se;
    bfs.pop();
    if(w[x][y] != -1)
      continue;
    w[x][y] = d;
    for(auto p : nxt) {
      if(a[x + p.fi][y + p.se] == '.' && w[x + p.fi][y + p.se] == -1)
        bfs.push(mp(d + 1, mp(x + p.fi, y + p.se)));
    }
  }
  for(int i = 0; i < 4; ++i) {
    for(int j = nxt[i].fi > 0 ? r : 1; (j <= r && nxt[i].fi <= 0) || (j >= 1 && nxt[i].fi > 0); j += nxt[i].fi > 0 ? -1 : 1)
      for(int k = nxt[i].se > 0 ? c : 1; (k <= c && nxt[i].se <= 0) || (k >= 1 && nxt[i].se > 0); k += nxt[i].se > 0 ? -1 : 1)  
        if(a[j][k] == '.') {
          if(a[j + nxt[i].fi][k + nxt[i].se] == '#')
            cw[i][j][k] = mp(j, k);
          else
            cw[i][j][k] = cw[i][j + nxt[i].fi][k + nxt[i].se];
        }
  }
  priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> pq;
  pq.push(mp(0, s));
  int dist[r + 2][c + 2];
  memset(dist, -1, sizeof(dist));
  while(pq.size()) {
    int d = pq.top().fi, x = pq.top().se.fi, y = pq.top().se.se;
    pq.pop();
    if(dist[x][y] != -1)
      continue;
    dist[x][y] = d;
    for(auto p : nxt) {
      if(a[x + p.fi][y + p.se] == '.' && dist[x + p.fi][y + p.se] == -1)
        pq.push(mp(d + 1, mp(x + p.fi, y + p.se)));
    }
    for(int i = 0; i < 4; ++i) {
      // cout << x << " " << y << " " << cw[i][x][y].fi << " " << cw[i][x][y].se << " " << w[x][y] << endl;
      if(dist[cw[i][x][y].fi][cw[i][x][y].se] == -1)
        pq.push(mp(d + 1 + w[x][y], cw[i][x][y]));
    }
  }
  cout << dist[t.fi][t.se] << endl;
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 2260 KB Output is correct
6 Correct 8 ms 2256 KB Output is correct
7 Correct 10 ms 2392 KB Output is correct
8 Correct 4 ms 2396 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 7 ms 2256 KB Output is correct
15 Correct 8 ms 2396 KB Output is correct
16 Correct 10 ms 2384 KB Output is correct
17 Correct 9 ms 2392 KB Output is correct
18 Correct 17 ms 2396 KB Output is correct
19 Correct 15 ms 2140 KB Output is correct
20 Correct 25 ms 3828 KB Output is correct
21 Correct 7 ms 2396 KB Output is correct
22 Correct 8 ms 2392 KB Output is correct
23 Correct 9 ms 2396 KB Output is correct
24 Correct 10 ms 1992 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 4 ms 2396 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 6 ms 2396 KB Output is correct
15 Correct 9 ms 2396 KB Output is correct
16 Correct 9 ms 2512 KB Output is correct
17 Correct 10 ms 2396 KB Output is correct
18 Correct 14 ms 2604 KB Output is correct
19 Correct 15 ms 2140 KB Output is correct
20 Correct 25 ms 3840 KB Output is correct
21 Correct 7 ms 2392 KB Output is correct
22 Correct 7 ms 2324 KB Output is correct
23 Correct 9 ms 2316 KB Output is correct
24 Correct 296 ms 47884 KB Output is correct
25 Correct 357 ms 42384 KB Output is correct
26 Correct 592 ms 48800 KB Output is correct
27 Correct 765 ms 68248 KB Output is correct
28 Correct 169 ms 48612 KB Output is correct
29 Correct 189 ms 48920 KB Output is correct
30 Correct 233 ms 48956 KB Output is correct
31 Correct 10 ms 2136 KB Output is correct
32 Correct 288 ms 42068 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 216 ms 44840 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 4 ms 2396 KB Output is correct
38 Correct 95 ms 49700 KB Output is correct
39 Correct 107 ms 47712 KB Output is correct