Submission #72905044

Source Code Expand

    #include <iostream>
    #include <vector>
    #include <algorithm>
    #include <queue>
    #include <stack>
    #include <deque>
    #include <set>
    #include <map>
    #include <unordered_set>
    #include <unordered_map>
    #include <string>
    #include <cstring>
    #include <cmath>
    #include <numeric>
    using namespace std;
    int board[4001][4001];
    int dp[4001][4001];
    int pfx[4001][4001];
    int main() {
        int t;
        cin >> t;
        for(int q = 1; q<=t; q++){
            int n, r;
            cin >> n >> r;
            for(int i = 1; i<=n; i++){
                string s;
                cin >> s;
                for(int j = 0; j<s.size(); j++){
                    board[i][j+1] = (s[j] == '.')?0:1;
                }
                
            }
            dp[n][r] = 1;
            for(int i = 1; i<=n; i++){
                if(board[n][i] == 0)pfx[n][i] = 1;
            }
            for(int i = n-1; i>=1; i--){
                for(int j = 1; j<=n; j++){
                    if(board[i][j] == 0)pfx[i][j] = 1;
                    int a1 = dp[i+1][j-1];
                    int a2 = dp[i+1][j];
                    int a3 = dp[i+1][j+1];
                    if(a1+a2+a3 ==0)continue;
                    if(board[i][j] == 1){
                        if(pfx[i+1][j] == n-i){
                            dp[i][j] = 1;
                            pfx[i][j] = 1;
                        }
                    }
                    else if(board[i][j] == 0){
                        dp[i][j] = 1;
                        pfx[i][j] = 1;
                    }
                }
                for(int j = 1; j<=n; j++){
                    pfx[i][j] += pfx[i+1][j];
                }
            }
            for(int i = 1; i<=n; i++){
                cout << dp[1][i];
            }
            for(int i = 1; i<=n; i++){
                for(int j = 1; j<=n; j++){
                    //cout << dp[i][j] << ' ';
                    dp[i][j] = 0;
                    pfx[i][j] = 0;
                    board[i][j] = 0;
                }
                //cout << '\n';
            }
            cout << '\n';
        }    
        return 0;
    }

Submission Info

Submission Time
Task E - Climbing Silver
User tonystar0420
Language C++23 (GCC 15.2.0)
Score 450
Code Size 2273 Byte
Status AC
Exec Time 229 ms
Memory 144232 KiB

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:28:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                 for(int j = 0; j<s.size(); j++){
      |                                ~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 1
AC × 48
Set Name Test Cases
Sample sample_01.txt
All sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3664 KiB
test_01.txt AC 41 ms 3532 KiB
test_02.txt AC 51 ms 3660 KiB
test_03.txt AC 61 ms 3688 KiB
test_04.txt AC 74 ms 3632 KiB
test_05.txt AC 89 ms 3688 KiB
test_06.txt AC 107 ms 3460 KiB
test_07.txt AC 108 ms 3572 KiB
test_08.txt AC 127 ms 3632 KiB
test_09.txt AC 153 ms 3668 KiB
test_10.txt AC 173 ms 3596 KiB
test_11.txt AC 194 ms 3552 KiB
test_12.txt AC 220 ms 3836 KiB
test_13.txt AC 229 ms 3800 KiB
test_14.txt AC 169 ms 3876 KiB
test_15.txt AC 125 ms 8268 KiB
test_16.txt AC 125 ms 8268 KiB
test_17.txt AC 181 ms 144208 KiB
test_18.txt AC 178 ms 144212 KiB
test_19.txt AC 177 ms 144176 KiB
test_20.txt AC 179 ms 144200 KiB
test_21.txt AC 177 ms 144180 KiB
test_22.txt AC 177 ms 144204 KiB
test_23.txt AC 178 ms 144232 KiB
test_24.txt AC 186 ms 144080 KiB
test_25.txt AC 185 ms 144180 KiB
test_26.txt AC 188 ms 144176 KiB
test_27.txt AC 176 ms 144196 KiB
test_28.txt AC 176 ms 144096 KiB
test_29.txt AC 176 ms 144196 KiB
test_30.txt AC 177 ms 144208 KiB
test_31.txt AC 177 ms 144204 KiB
test_32.txt AC 180 ms 144116 KiB
test_33.txt AC 179 ms 144092 KiB
test_34.txt AC 182 ms 144200 KiB
test_35.txt AC 178 ms 144048 KiB
test_36.txt AC 179 ms 144100 KiB
test_37.txt AC 181 ms 144196 KiB
test_38.txt AC 177 ms 144212 KiB
test_39.txt AC 178 ms 144204 KiB
test_40.txt AC 178 ms 144180 KiB
test_41.txt AC 177 ms 144116 KiB
test_42.txt AC 186 ms 144056 KiB
test_43.txt AC 179 ms 144116 KiB
test_44.txt AC 180 ms 144204 KiB
test_45.txt AC 178 ms 144176 KiB
test_46.txt AC 183 ms 144128 KiB
test_47.txt AC 183 ms 144196 KiB