oj.uz

Submission #465746

# Submission time Handle Problem Language Result Execution time Memory
465746 2021-08-16T17:49:00 Z MohamedFaresNebili Portals (BOI14_portals) C++14
70 / 100
 1000 ms 5404 KB 
#include <bits/stdc++.h>

using namespace std;

void solve()
{
    /// JUST KEEP GOING
    const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0};
    int n, m; cin>>n>>m; char grid[n][m]; int d[n][m];
    int sx, sy; int ex, ey;
    for(int l=0;l<n;l++) {
        for(int i=0;i<m;i++) {
            cin>>grid[l][i]; d[l][i]=1000000000;
            if(grid[l][i]=='S') {
                sx=l; sy=i; d[sx][sy]=0;
            }
            else if(grid[l][i]=='C') {
                ex=l; ey=i;
            }
        }
    }
    priority_queue<pair<int, pair<int, int>>>pq; pq.push({0, {sx, sy}});
    while(!pq.empty()) {
        int a=pq.top().second.first, b=pq.top().second.second, w=-pq.top().first; pq.pop(); bool wall=false;
        if(a==ex&&b==ey) { cout<<w<<'\n'; return; }
        for(int l=0;l<4;l++) {
            int x=a+nx[l], y=b+ny[l];
            if(x<0||x>=n||y<0||y>=m||grid[x][y]=='#') {
                wall=true; continue;
            }
            if(d[x][y]>d[a][b]+1) {
                d[x][y]=d[a][b]+1; pq.push({-d[x][y], {x, y}});
            }
        }
        int p=1000000000;
        if(!wall) {
            for(int l=0;l<4;l++) {
                int x=a, y=b; int k=0;
                while(x>=0&&y>=0&&x<n&&y<m&&grid[x][y]!='#') {
                    x+=nx[l]; y+=ny[l]; k++;
                }
                x-=nx[l]; y-=ny[l];
                p=min(p, k);
            }
        }
        else p=1;
        for(int l=0;l<4;l++) {
            int x=a, y=b;
            while(x>=0&&y>=0&&x<n&&y<m&&grid[x][y]!='#') {
                x+=nx[l]; y+=ny[l];
            }
            x-=nx[l], y-=ny[l];
            if(d[x][y]>d[a][b]+p) {
                d[x][y]=d[a][b]+p; pq.push({-d[x][y], {x, y}});
            }
        }
    }
}

int32_t main()
{

    int t; t=1;
    while(t--) {
        solve();
    }
    return 0;
}

Compilation message

portals.cpp: In function 'void solve()':
portals.cpp:25:13: warning: 'ex' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |         if(a==ex&&b==ey) { cout<<w<<'\n'; return; }
      |            ~^~~~
portals.cpp:25:20: warning: 'ey' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |         if(a==ex&&b==ey) { cout<<w<<'\n'; return; }
      |                   ~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 7 ms 460 KB Output is correct
6 Correct 8 ms 480 KB Output is correct
7 Correct 9 ms 488 KB Output is correct
8 Correct 5 ms 460 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 7 ms 460 KB Output is correct
15 Correct 8 ms 488 KB Output is correct
16 Correct 7 ms 460 KB Output is correct
17 Correct 9 ms 488 KB Output is correct
18 Correct 11 ms 460 KB Output is correct
19 Correct 6 ms 460 KB Output is correct
20 Correct 38 ms 492 KB Output is correct
21 Correct 7 ms 460 KB Output is correct
22 Correct 7 ms 480 KB Output is correct
23 Correct 8 ms 460 KB Output is correct
24 Correct 61 ms 488 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 5 ms 480 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 7 ms 460 KB Output is correct
15 Correct 8 ms 484 KB Output is correct
16 Correct 7 ms 460 KB Output is correct
17 Correct 9 ms 460 KB Output is correct
18 Correct 11 ms 460 KB Output is correct
19 Correct 6 ms 460 KB Output is correct
20 Correct 40 ms 460 KB Output is correct
21 Correct 7 ms 476 KB Output is correct
22 Correct 9 ms 460 KB Output is correct
23 Correct 8 ms 484 KB Output is correct
24 Correct 279 ms 5192 KB Output is correct
25 Execution timed out 1098 ms 5404 KB Time limit exceeded
26 Halted 0 ms 0 KB -