oj.uz

Submission #7195

# Submission time Handle Problem Language Result Execution time Memory
7195 2014-07-27T14:49:32 Z baneling100 Portals (BOI14_portals) C++
100 / 100
 344 ms 34128 KB 
#include <stdio.h>
#include <queue>
#define INF 0x7fffffff

using namespace std;

queue <int> Q;
int R, C, Sy, Sx, Cy, Cx, A[1002][1002], B[1002][1002], D[1001][1001];
int Dy[4]={0,1,0,-1}, Dx[4]={1,0,-1,0};
int Left[1001][1001], Right[1001][1001], Up[1001][1001], Down[1001][1001];

void input(void)
{
    int i, j, x;
    char temp[1002];

    scanf("%d %d",&R,&C);
    for(i=1 ; i<=R ; i++)
    {
        scanf("%s",&temp[1]);
        for(j=1 ; j<=C ; j++)
        {
            if(temp[j]=='#')
                A[i][j]=1;
            else if(temp[j]=='S')
            {
                Sy=i;
                Sx=j;
            }
            else if(temp[j]=='C')
            {
                Cy=i;
                Cx=j;
            }
            D[i][j]=INF;
        }
    }
    for(i=1 ; i<=R ; i++)
    {
        x=0;
        for(j=1 ; j<=C ; j++)
        {
            if(A[i][j])
                x=0;
            else
            {
                if(!x)
                    x=j;
                Left[i][j]=x;
            }
        }
        x=0;
        for(j=C ; j>=1 ; j--)
        {
            if(A[i][j])
                x=0;
            else
            {
                if(!x)
                    x=j;
                Right[i][j]=x;
            }
        }
    }
    for(i=1 ; i<=C ; i++)
    {
        x=0;
        for(j=1 ; j<=R ; j++)
        {
            if(A[j][i])
                x=0;
            else
            {
                if(!x)
                    x=j;
                Up[j][i]=x;
            }
        }
        x=0;
        for(j=R ; j>=1 ; j--)
        {
            if(A[j][i])
                x=0;
            else
            {
                if(!x)
                    x=j;
                Down[j][i]=x;
            }
        }
    }
}

void process(void)
{
    int i, j, y, x, ty, tx;

    for(i=0 ; i<=R+1 ; i++)
        for(j=0 ; j<=C+1 ; j++)
        {
            B[i][j]=INF;
            if(i==0 || i==R+1 || j==0 || j==C+1 || A[i][j])
            {
                B[i][j]=0;
                Q.push(i);
                Q.push(j);
            }
        }
    while(!Q.empty())
    {
        y=Q.front();
        Q.pop();
        x=Q.front();
        Q.pop();
        for(i=0 ; i<=3 ; i++)
        {
            ty=y+Dy[i];
            tx=x+Dx[i];
            if(ty>=0 && ty<=R+1 && tx>=0 && tx<=C+1)
                if(B[ty][tx]>B[y][x]+1)
                {
                    B[ty][tx]=B[y][x]+1;
                    Q.push(ty);
                    Q.push(tx);
                }
        }
    }
    D[Sy][Sx]=0;
    Q.push(Sy);
    Q.push(Sx);
    while(!Q.empty())
    {
        y=Q.front();
        Q.pop();
        x=Q.front();
        Q.pop();
        for(i=0 ; i<=3 ; i++)
        {
            ty=y+Dy[i];
            tx=x+Dx[i];
            if(ty>=1 && ty<=R && tx>=1 && tx<=C && !A[ty][tx])
                if(D[ty][tx]>D[y][x]+1)
                {
                    D[ty][tx]=D[y][x]+1;
                    Q.push(ty);
                    Q.push(tx);
                }
        }
        ty=y;
        tx=Left[y][x];
        if(D[ty][tx]>D[y][x]+B[y][x])
        {
            D[ty][tx]=D[y][x]+B[y][x];
            Q.push(ty);
            Q.push(tx);
        }
        ty=y;
        tx=Right[y][x];
        if(D[ty][tx]>D[y][x]+B[y][x])
        {
            D[ty][tx]=D[y][x]+B[y][x];
            Q.push(ty);
            Q.push(tx);
        }
        ty=Up[y][x];
        tx=x;
        if(D[ty][tx]>D[y][x]+B[y][x])
        {
            D[ty][tx]=D[y][x]+B[y][x];
            Q.push(ty);
            Q.push(tx);
        }
        ty=Down[y][x];
        tx=x;
        if(D[ty][tx]>D[y][x]+B[y][x])
        {
            D[ty][tx]=D[y][x]+B[y][x];
            Q.push(ty);
            Q.push(tx);
        }
    }
}

void output(void)
{
    printf("%d",D[Cy][Cx]);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 28656 KB Output is correct
2 Correct 0 ms 28656 KB Output is correct
3 Correct 0 ms 28656 KB Output is correct
4 Correct 0 ms 28656 KB Output is correct
5 Correct 8 ms 28788 KB Output is correct
6 Correct 0 ms 28788 KB Output is correct
7 Correct 0 ms 28788 KB Output is correct
8 Correct 0 ms 28788 KB Output is correct

Subtask #4
19.0 / 19.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 28656 KB Output is correct
2 Correct 0 ms 28656 KB Output is correct
3 Correct 0 ms 28656 KB Output is correct
4 Correct 0 ms 28656 KB Output is correct
5 Correct 0 ms 28656 KB Output is correct
6 Correct 0 ms 28656 KB Output is correct
7 Correct 0 ms 28656 KB Output is correct
8 Correct 0 ms 28656 KB Output is correct
9 Correct 0 ms 28656 KB Output is correct
10 Correct 0 ms 28656 KB Output is correct
11 Correct 0 ms 28656 KB Output is correct
12 Correct 0 ms 28656 KB Output is correct
13 Correct 0 ms 28656 KB Output is correct
14 Correct 0 ms 28788 KB Output is correct
15 Correct 8 ms 28788 KB Output is correct
16 Correct 8 ms 28788 KB Output is correct
17 Correct 8 ms 28784 KB Output is correct
18 Correct 0 ms 28784 KB Output is correct
19 Correct 4 ms 28656 KB Output is correct
20 Correct 12 ms 28656 KB Output is correct
21 Correct 0 ms 28788 KB Output is correct
22 Correct 4 ms 28788 KB Output is correct
23 Correct 0 ms 28788 KB Output is correct
24 Correct 224 ms 32676 KB Output is correct
25 Correct 344 ms 28788 KB Output is correct
26 Correct 292 ms 28656 KB Output is correct
27 Correct 324 ms 28656 KB Output is correct
28 Correct 168 ms 33336 KB Output is correct
29 Correct 196 ms 33468 KB Output is correct
30 Correct 216 ms 33468 KB Output is correct
31 Correct 8 ms 28656 KB Output is correct
32 Correct 236 ms 28656 KB Output is correct
33 Correct 0 ms 28656 KB Output is correct
34 Correct 0 ms 28656 KB Output is correct
35 Correct 208 ms 30664 KB Output is correct
36 Correct 0 ms 28656 KB Output is correct
37 Correct 0 ms 28788 KB Output is correct
38 Correct 144 ms 34128 KB Output is correct
39 Correct 140 ms 32808 KB Output is correct