提出 #54591529

---

ソースコード 拡げる

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair
#define ins insert
#define chkmn(x,y) (x)=min((x), (y))
#define chkmx(x,y) (x)=max((x), (y))
#define rep(i,a,b) for(int i=a;i<b;i++)

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

using ll = long long;
using ull = unsigned long long ;
using ld = long double ;
using str = string;
//using ordered_set=tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>;

const double PI=acos(-1);
const ll INF = 1LL<<62;
const ll MINF = -(1LL<<62);

template<typename T> T getint() {
    T val=0;
    char c;
    
    bool neg=false;
    while((c=gc()) && !(c>='0' && c<='9')) {
        neg|=c=='-';
    }

    do {
        val=(val*10)+c-'0';
    } while((c=gc()) && (c>='0' && c<='9'));

    return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)

int dx[5]={-1,1,0,0,0};
int dy[5]={0,0,-1,1,0};
int main() {
    IO;
    int h,w,k;
    cin>>h>>w>>k;
    int sx,sy;
    cin>>sx>>sy;
    vector<vector<int>> t(h, vector<int>(w));
    for(int i=0;i<h;++i) {
        for(int j=0;j<w;++j) cin>>t[i][j];
    } 
    vector<vector<ll>> dp(h, vector<ll>(w,MINF));
    dp[sx-1][sy-1]=0;
    ll ans=MINF;
    for(int c=0;c<min(k,h*w*2);++c) {
        vector<vector<ll>> ndp(h, vector<ll>(w,MINF));
        for(int i=0;i<h;++i) {
            for(int j=0;j<w;++j) {
                for(int l=0;l<5;++l) {
                    int ni=i+dx[l];
                    int nj=j+dy[l];
                    if(ni>=0 && nj>=0 && ni<h && nj<w) {
                        ndp[i][j]=max(ndp[i][j], dp[ni][nj]+t[i][j]);
                    }
                }
            }
        }        
        dp.swap(ndp);
        for(int i=0;i<h;++i) {
            for(int j=0;j<w;++j) {
                ll rem=k-c-1;
                chkmx(ans, rem*t[i][j]+dp[i][j]);
            }
        }
    }
    cout<<ans<<"\n";
    
    return 0;
}

提出情報

ジャッジ結果