結果

問題 No.971 いたずらっ子
ユーザー ningenMeningenMe
提出日時 2020-01-18 15:15:16
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 794 ms / 2,000 ms
コード長 3,654 bytes
コンパイル時間 1,990 ms
コンパイル使用メモリ 179,172 KB
実行使用メモリ 42,496 KB
最終ジャッジ日時 2024-11-07 11:38:02
合計ジャッジ時間 8,773 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 787 ms
42,368 KB
testcase_01 AC 794 ms
42,496 KB
testcase_02 AC 577 ms
30,848 KB
testcase_03 AC 637 ms
42,240 KB
testcase_04 AC 599 ms
39,936 KB
testcase_05 AC 633 ms
42,368 KB
testcase_06 AC 475 ms
30,976 KB
testcase_07 AC 7 ms
5,248 KB
testcase_08 AC 150 ms
13,440 KB
testcase_09 AC 147 ms
13,184 KB
testcase_10 AC 5 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int H,W; cin >> H >> W;
	vector<string> S(H);
	for(int i = 0; i < H; ++i) cin >> S[i];
	auto dp = multivector(H,W,LOWINF);
	dp[0][0] = 0;
	PQR<pair<ll,int>> pq;
	pq.push({0,0});
	while(pq.size()) {
		auto p = pq.top();
		pq.pop();
		int y = p.second/W;
		int x = p.second%W;
		if(y==H-1&&x==W-1) break;
		if(y+1<H){
			if(S[y+1][x]=='.'){
				if(dp[y+1][x]>dp[y][x]+1){
					dp[y+1][x]=dp[y][x]+1;
					pq.push({dp[y+1][x],(y+1)*W+x});
				}
			}
			else{
				if(dp[y+1][x]>(dp[y][x]+1+y+1+x)){
					dp[y+1][x]=(dp[y][x]+1+y+1+x);
					pq.push({dp[y+1][x],(y+1)*W+x});
				}
			}
		}
		if(x+1<W){
			if(S[y][x+1]=='.'){
				if(dp[y][x+1]>dp[y][x]+1){
					dp[y][x+1]=dp[y][x]+1;
					pq.push({dp[y][x+1],y*W+x+1});
				}
			}
			else{
				if(dp[y][x+1]>dp[y][x]+1+y+x+1){
					dp[y][x+1]=dp[y][x]+1+y+x+1;
					pq.push({dp[y][x+1],y*W+x+1});
				}
			}
		}
	}
	cout << dp[H-1][W-1] << endl;
    return 0;
}
0