結果

問題 No.611 Day of the Mountain
コンテスト
ユーザー fumiphys
提出日時 2019-07-27 19:18:31
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 273 ms / 2,017 ms
コード長 4,920 bytes
コンパイル時間 1,786 ms
コンパイル使用メモリ 180,352 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-02 11:10:27
合計ジャッジ時間 3,393 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 201712111;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(h); INT(w);
  vector<string> st(h); cin >> st;
  vector<string> s;
  if(w <= h){
    s = st;
  }else{
    s = vector<string>(w);
    rep(i, w)rep(j, h)s[i][j] = st[j][i];
    swap(h, w);
  }
  vector<vector<ll>> dp(h, vector<ll>(w, 0));
  rep(i, h)rep(j, w){
    int c = (s[i][j] == '?'? 1: int(s[i][j] - '0'));
    if(i == 0 && j == 0)dp[i][j] = c;
    else{
      dp[i][j] = inf;
      if(i - 1 >= 0)dp[i][j] = min(dp[i][j], dp[i-1][j] + c);
      if(j - 1 >= 0)dp[i][j] = min(dp[i][j], dp[i][j-1] + c);
    }
  }
  int T = dp[h-1][w-1];
  cout << T << endl;
  vector<ll> v(bit(w), 0); v[1] = 1;
  rep(i, h)rep(j, w){
    if(i == 0 && j == 0)continue;
    vector<ll> vn(bit(w), 0);
    int c = (s[i][j] == '?'? 0: int(s[i][j] - '0'));
    rep(k, sz(v)){
      int stat = (k << 1) & (bit(w) - 1);
      if(c > 0){
        bool ok = false;
        if(i > 0 && dp[i-1][j] + c == dp[i][j] && (k & bit(w-1)))ok = true;
        if(j > 0 && dp[i][j-1] + c == dp[i][j] && (k & 1))ok = true;
        if(ok)(vn[stat | 1] += v[k]) %= mod;
        else (vn[stat] += v[k]) %= mod;
      }else{
        bool ok = false;
        if(i > 0 && dp[i-1][j] + 1 == dp[i][j] && (k & bit(w-1)))ok = true;
        if(j > 0 && dp[i][j-1] + 1 == dp[i][j] && (k & 1))ok = true;
        if(ok)(vn[stat | 1] += v[k]) %= mod;
        else (vn[stat] += v[k]) %= mod;
        (vn[stat] += 8 * v[k] % mod) %= mod;
      }
    }
    swap(vn, v);
  }
  ll res = 0;
  rep(i, bit(w))if(i & 1)res = (res + v[i]) % mod;
  cout << res << endl;
  return 0;
}
0