結果

問題 No.34 砂漠の行商人
ユーザー fumiphysfumiphys
提出日時 2020-04-10 21:12:50
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 550 ms / 5,000 ms
コード長 4,028 bytes
コンパイル時間 1,529 ms
コンパイル使用メモリ 170,620 KB
実行使用メモリ 17,540 KB
最終ジャッジ日時 2023-10-13 20:49:53
合計ジャッジ時間 5,161 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,432 KB
testcase_01 AC 2 ms
5,604 KB
testcase_02 AC 3 ms
5,956 KB
testcase_03 AC 2 ms
5,516 KB
testcase_04 AC 11 ms
9,272 KB
testcase_05 AC 12 ms
9,260 KB
testcase_06 AC 5 ms
9,300 KB
testcase_07 AC 19 ms
11,756 KB
testcase_08 AC 26 ms
15,040 KB
testcase_09 AC 177 ms
14,492 KB
testcase_10 AC 21 ms
11,864 KB
testcase_11 AC 354 ms
16,904 KB
testcase_12 AC 9 ms
7,356 KB
testcase_13 AC 550 ms
17,540 KB
testcase_14 AC 428 ms
16,968 KB
testcase_15 AC 4 ms
7,656 KB
testcase_16 AC 33 ms
8,904 KB
testcase_17 AC 3 ms
7,508 KB
testcase_18 AC 5 ms
6,116 KB
testcase_19 AC 133 ms
14,912 KB
testcase_20 AC 223 ms
16,888 KB
testcase_21 AC 3 ms
5,852 KB
testcase_22 AC 7 ms
8,168 KB
testcase_23 AC 4 ms
5,988 KB
testcase_24 AC 307 ms
16,956 KB
testcase_25 AC 20 ms
9,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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 whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
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(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

int l[110][110];
const int b = 10001;
using bts = bitset<b>;
bts bt[10010];
int n;

int idx(int i, int j){
  return i * n + j;
}

struct State{
  int i, j, r, c;
  State(int i, int j, int r, int c): i(i), j(j), r(r), c(c){}
};

bool in(int i, int j){
  return (i >= 0) && (i < n) && (j >= 0) && (j < n);
}

int main(int argc, char const* argv[])
{
  int v; cin >> n >> v;
  int sx, sy, gx, gy; cin >> sx >> sy >> gx >> gy, sx--, sy--, gx--, gy--;
  swap(sx, sy);
  swap(gx, gy);
  rep(i, n){
    rep(j, n)cin >> l[i][j];
  }
  queue<State> q;
  q.push(State(sx, sy, v, 0));
  bt[idx(sx, sy)][v] = 1;
  while(!q.empty()){
    auto p = q.front(); q.pop();
    if(p.i == gx && p.j == gy){
      cout << p.c << endl;
      return 0;
    }
    if(v - p.r > 2 * n * 10)continue;
    rep(k, 4){
      int nx = p.i + dx[k], ny = p.j + dy[k];
      if(in(nx, ny) && p.r - l[nx][ny] > 0 && !bt[idx(nx, ny)][p.r - l[nx][ny]]){
        bt[idx(nx, ny)][p.r - l[nx][ny]] = 1;
        q.push(State(nx, ny, p.r - l[nx][ny], p.c + 1));
      }
    }
  }
  cout << -1 << endl;
  return 0;
}
0