Submission #76474420

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef string str;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using VI = vector<int>;
using VL = vector<ll>;
using VC = vector<char>;
using VS = vector<str>;
using P = pair<ll,ll>;
#define VE vector
#define pb push_back
#define sp ' '
#define fi first
#define se second
inline void scan(){}
template<class Head,class... Tail>
inline void scan(Head&head,Tail&... tail){std::cin>>head;scan(tail...);}
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")//早くなる呪文
//可変長引数のmin
template<class... T>
constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
//可変長引数のmax
template<class... T>
constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<typename T,typename U>inline bool chmax(T&a,U b){if(a<b){a=b;return 1;}return 0;}
template<typename T,typename U>inline bool chmin(T&a,U b){if(a>b){a=b;return 1;}return 0;}
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>b;i--)
#define urep(i,a,b) for(ull i=a;i<b;i++)
#define crep(i,a,b,c) for(ll i=a;i<b;i+=c)
#define ALL(x) std::begin(x),std::end(x)
#define RALL(x) std::rbegin(x),std::rend(x)
#define bit(x,i) (((x)>>(i))&1)
#define INF ((1LL<<62)-(1LL<<31))
//約数列挙　引数に取った整数の約数のvectorを返す
vector<ll>enumdiv(ll n){vector<ll>s;for(ll i = 1;i*i<=n;i++){if(n%i==0){s.push_back(i);if(i*i!=n)s.push_back(n/i);}}return s;}
// llで受け取れる奴
template<typename T> inline int len(vector<T>&a){return a.size();}
inline int len(string&a){return a.size();}
vector<ll> dx={1,0,-1,0};vector<ll> dy={0,1,0,-1};
vector<ll> edx={0,1,1,1,0,-1,-1,-1};vector<ll> edy={1,1,0,-1,-1,-1,0,1};
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;


int main(){
  LL(h,w,k);
  VE<VL> grid(h,VL(w));
  rep(i,0,h){
    rep(j,0,w){
      char c;
      cin>>c;
      grid[i][j]=(c-'0');
    }
  }
  VE<VL> rui(h+1,VL(w+1));
  rep(i,0,h){
    rep(j,0,w){
      rui[i+1][j+1]=rui[i+1][j]+rui[i][j+1]-rui[i][j]+grid[i][j];
    }
  }
  ll ans=0;
  rep(i,0,h){
    rep(j,0,w){
      rep(ii,i+1,h+1){
        rep(jj,j+1,w+1){
          if(k==rui[ii][jj]-rui[ii][j]-rui[i][jj]+rui[i][j]){
            ans++;
          }
        }
      }
    }
  }
  cout<<ans<<endl;
}

Submission Info

Judge Result