답안 #97094 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97094	2019-02-13T20:09:11 Z	dalgerok	포탈들 (BOI14_portals)	C++14	100 / 100	398 ms	41152 KB

portals

#include<bits/stdc++.h>
using namespace std;


const int N = 1005,
          INF = 1e9,
          dx[] = {-1, 0, 1, 0},
          dy[] = {0, -1, 0, 1};


int n, m;
char a[N][N];
int dist_to_wall[N][N], d[N][N];
int sx, sy, tx, ty;
pair < int, int > nxt[4][N][N];

inline bool is_wall(int x, int y){
    return x < 1 || x > n || y < 1 || y > m || a[x][y] == '#';
}

void walls(){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            dist_to_wall[i][j] = INF;
        }
    }
    queue < pair < int, int > > q;
    for(int i = 0; i <= n + 1; i++){
        for(int j = 0; j <= m + 1; j++){
            if(is_wall(i, j)){
                dist_to_wall[i][j] = 0;
                q.push(make_pair(i, j));
            }
        }
    }
    while(!q.empty()){
        int x = q.front().first,
            y = q.front().second;
        q.pop();
        for(int i = 0; i < 4; i++){
            int xx = x + dx[i],
                yy = y + dy[i];
            if(is_wall(xx, yy)){
                continue;
            }
            if(dist_to_wall[xx][yy] > dist_to_wall[x][y] + 1){
                dist_to_wall[xx][yy] = dist_to_wall[x][y] + 1;
                q.push(make_pair(xx, yy));
            }
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }
    walls();
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(j == 1 || a[i][j - 1] == '#'){
                nxt[0][i][j] = make_pair(i, j);
            }
            else{
                nxt[0][i][j] = nxt[0][i][j - 1];
            }
            if(i == 1 || a[i - 1][j] == '#'){
                nxt[1][i][j] = make_pair(i, j);
            }
            else{
                nxt[1][i][j] = nxt[1][i - 1][j];
            }
        }
    }
    for(int i = n; i >= 1; i--){
        for(int j = m; j >= 1; j--){
            if(j == m || a[i][j + 1] == '#'){
                nxt[2][i][j] = make_pair(i, j);
            }
            else{
                nxt[2][i][j] = nxt[2][i][j + 1];
            }
            if(i == n || a[i + 1][j] == '#'){
                nxt[3][i][j] = make_pair(i, j);
            }
            else{
                nxt[3][i][j] = nxt[3][i + 1][j];
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            d[i][j] = INF;
            if(a[i][j] == 'S'){
                sx = i;
                sy = j;
            }
            else if(a[i][j] == 'C'){
                tx = i;
                ty = j;
            }
        }
    }
    /**for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cout << dist_to_wall[i][j] << " ";
        }
        cout << "\n";
    }*/
    priority_queue < pair < int, pair < int, int > > > q;
    d[sx][sy] = 0;
    q.push(make_pair(0, make_pair(sx, sy)));
    while(!q.empty()){
        int val = -q.top().first,
            x = q.top().second.first,
            y = q.top().second.second;
        q.pop();
        if(d[x][y] < val){
            continue;
        }
        for(int i = 0; i < 4; i++){
            int xx = x + dx[i],
                yy = y + dy[i];
            if(!is_wall(xx, yy) && d[xx][yy] > d[x][y] + 1){
                d[xx][yy] = d[x][y] + 1;
                q.push(make_pair(-d[xx][yy], make_pair(xx, yy)));
            }
        }
        for(int i = 0; i < 4; i++){
            int xx = nxt[i][x][y].first,
                yy = nxt[i][x][y].second;
            if(d[xx][yy] > d[x][y] + dist_to_wall[x][y]){
                d[xx][yy] = d[x][y] + dist_to_wall[x][y];
                q.push(make_pair(-d[xx][yy], make_pair(xx, yy)));
            }
        }
    }
    cout << d[tx][ty];
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	640 KB	Output is correct
3	Correct	2 ms	640 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	512 KB	Output is correct
3	Correct	2 ms	640 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	3 ms	640 KB	Output is correct
8	Correct	4 ms	640 KB	Output is correct
9	Correct	3 ms	1664 KB	Output is correct
10	Correct	4 ms	1792 KB	Output is correct
11	Correct	3 ms	1664 KB	Output is correct
12	Correct	4 ms	1664 KB	Output is correct
13	Correct	4 ms	1664 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	4 ms	1664 KB	Output is correct
16	Correct	2 ms	460 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	640 KB	Output is correct
3	Correct	3 ms	640 KB	Output is correct
4	Correct	2 ms	640 KB	Output is correct
5	Correct	15 ms	6712 KB	Output is correct
6	Correct	18 ms	6732 KB	Output is correct
7	Correct	15 ms	6688 KB	Output is correct
8	Correct	13 ms	6684 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	640 KB	Output is correct
3	Correct	2 ms	640 KB	Output is correct
4	Correct	3 ms	512 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	4 ms	1664 KB	Output is correct
10	Correct	4 ms	1664 KB	Output is correct
11	Correct	4 ms	1664 KB	Output is correct
12	Correct	4 ms	1664 KB	Output is correct
13	Correct	4 ms	1664 KB	Output is correct
14	Correct	17 ms	6712 KB	Output is correct
15	Correct	15 ms	6704 KB	Output is correct
16	Correct	20 ms	6688 KB	Output is correct
17	Correct	13 ms	6744 KB	Output is correct
18	Correct	16 ms	6744 KB	Output is correct
19	Correct	17 ms	6656 KB	Output is correct
20	Correct	20 ms	6656 KB	Output is correct
21	Correct	14 ms	6712 KB	Output is correct
22	Correct	13 ms	6708 KB	Output is correct
23	Correct	14 ms	6708 KB	Output is correct
24	Correct	15 ms	6656 KB	Output is correct
25	Correct	2 ms	512 KB	Output is correct
26	Correct	4 ms	1664 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	11 ms	6684 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	612 KB	Output is correct
3	Correct	2 ms	640 KB	Output is correct
4	Correct	3 ms	512 KB	Output is correct
5	Correct	3 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	4 ms	1664 KB	Output is correct
10	Correct	4 ms	1664 KB	Output is correct
11	Correct	4 ms	1664 KB	Output is correct
12	Correct	4 ms	1664 KB	Output is correct
13	Correct	3 ms	1664 KB	Output is correct
14	Correct	12 ms	6712 KB	Output is correct
15	Correct	14 ms	6704 KB	Output is correct
16	Correct	14 ms	6688 KB	Output is correct
17	Correct	13 ms	6744 KB	Output is correct
18	Correct	15 ms	6744 KB	Output is correct
19	Correct	15 ms	6656 KB	Output is correct
20	Correct	14 ms	6656 KB	Output is correct
21	Correct	13 ms	6712 KB	Output is correct
22	Correct	13 ms	6708 KB	Output is correct
23	Correct	13 ms	6708 KB	Output is correct
24	Correct	241 ms	40796 KB	Output is correct
25	Correct	398 ms	41152 KB	Output is correct
26	Correct	381 ms	40952 KB	Output is correct
27	Correct	393 ms	40908 KB	Output is correct
28	Correct	231 ms	40880 KB	Output is correct
29	Correct	265 ms	40856 KB	Output is correct
30	Correct	291 ms	41000 KB	Output is correct
31	Correct	16 ms	6656 KB	Output is correct
32	Correct	321 ms	40824 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	4 ms	1664 KB	Output is correct
35	Correct	254 ms	40884 KB	Output is correct
36	Correct	2 ms	512 KB	Output is correct
37	Correct	10 ms	6684 KB	Output is correct
38	Correct	147 ms	40768 KB	Output is correct
39	Correct	192 ms	40980 KB	Output is correct

답안 #97094

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 19.0 / 19.0

Subtask #5 30.0 / 30.0

Subtask #1
11.0 / 11.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
19.0 / 19.0

Subtask #5
30.0 / 30.0