結果
問題 | No.971 いたずらっ子 |
ユーザー | NyaanNyaan |
提出日時 | 2020-01-17 21:34:38 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,316 bytes |
コンパイル時間 | 1,869 ms |
コンパイル使用メモリ | 178,772 KB |
実行使用メモリ | 8,064 KB |
最終ジャッジ日時 | 2024-06-25 18:53:24 |
合計ジャッジ時間 | 5,084 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | WA | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | AC | 3 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | RE | - |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | RE | - |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 1 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define fi first #define se second #define rep(i,N) for(long long i = 0; i < (long long)(N); i++) #define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--) #define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++) #define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--) #define each(x,v) for(auto& x : v) #define all(v) (v).begin(),(v).end() #define sz(v) ((int)(v).size()) #define ini(...) int __VA_ARGS__; in(__VA_ARGS__) #define inl(...) long long __VA_ARGS__; in(__VA_ARGS__) #define ins(...) string __VA_ARGS__; in(__VA_ARGS__) using namespace std; void solve(); using ll = long long; template<class T = ll> using V = vector<T>; using vi = V<int>; using vl = V<>; using vvi = V< V<int> >; constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1; struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya; template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; } void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);} void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);} template<typename T>void die(T x){out(x); exit(0);} #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0) #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0) #else #define trc(...) #define trca(...) int main(){solve();} #endif using P = pair<int,int>; using vp = V<P>; constexpr int MOD = /**/ 1000000007; //*/ 998244353; ////////// int H,W; const int dx[]={1,0,-1,0}; const int dy[]={0,1,0,-1};const int dn = 4; inline bool ok(int x,int y){return 0<=x && x<H && 0<=y && y<W ;} P d[256][256]; void solve(){ in(H , W); V<string> g(H); in(g); rep(i,H)rep(j,W) d[i][j] = P(inf , inf); using PP = pair<P , P>; priority_queue<PP , V<PP> , greater<PP> > Q; Q.emplace(P(0 , 0) , P(0 , 0)); d[0][0] = P(0 , 0); while(!Q.empty()){ auto cur = Q.top(); Q.pop(); if(cur.se == P(H - 1 , W - 1)) die(cur.fi.first); rep(k , dn){ int nh = cur.se.first + dx[k]; int nw = cur.se.second+ dy[k]; if(!ok(nh , nw)) continue; int nd = cur.first.first + 1; if(g[nh][nw] == 'k') nd += cur.first.second + 1; int ne = cur.first.second + 1; if( amin(d[nh][nw] , P(nd , ne) ) ){ Q.emplace(d[nh][nw] , P(nh , nw)); } } } }