oj.uz

답안 #880002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880002 2023-11-28T14:42:51 Z Karoot 포탈들 (BOI14_portals) C++17
100 / 100
 198 ms 104632 KB 
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>

#define all(x)  (x).begin(), (x).end()
#define rall(x)  (x).rbegin(), (x).rend()

using namespace std;

typedef long long ll;

ll linf = 1e15+1;

inline void scoobydoobydoo(){
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

const int MAXN = 1e3+5;
bool arr[MAXN][MAXN];
int closestWall[MAXN][MAXN];
bool isVisited[MAXN][MAXN], firstVisited[MAXN][MAXN];
pair<int, int> portals[MAXN][MAXN][4];
vector<pair<int, int> > walls;
vector<pair<int, int> > portsZ[MAXN*MAXN];

int main(){
    scoobydoobydoo();
    //cout << 2 << endl;
    queue<vector<int>> q;
    //cout << "g" << endl;
    pair<int, int> start, ending;
    int r, c; cin >> r >> c;

    for (int i = 0; i <= c+1; i++){
        arr[0][i] = false;
        walls.push_back({0, i});
        q.push({0, i, 0});
    }


    
    for (int i = 1; i <= r; i++){
        arr[i][0] = false;
        walls.push_back({i, 0});
        q.push({i, 0, 0});
        isVisited[i][0] = true;
        firstVisited[i][0] = true;
        for (int j = 1; j <= c; j++){
            char l; cin >> l;
            arr[i][j] = (l != '#');
            if (l == '#'){
                q.push({i, j, 0});
                walls.push_back({i, j});
                isVisited[i][j] = true;
                firstVisited[i][j] = true;
            }
            if (l == 'S'){
                start = {i, j};
            }
            if (l == 'C'){
                ending = {i, j};
            }
        }
        arr[i][c+1] = false;
        walls.push_back({i, c+1});
        q.push({i, c+1, 0});
        isVisited[i][c+1] = true;
        firstVisited[i][c+1] = true;
    }

    queue<vector<int>> ql;
    ql.push({start.first, start.second, 0});
    int highest = 0;
    while (!ql.empty()){
        int x = ql.front()[0];
        int y = ql.front()[1];
        int w = ql.front()[2];
        ql.pop();
        if (x == ending.first && y == ending.second){
            highest = w;
            break;
        }
        if (arr[x-1][y] && !firstVisited[x-1][y]){
            firstVisited[x-1][y] = true;
            ql.push({x-1, y, w+1});
        }
        if (arr[x+1][y] && !firstVisited[x+1][y]){
            firstVisited[x+1][y] = true;
            ql.push({x+1, y, w+1});
        }
        if (arr[x][y-1] && !firstVisited[x][y-1]){
            firstVisited[x][y-1] = true;
            ql.push({x, y-1, w+1});
        }
        if (arr[x][y+1] && !firstVisited[x][y+1]){
            firstVisited[x][y+1] = true;
            ql.push({x, y+1, w+1});
        }
    }


    for (int i = 0; i <= c+1; i++){
        arr[r+1][i] = false;
        walls.push_back({r+1, i});
        q.push({r+1, i, 0});
    }

    while (!q.empty()){
        int i = q.front()[0];
        int j = q.front()[1];
        int w = q.front()[2];
        closestWall[i][j] = w;
        q.pop();
        if (i+1 < r && arr[i+1][j] && !isVisited[i+1][j]){
            q.push({i+1, j, w+1});
            isVisited[i+1][j] = true;
        }
        if (i-1 >= 0 && arr[i-1][j] && !isVisited[i-1][j]){
            q.push({i-1, j, w+1});
            isVisited[i-1][j] = true;
        }
        if (j+1 < c && arr[i][j+1] && !isVisited[i][j+1]){
            q.push({i, j+1, w+1});
            isVisited[i][j+1] = true;
        }
        if (j-1 >= 0 && arr[i][j-1] && !isVisited[i][j-1]){
            q.push({i, j-1, w+1});
            isVisited[i][j-1] = true;
        }
    }

    for (int i = 0; i <= r+1; i++){
        for (int j = 0; j <= c+1; j++){
            isVisited[i][j] = false;
        }
    }

    for (auto& e : walls){
        int i = e.first-1;
        int j = e.second;
        while (i >= 0 && arr[i][j]){
            portals[i][j][0] = {e.first-1, e.second};
            i--;
        }
        i = e.first+1;
        while (i <= r+1 && arr[i][j]){
            portals[i][j][1] = {e.first+1, e.second};
            i++;
        }
        i = e.first;
        j = e.second-1;
        while (j >= 0 && arr[i][j]){
            portals[i][j][2] = {e.first, e.second-1};
            j--;
        }
        j = e.second+1;
        while (j <= c+1 && arr[i][j]){
            portals[i][j][3] = {e.first, e.second+1};
            j++;
        }
    }

    queue<vector<int> > pq;
    pq.push({0, start.first, start.second});
    
    //int last = 0;
    while (!pq.empty()){
        int x = pq.front()[1];
        int y = pq.front()[2];
        int w = -pq.front()[0];
        //cout << x << " " << y << " " << w << endl;
        pq.pop();
        //if (vis[x][y])continue;
        if (x == ending.first && y == ending.second){
            cout << w << endl;
            return 0;
        }
        int closest = closestWall[x][y];
        //4 Dirs
        if (arr[x+1][y] && !isVisited[x+1][y]){
            pq.push({-(w+1), x+1, y});
            isVisited[x+1][y] = true;
        }
        if (arr[x-1][y] && !isVisited[x-1][y]){
            pq.push({-(w+1), x-1, y});
            isVisited[x-1][y] = true;
        }
        if (arr[x][y+1] && !isVisited[x][y+1]){
            pq.push({-(w+1), x, y+1});
            isVisited[x][y+1] = true;
        }
        if (arr[x][y-1] && !isVisited[x][y-1]){
            pq.push({-(w+1), x, y-1});
            isVisited[x][y-1] = true;
        }

        //4 Portals

        for (int i = 0; i < 4; i++){
            pair<int, int> e = portals[x][y][i];
            if (!isVisited[e.first][e.second] && w + closest <= highest){
                portsZ[w+closest].push_back({e.first, e.second});
            }
        }

        while (!portsZ[w+1].empty()){
            int x1 = portsZ[w+1][portsZ[w+1].size()-1].first;
            int y1 = portsZ[w+1][portsZ[w+1].size()-1].second;
            portsZ[w+1].pop_back();
            if (!arr[x1][y1])continue;
            if (!isVisited[x1][y1]){
                isVisited[x1][y1] = true;
                pq.push({-(w+1), x1, y1});
            }
            
        }
        
    }
    

    
    

    


    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 31576 KB Output is correct
2 Correct 6 ms 31324 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 6 ms 31336 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 6 ms 31324 KB Output is correct
7 Correct 6 ms 31404 KB Output is correct
8 Correct 7 ms 31320 KB Output is correct
9 Correct 6 ms 33372 KB Output is correct
10 Correct 7 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 8 ms 33372 KB Output is correct
14 Correct 6 ms 31324 KB Output is correct
15 Correct 7 ms 33372 KB Output is correct
16 Correct 6 ms 31364 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31324 KB Output is correct
2 Correct 6 ms 31344 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 6 ms 31324 KB Output is correct
5 Correct 14 ms 40920 KB Output is correct
6 Correct 15 ms 40920 KB Output is correct
7 Correct 13 ms 41052 KB Output is correct
8 Correct 11 ms 41016 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31320 KB Output is correct
2 Correct 6 ms 31324 KB Output is correct
3 Correct 6 ms 31324 KB Output is correct
4 Correct 7 ms 31580 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 6 ms 31368 KB Output is correct
7 Correct 6 ms 31324 KB Output is correct
8 Correct 6 ms 31324 KB Output is correct
9 Correct 7 ms 33396 KB Output is correct
10 Correct 7 ms 33372 KB Output is correct
11 Correct 7 ms 33408 KB Output is correct
12 Correct 8 ms 33372 KB Output is correct
13 Correct 7 ms 33372 KB Output is correct
14 Correct 14 ms 40920 KB Output is correct
15 Correct 14 ms 40920 KB Output is correct
16 Correct 13 ms 41052 KB Output is correct
17 Correct 13 ms 40892 KB Output is correct
18 Correct 17 ms 41052 KB Output is correct
19 Correct 9 ms 39512 KB Output is correct
20 Correct 12 ms 40284 KB Output is correct
21 Correct 14 ms 40940 KB Output is correct
22 Correct 23 ms 41104 KB Output is correct
23 Correct 13 ms 41048 KB Output is correct
24 Correct 12 ms 39552 KB Output is correct
25 Correct 6 ms 31324 KB Output is correct
26 Correct 7 ms 33368 KB Output is correct
27 Correct 6 ms 31324 KB Output is correct
28 Correct 12 ms 41308 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31324 KB Output is correct
2 Correct 7 ms 31324 KB Output is correct
3 Correct 7 ms 31320 KB Output is correct
4 Correct 6 ms 31320 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 6 ms 31324 KB Output is correct
7 Correct 6 ms 31324 KB Output is correct
8 Correct 6 ms 31320 KB Output is correct
9 Correct 7 ms 33412 KB Output is correct
10 Correct 8 ms 33372 KB Output is correct
11 Correct 8 ms 33628 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 7 ms 33400 KB Output is correct
14 Correct 13 ms 40920 KB Output is correct
15 Correct 14 ms 41104 KB Output is correct
16 Correct 13 ms 41048 KB Output is correct
17 Correct 12 ms 40796 KB Output is correct
18 Correct 13 ms 40796 KB Output is correct
19 Correct 9 ms 39516 KB Output is correct
20 Correct 12 ms 40280 KB Output is correct
21 Correct 14 ms 41088 KB Output is correct
22 Correct 14 ms 40960 KB Output is correct
23 Correct 14 ms 41308 KB Output is correct
24 Correct 176 ms 92532 KB Output is correct
25 Correct 144 ms 63756 KB Output is correct
26 Correct 70 ms 62804 KB Output is correct
27 Correct 159 ms 80252 KB Output is correct
28 Correct 195 ms 97972 KB Output is correct
29 Correct 198 ms 98484 KB Output is correct
30 Correct 186 ms 99644 KB Output is correct
31 Correct 11 ms 39516 KB Output is correct
32 Correct 140 ms 63000 KB Output is correct
33 Correct 6 ms 31324 KB Output is correct
34 Correct 7 ms 33372 KB Output is correct
35 Correct 122 ms 79136 KB Output is correct
36 Correct 6 ms 31324 KB Output is correct
37 Correct 11 ms 41096 KB Output is correct
38 Correct 140 ms 104632 KB Output is correct
39 Correct 111 ms 95924 KB Output is correct