oj.uz

Submission #675249

# Submission time Handle Problem Language Result Execution time Memory
675249 2022-12-27T03:32:27 Z vjudge1 Portals (BOI14_portals) C++17
100 / 100
 230 ms 37148 KB 
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e3 + 5;
const ll INF = 1e18 + 5;

int m, n;
string s[MAXN];

void Input()
{
    cin >> m >> n;
    for (int i = 1; i <= m; i++)
    {
        cin >> s[i];
        s[i] = ',' + s[i];
    }
}

pair<int, int> jump[MAXN][MAXN][4];
int d[MAXN][MAXN];

struct TState
{
    int x, y;
    int dlab;

    bool operator < (const TState& other) const
    {
        return dlab > other.dlab;
    }

    bool Valid() const
    {
        return d[x][y] == dlab;
    }
};

bool Chk(pair<int, int> p)
{
    return p.fi > 0 && p.fi <= m && p.se > 0 && p.se <= n;
}

int Ox[4] = {0, -1, 0, 1};
int Oy[4] = {-1, 0, 1, 0};

void Solve()
{
    pair<int, int> S, C;
    for (int i = 1; i <= m; i++)
    {
        jump[i][0][0] = {i, 1};
        jump[i][n + 1][2] = {i, n};
    }
    for (int i = 1; i <= n; i++)
    {
        jump[0][i][1] = {1, i};
        jump[m + 1][i][3] = {m, i};
    }
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (s[i][j] == '#')
            {
                jump[i][j][0] = {i, j + 1};
                jump[i][j][1] = {i + 1, j};
            } else
            {
                if (s[i][j] == 'S')
                    S = {i, j};
                if (s[i][j] == 'C')
                    C = {i, j};
                jump[i][j][0] = jump[i][j - 1][0];
                jump[i][j][1] = jump[i - 1][j][1];
            }
        }
    }
    for (int i = m; i >= 1; i--)
    {
        for (int j = n; j >= 1; j--)
        {
            if (s[i][j] == '#')
            {
                jump[i][j][2] = {i, j - 1};
                jump[i][j][3] = {i - 1, j};
            } else
            {
                jump[i][j][2] = jump[i][j + 1][2];
                jump[i][j][3] = jump[i + 1][j][3];
            }
        }
    }

    priority_queue<TState> PQ;
    memset(d, 0x3f, sizeof(d));
    d[S.fi][S.se] = 0;
    PQ.push({S.fi, S.se, 0});
    while (!PQ.empty())
    {
        auto u = PQ.top();
        PQ.pop();
        if (!u.Valid())
            continue;
        //cout << u.x << ' ' << u.y << ' ' << u.dlab << '\n';
        if (u.x == C.fi && u.y == C.se)
        {
            cout << u.dlab;
            return;
        }
        for (int c = 0; c < 4; c++)
        {
            pair<int, int> v = {u.x + Ox[c], u.y + Oy[c]};
            if (Chk(v) && d[v.fi][v.se] > u.dlab + 1 && s[v.fi][v.se] != '#')
            {
                d[v.fi][v.se] = u.dlab + 1;
                PQ.push({v.fi, v.se, d[v.fi][v.se]});
            }
        }
        for (int i = 0; i < 4; i++)
        {
            for (int j = 0; j < 4; j++)
            {
                if (i == j)
                    continue;
                pair<int, int> v = jump[u.x][u.y][i], z = jump[u.x][u.y][j];
                int w = abs(u.x - z.fi) + abs(u.y - z.se) + 1;
                if (Chk(v) && Chk(z) && d[v.fi][v.se] > u.dlab + w)
                {
                    d[v.fi][v.se] = u.dlab + w;
                    PQ.push({v.fi, v.se, d[v.fi][v.se]});
                }
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(task".INP","r"))
    {
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    Input();
    Solve();
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4360 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 6 ms 6436 KB Output is correct
6 Correct 7 ms 6356 KB Output is correct
7 Correct 6 ms 6444 KB Output is correct
8 Correct 5 ms 6356 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4260 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 3 ms 4564 KB Output is correct
11 Correct 2 ms 4564 KB Output is correct
12 Correct 2 ms 4564 KB Output is correct
13 Correct 2 ms 4564 KB Output is correct
14 Correct 6 ms 6448 KB Output is correct
15 Correct 7 ms 6356 KB Output is correct
16 Correct 6 ms 6356 KB Output is correct
17 Correct 6 ms 6356 KB Output is correct
18 Correct 8 ms 6484 KB Output is correct
19 Correct 4 ms 6356 KB Output is correct
20 Correct 6 ms 6472 KB Output is correct
21 Correct 6 ms 6356 KB Output is correct
22 Correct 6 ms 6356 KB Output is correct
23 Correct 6 ms 6356 KB Output is correct
24 Correct 8 ms 6356 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4564 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 5 ms 6356 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4564 KB Output is correct
10 Correct 2 ms 4564 KB Output is correct
11 Correct 3 ms 4564 KB Output is correct
12 Correct 2 ms 4564 KB Output is correct
13 Correct 2 ms 4564 KB Output is correct
14 Correct 6 ms 6356 KB Output is correct
15 Correct 6 ms 6356 KB Output is correct
16 Correct 7 ms 6356 KB Output is correct
17 Correct 7 ms 6356 KB Output is correct
18 Correct 9 ms 6488 KB Output is correct
19 Correct 3 ms 6356 KB Output is correct
20 Correct 6 ms 6484 KB Output is correct
21 Correct 6 ms 6356 KB Output is correct
22 Correct 6 ms 6356 KB Output is correct
23 Correct 7 ms 6356 KB Output is correct
24 Correct 179 ms 37144 KB Output is correct
25 Correct 230 ms 37132 KB Output is correct
26 Correct 40 ms 36928 KB Output is correct
27 Correct 120 ms 37148 KB Output is correct
28 Correct 107 ms 36816 KB Output is correct
29 Correct 122 ms 36860 KB Output is correct
30 Correct 121 ms 36904 KB Output is correct
31 Correct 12 ms 6356 KB Output is correct
32 Correct 224 ms 37060 KB Output is correct
33 Correct 2 ms 4308 KB Output is correct
34 Correct 2 ms 4564 KB Output is correct
35 Correct 113 ms 36936 KB Output is correct
36 Correct 2 ms 4308 KB Output is correct
37 Correct 5 ms 6356 KB Output is correct
38 Correct 82 ms 36852 KB Output is correct
39 Correct 90 ms 36936 KB Output is correct