제출 #973515

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
973515	2024-05-02 06:17:58	njoop	포탈들 (BOI14_portals)	C++17	100 / 100	187 ms	42560 KiB

portals

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
    #include <bits/stdc++.h>
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
    #define ti tuple<int, int, int>
    using namespace std;
     
    int r, c, dp[1010][1010], stx, sty, enx, eny, cx, cy, cdi, mn[1010][1010];
    int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
    char arr[1010][1010];
    pair<int, int> dir[4][1010][1010], cur;
    priority_queue<ti, vector<ti>, greater<ti>> pq;
     
    int main() {
        cin.tie(0)->sync_with_stdio(0);
        cin >> r >> c;
        for(int i=0; i<1010; i++) for(int j=0; j<1010; j++) arr[i][j] = '#';
        for(int i=1; i<=r; i++) {
            for(int j=1; j<=c; j++) {
                cin >> arr[i][j];
                if(arr[i][j] == 'S') {
                    stx = i;
                    sty = j;
                }
                if(arr[i][j] == 'C') {
                    enx = i;
                    eny = j;
                }
                dp[i][j] = 1e9;
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 19 / 19
• Subtask 5: 30 / 30