oj.uz

Submission #656478

# Submission time Handle Problem Language Result Execution time Memory
656478 2022-11-07T15:12:01 Z 600Mihnea Portals (BOI14_portals) C++17
31 / 100
 19 ms 11252 KB 
bool home = 0;
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<int> rev(vector<int> v, int ok) {
  if (ok) {
    reverse(v.begin(), v.end());
  }
  return v;
}

const int N = 1000 + 7;
const int INF = (int) 1e9 + 7;
int n;
int m;
int a[N][N];
int r1;
int c1;
int r2;
int c2;
int dr[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
int dwall[N][N];
int d[N][N];
pair<int, int> cell[N][N][4];

const int D = 2 * N;
vector<pair<int, int>> q[D];

signed main() {
  if (home == 0) {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  } else {
    freopen ("___input___.txt", "r", stdin);
  }

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      dwall[i][j] = d[i][j] = INF;
    }
  }


  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    string s;
    cin >> s;
    assert((int) s.size() == m);
    for (int j = 1; j <= m; j++) {
      char ch = s[j - 1];
      assert(ch == '.' || ch == '#' || ch == 'S' || ch == 'C');
      if (ch != '#') {
        a[i][j] = 1;
      }
      if (ch == 'S') {
        assert(r1 == 0 && c1 == 0);
        r1 = i;
        c1 = j;
      }
      if (ch == 'C') {
        assert(r2 == 0 && c2 == 0);
        r2 = i;
        c2 = j;
      }
    }
  }
  vector<int> _on;
  vector<int> _om;
  for (int i = 1; i <= n; i++) {
    _on.push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    _om.push_back(i);
  }
  {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (a[i][j]) {
          bool is_near_wall = 0;
          for (int k = 0; k < 4; k++) {
            int in = i + dr[k];
            int jn = j + dc[k];
            if (a[in][jn] == 0) {
              is_near_wall = 1;
            }
          }
          if (is_near_wall) {
            dwall[i][j] = 0;
          }
        }
      }
    }
    for (int step = 1; step <= 2; step++) {
      for (int revn = 0; revn <= 1; revn++) {
        for (int revm = 0; revm <= 1; revm++) {
          vector<int> on = rev(_on, revn);
          vector<int> om = rev(_om, revm);
          for (auto &r : on) {
            for (auto &c : om) {
              for (int k = 0; k < 4; k++) {
                int rn = r + dr[k];
                int cn = c + dc[k];
                dwall[r][c] = min(dwall[r][c], 1 + dwall[rn][cn]);
              }
            }
          }
        }
      }
    }
  }

  {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (a[i][j]) {
          for (int k = 0; k < 4; k++) {
            int in = i + dr[k];
            int jn = j + dc[k];
            if (a[in][jn] == 0) {
              cell[i][j][k] = {i, j};
            }
          }
        }
      }
    }
    for (int revn = 0; revn <= 1; revn++) {
      for (int revm = 0; revm <= 1; revm++) {
        vector<int> on = rev(_on, revn);
        vector<int> om = rev(_om, revm);
        for (auto &r : on) {
          for (auto &c : om) {
            for (int k = 0; k < 4; k++) {
              int rn = r + dr[k];
              int cn = c + dc[k];
              if (a[r][c] == 1 && a[rn][cn] == 1) {
                cell[r][c][k] = cell[rn][cn][k];
              }
            }
          }
        }
      }
    }
  }

  int maxd = 0;
  q[0].push_back({r1, c1});
  d[r1][c1] = 0;

  for (int ds = 0; ds <= maxd; ds++) {
    for (auto &cellx : q[ds % D]) {
      int i = cellx.first;
      int j = cellx.second;
      if (d[i][j] % D != ds) {
        continue;
      }
      for (int k = 0; k < 4; k++) {
        int in = i + dr[k];
        int jn = j + dc[k];
        if (a[in][jn] && d[i][j] + 1 < d[in][jn]) {
          d[in][jn] = d[i][j] + 1;
          q[d[in][jn] % D].push_back({in, jn});
          maxd = max(maxd, d[in][jn]);
        }
        in = cell[i][j][k].first;
        jn = cell[i][j][k].second;
        if (d[i][j] + dwall[i][j] + 1 < d[in][jn]) {
          d[in][jn] = d[i][j] + dwall[i][j] + 1;
          q[d[in][jn] % D].push_back({in, jn});
          maxd = max(maxd, d[in][jn]);
        }
      }
    }
    q[ds].clear();
  }
  cout << d[r2][c2] << "\n";

  return 0;
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:37:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen ("___input___.txt", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 5 ms 8328 KB Output is correct
4 Correct 4 ms 8276 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 5 ms 8328 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8320 KB Output is correct
9 Correct 6 ms 8276 KB Output is correct
10 Correct 4 ms 8324 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8324 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 4 ms 8324 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 4 ms 8324 KB Output is correct
7 Correct 5 ms 8320 KB Output is correct
8 Correct 5 ms 8324 KB Output is correct
9 Correct 5 ms 8840 KB Output is correct
10 Correct 5 ms 8788 KB Output is correct
11 Correct 6 ms 8824 KB Output is correct
12 Correct 5 ms 8732 KB Output is correct
13 Correct 5 ms 8712 KB Output is correct
14 Correct 4 ms 8328 KB Output is correct
15 Correct 5 ms 8788 KB Output is correct
16 Correct 5 ms 8276 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Correct 5 ms 8324 KB Output is correct
3 Correct 4 ms 8352 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Incorrect 19 ms 11212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 6 ms 8404 KB Output is correct
4 Correct 5 ms 8276 KB Output is correct
5 Correct 4 ms 8328 KB Output is correct
6 Correct 4 ms 8324 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 6 ms 8840 KB Output is correct
10 Correct 5 ms 8836 KB Output is correct
11 Correct 5 ms 8788 KB Output is correct
12 Correct 5 ms 8704 KB Output is correct
13 Correct 5 ms 8788 KB Output is correct
14 Incorrect 16 ms 11220 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 5 ms 8332 KB Output is correct
4 Correct 4 ms 8276 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 4 ms 8324 KB Output is correct
7 Correct 5 ms 8328 KB Output is correct
8 Correct 4 ms 8320 KB Output is correct
9 Correct 5 ms 8788 KB Output is correct
10 Correct 6 ms 8788 KB Output is correct
11 Correct 6 ms 8916 KB Output is correct
12 Correct 7 ms 8712 KB Output is correct
13 Correct 5 ms 8716 KB Output is correct
14 Incorrect 17 ms 11252 KB Output isn't correct
15 Halted 0 ms 0 KB -