/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 560.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 1ms 532.0 KiB
#9 Accepted 1ms 532.0 KiB
#10 Accepted 1ms 532.0 KiB
#11 Accepted 2ms 532.0 KiB
#12 Accepted 2ms 320.0 KiB
#13 Accepted 3ms 320.0 KiB
#14 Accepted 5ms 484.0 KiB
#15 Accepted 4ms 532.0 KiB
#16 Accepted 4ms 532.0 KiB
#17 Accepted 4ms 532.0 KiB
#18 Accepted 4ms 532.0 KiB
#19 Accepted 4ms 532.0 KiB
#20 Accepted 4ms 532.0 KiB
#21 Accepted 4ms 532.0 KiB
#22 Accepted 4ms 532.0 KiB
#23 Accepted 4ms 544.0 KiB
#24 Accepted 4ms 532.0 KiB
#25 Accepted 4ms 532.0 KiB
#26 Accepted 4ms 532.0 KiB
#27 Accepted 4ms 532.0 KiB
#28 Accepted 4ms 444.0 KiB
#29 Accepted 4ms 532.0 KiB
#30 Accepted 4ms 532.0 KiB
#31 Accepted 4ms 532.0 KiB
#32 Accepted 4ms 532.0 KiB
#33 Accepted 4ms 532.0 KiB
#34 Accepted 4ms 324.0 KiB
#35 Accepted 4ms 532.0 KiB
#36 Accepted 4ms 532.0 KiB
#37 Accepted 5ms 764.0 KiB
#38 Accepted 4ms 532.0 KiB
#39 Accepted 4ms 532.0 KiB
#40 Accepted 4ms 480.0 KiB
#41 Accepted 4ms 532.0 KiB
#42 Accepted 4ms 532.0 KiB
#43 Accepted 4ms 532.0 KiB
#44 Accepted 4ms 532.0 KiB
#45 Accepted 4ms 532.0 KiB
#46 Accepted 4ms 532.0 KiB
#47 Accepted 4ms 532.0 KiB
#48 Accepted 4ms 532.0 KiB
#49 Accepted 4ms 324.0 KiB
#50 Accepted 4ms 532.0 KiB
#51 Accepted 4ms 532.0 KiB
#52 Accepted 4ms 320.0 KiB
#53 Accepted 4ms 532.0 KiB
#54 Accepted 4ms 344.0 KiB
#55 Accepted 4ms 532.0 KiB
#56 Accepted 4ms 532.0 KiB
#57 Accepted 4ms 324.0 KiB
#58 Accepted 4ms 532.0 KiB
#59 Accepted 4ms 488.0 KiB
#60 Accepted 4ms 532.0 KiB
#61 Accepted 4ms 576.0 KiB
#62 Accepted 4ms 580.0 KiB
#63 Accepted 4ms 532.0 KiB
#64 Accepted 4ms 576.0 KiB
#65 Accepted 4ms 532.0 KiB
#66 Accepted 4ms 532.0 KiB
#67 Accepted 5ms 532.0 KiB
#68 Accepted 4ms 532.0 KiB
#69 Accepted 4ms 532.0 KiB
#70 Accepted 4ms 532.0 KiB
#71 Accepted 4ms 532.0 KiB
#72 Accepted 4ms 532.0 KiB
#73 Accepted 5ms 532.0 KiB
#74 Accepted 4ms 532.0 KiB
#75 Accepted 4ms 536.0 KiB
#76 Accepted 4ms 532.0 KiB
#77 Accepted 4ms 532.0 KiB
#78 Accepted 4ms 532.0 KiB
#79 Accepted 4ms 532.0 KiB
#80 Accepted 4ms 532.0 KiB
#81 Accepted 4ms 532.0 KiB
#82 Accepted 4ms 532.0 KiB
#83 Accepted 4ms 532.0 KiB
#84 Accepted 4ms 536.0 KiB
#85 Accepted 4ms 532.0 KiB
#86 Accepted 4ms 532.0 KiB
#87 Accepted 4ms 532.0 KiB
#88 Accepted 4ms 532.0 KiB
#89 Accepted 4ms 532.0 KiB
#90 Accepted 4ms 532.0 KiB
#91 Accepted 4ms 532.0 KiB
#92 Accepted 4ms 324.0 KiB
#93 Accepted 4ms 572.0 KiB
#94 Accepted 4ms 328.0 KiB
#95 Accepted 4ms 532.0 KiB
#96 Accepted 4ms 532.0 KiB
#97 Accepted 4ms 532.0 KiB
#98 Accepted 4ms 532.0 KiB
#99 Accepted 4ms 532.0 KiB
#100 Accepted 4ms 532.0 KiB

Code

/*
 *   Copyright (c) 2024 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr freopen("input52.txt","r",stdin);
//ofstream file("output52.txt");
char a[2001][2001];
int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //fr;
    int t;  cin >> t; while(t--)
    {
        ll n,m,x,y; cin >> n >> m >> x >> y;
        vector<vector<pair<ll,ll>>> dp(n+2,vector<pair<ll,ll>>(m+2,{1e18,1e18}));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++) cin >> a[i][j];
        }
        dp[1][1] = {0,0};
        for(int j=2;j<=m;j++) 
        {
            if(a[1][j]=='#') break;
            dp[1][j] = {dp[1][j-1].first + x , dp[1][j-1].first+y};
        }
        for(ll i=2;i<=n;i++)
        {
            for(ll j=1;j<=m;j++)
            {
                if(a[i][j]=='#') continue;
                dp[i][j].first = min(dp[i][j-1].first+x , dp[i-1][j].second+y);
                dp[i][j].second = min(dp[i][j-1].first+y , dp[i-1][j].second+x);
            }
            for(ll j=m;j>=1;j--)
            {
                if(a[i][j]=='#') continue;
                dp[i][j].first = min({dp[i][j].first , dp[i][j+1].first+x, dp[i-1][j].second+y});
                dp[i][j].second = min({dp[i][j].second , dp[i][j+1].first+y , dp[i-1][j].second+x});
            }
        }
        ll ans = min(dp[n][m-1].first , dp[n-1][m].second);
        (ans>=1e18)? cout<<-1<<'\n': cout<<ans<<'\n';
    }
}

Information

Submit By
Type
Submission
Problem
P1156 Low cost water management
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-30 09:25:31
Judged At
2024-12-30 09:25:31
Judged By
Score
100
Total Time
5ms
Peak Memory
764.0 KiB