#378396 (C++14) No.124 門松列(3)

提出ソース

結果

問題	No.124 門松列(3)
ユーザー	fumiphys
提出日時	2019-09-12 21:20:43
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	8 ms / 5,000 ms
コード長	5,743 bytes
コンパイル時間	1,945 ms
コンパイル使用メモリ	182,516 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-02 17:10:23
合計ジャッジ時間	2,813 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	6 ms 6,944 KB
testcase_04	AC	7 ms 6,940 KB
testcase_05	AC	8 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	1 ms 6,944 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	2 ms 6,944 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,944 KB
testcase_23	AC	4 ms 6,940 KB
testcase_24	AC	5 ms 6,940 KB
testcase_25	AC	5 ms 6,940 KB
testcase_26	AC	3 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	8 ms 6,940 KB
testcase_29	AC	8 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#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 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 bit(n) (1LL<<(n))
// functions
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
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct Graph {
  int n;
  vector<vector<pair<int, T> > > edge;
  vector<T> dis;
  Graph(int n): n(n) {
    edge.resize(n);
    dis.resize(n);
  }
  void dijkstra(int s){
    dijkstra(s, 0);
  }
  T dijkstra(int s, int t){
    // initialize
    fill(dis.begin(), dis.end(), -1);
    vector<bool> used(n, false);
    dis[s] = 0;
    // dijkstra
    priority_queue<pair<T, int>, vector<pair<T, int> >, greater<pair<T, int> > > q;
    q.push(make_pair(0, s));
    while(!q.empty()){
      pair<T, int> p = q.top(); q.pop();
      int at = p.second;
      T distance = p.first;
      if(used[at])continue;
      used[at] = true;
      for(auto itr = edge[at].begin(); itr != edge[at].end(); ++itr){
        int to = (*itr).first;
        T cost = (*itr).second;
        if(used[to])continue;
        if(dis[to] == -1 || dis[to] > distance + cost){
          q.push(make_pair(distance + cost, to));
          dis[to] = distance + cost;
        }
      }
    }
    return dis[t];
  }
  void adde(int at, int to, T cost){
    edge[at].push_back(make_pair(to, cost));
  }
  [[deprecated("This function takes O(|edge[at]|).")]]
  void remove(int at, int to){
    int index = -1;
    for(int i = 0; i < edge[at].size(); i++){
      if(edge[at][i].first == to){
        index = i;
        break;
      }
    }
    edge[at].erase(edge[at].begin() + index);
  }
};

using GraphI = Graph<int>;
using GraphL = Graph<ll>;
using GraphD = Graph<double>;

int a[101][101];
/*
 *  0
 * 1 3
 *  2
 */

bool iskdm(int x, int y, int z){
  if(x == y || y == z || z == x)return false;
  if(y == max({x, y, z}))return true;
  if(y == min({x, y, z}))return true;
  return false;
}

int main(int argc, char const* argv[])
{
  int w, h;
  cin >> w >> h;
  rep(i, h){
    rep(j, w){
      cin >> a[i][j];
    }
  }
  GraphI g(4 * w * h);
  rep(i, h){
    rep(j, w){
      rep(k, 4){
        rep(l, 4){
          int px = i - dx[k];
          int py = j - dy[k];
          int nx = i + dx[l];
          int ny = j + dy[l];
          if(px >= 0 && px < h && py >= 0 && py < w &&
             nx >= 0 && nx < h && ny >= 0 && ny < w &&
             iskdm(a[px][py], a[i][j], a[nx][ny])){
            int id = i * w + j;
            //int pid = px * w + py;
            int nid = nx * w + ny;
            g.adde(4 * id + k, 4 * nid + l, 1);
          }
        }
      }
    }
  }
  int res = inf;
  g.dijkstra(4 + 1);
  if(g.dis[4 * (w * (h-1) + w-1) + 1] >= 0)res = min(res, g.dis[4 * (w * (h-1) + w-1) + 1]);
  if(g.dis[4 * (w * (h-1) + w-1)] >= 0)res = min(res, g.dis[4 * (w * (h-1) + w-1)]);
  g.dijkstra(4 * (w) + 0);
  if(g.dis[4 * (w * (h-1) + w-1) + 1] >= 0)res = min(res, g.dis[4 * (w * (h-1) + w-1) + 1]);
  if(g.dis[4 * (w * (h-1) + w-1)] >= 0)res = min(res, g.dis[4 * (w * (h-1) + w-1)]);
  if(res == inf)cout << -1 << endl;
  else cout << res + 1 << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード