提出 #72728219

---

ソースコード 拡げる

# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

using ld=long double;
long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}

const ll MOD=998244353;
const ll INF=(1ll<<60);
int main(){
  ll N;
  cin>>N;
  vector<vector<char>> S(N,vector<char>(N));
  rep(i,N)rep(j,N) cin>>S[i][j];
  vector<vector<ll>> sumi(N,vl(N+1,0));
  vvl sumj(N,vl(N+1,0));
  rep(i,N){
    rep(j,N){
      if(S[i][j]=='#') sumi[i][j+1]=sumi[i][j]+1;
      else sumi[i][j+1]=sumi[i][j];
    }
  }
  rep(i,N){
    rep(j,N){
      if(S[j][i]=='#') sumj[i][j+1]=sumj[i][j]+1;
      else sumj[i][j+1]=sumj[i][j];
    }
  }
  vvl dp(N+1,vl(N+1,INF));
  dp[0][N]=0;
  for(ll i=0;i<=N;i++){
    for(ll j=N;j>=0;j--){
      if(i<N){
        dp[i+1][j]=min(dp[i+1][j],dp[i][j]+sumi[i][j]+((N-j)-(sumi[i][N]-sumi[i][j])));
      }
      if(j>0){
        dp[i][j-1]=min(dp[i][j-1],dp[i][j]+sumj[j-1][i]+((N-i)-(sumj[j-1][N]-sumj[j-1][i])));
      }
    }
  }
  cout<<dp[N][0]/2<<endl;
}

提出情報

ジャッジ結果