2020 CCPC Wannafly Winter Camp Day7 G

草莓2

如果k<mn那么暴搜一下就行了，如果大于。那么我们走完每一个地方后，我们每次走都是一个环并且走$k-m\ast n$次。每次权值是mn。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int a[12][12],t[12][12];
int to[4][2] = {{1, 0}, {-1, 0}, {0, -1}, {0, 1}};
ll k, n, m;
ll ans = 0;
void dfs(int x,int y,int now, ll sum){
    if(now >= k){
        ans = max(ans, sum);
        return ;
    }
    //cout<<sum<<' '<<now<<'\n';
    for(int i = 0; i < 4; i ++){
        int tx = x + to[i][0], ty = y + to[i][1];
        if(tx <= 0 || tx > n || ty <= 0 || ty > m) continue;
        int tmp = a[tx][ty] + now;
        a[tx][ty] -= tmp;
        dfs(tx, ty, now + 1, sum + tmp);
        a[tx][ty] += tmp;
    }
}
int main(){
    ll x,y;
    cin>>n>>m>>x>>y>>k;
    ll sum = 0;
    for(int i = 1;i<=n;i++){
        for(int j = 1; j <= m; j ++){
            cin>>a[i][j];
            sum += a[i][j];
        }
    }
    if(k < n * m){
        int tmp=a[x][y];
        a[x][y]=0;
        dfs(x, y, 1, tmp);
    }
    else{
        ans = (n * m)/2 * (n * m - 1) + sum + (k - n * m) * (n * m);
    }
    cout<< ans<<endl;
}