結果
問題 | No.340 雪の足跡 |
ユーザー | kei |
提出日時 | 2018-10-26 17:28:41 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 156 ms / 1,000 ms |
コード長 | 4,257 bytes |
コンパイル時間 | 1,726 ms |
コンパイル使用メモリ | 179,260 KB |
実行使用メモリ | 15,468 KB |
最終ジャッジ日時 | 2024-04-29 22:02:19 |
合計ジャッジ時間 | 5,349 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
7,424 KB |
testcase_01 | AC | 4 ms
7,424 KB |
testcase_02 | AC | 4 ms
7,312 KB |
testcase_03 | AC | 4 ms
7,552 KB |
testcase_04 | AC | 3 ms
7,552 KB |
testcase_05 | AC | 4 ms
7,332 KB |
testcase_06 | AC | 4 ms
7,680 KB |
testcase_07 | AC | 3 ms
7,552 KB |
testcase_08 | AC | 4 ms
7,552 KB |
testcase_09 | AC | 4 ms
7,552 KB |
testcase_10 | AC | 3 ms
7,680 KB |
testcase_11 | AC | 4 ms
7,808 KB |
testcase_12 | AC | 5 ms
7,808 KB |
testcase_13 | AC | 5 ms
7,936 KB |
testcase_14 | AC | 11 ms
9,600 KB |
testcase_15 | AC | 13 ms
9,984 KB |
testcase_16 | AC | 11 ms
8,960 KB |
testcase_17 | AC | 16 ms
9,856 KB |
testcase_18 | AC | 13 ms
9,856 KB |
testcase_19 | AC | 15 ms
9,984 KB |
testcase_20 | AC | 115 ms
15,360 KB |
testcase_21 | AC | 73 ms
7,680 KB |
testcase_22 | AC | 15 ms
15,220 KB |
testcase_23 | AC | 121 ms
15,308 KB |
testcase_24 | AC | 101 ms
15,360 KB |
testcase_25 | AC | 111 ms
15,340 KB |
testcase_26 | AC | 22 ms
9,344 KB |
testcase_27 | AC | 8 ms
7,552 KB |
testcase_28 | AC | 20 ms
9,344 KB |
testcase_29 | AC | 124 ms
15,104 KB |
testcase_30 | AC | 88 ms
11,648 KB |
testcase_31 | AC | 131 ms
14,720 KB |
testcase_32 | AC | 156 ms
15,468 KB |
testcase_33 | AC | 126 ms
15,340 KB |
testcase_34 | AC | 155 ms
15,340 KB |
testcase_35 | AC | 131 ms
15,360 KB |
testcase_36 | AC | 129 ms
15,440 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/340> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ int dx[4] = {1,0,-1,0}; int dy[4] = {0,1,0,-1}; int coord2idx(const pii& coor,const int H,const int W){ return coor.first*W + coor.second; } pii idx2coord(const int idx,const int H,const int W){ return make_pair(idx/W, idx%W); } int yoko[1010][1010]; int tate[1010][1010]; int dist[1010][1010]; string solve(){ string res; int W,H,N; cin >> W >> H >> N; for(int _ = 0; _ < N; _++){ int M; cin >> M; vector<int> B(M+1); for(auto& in:B) cin >> in; for(int i = 0; i < M; i++){ int S = B[i],T = B[i+1]; pii sc = idx2coord(S, H, W),tc = idx2coord(T, H, W); if(sc.first == tc.first){ // 縦方向移動 yoko[sc.first][min(sc.second,tc.second)]++; yoko[sc.first][max(sc.second,tc.second)]--; } if(sc.second == tc.second){ // 横方向移動 tate[min(sc.first,tc.first)][sc.second]++; tate[max(sc.first,tc.first)][sc.second]--; } } } for(int i = 0; i < H;i++){ for(int j = 1; j <= W;j++){ yoko[i][j] += yoko[i][j-1]; } } for(int j = 0; j < W;j++){ for(int i = 1; i <= H;i++){ tate[i][j] += tate[i-1][j]; } } // cout << "===" << endl; // for(int i = 0; i < H;i++){ // for(int j = 0; j < W;j++){ // cout << tate[i][j] << " "; // }cout << endl; // } // cout << "===" << endl; // for(int i = 0; i < H;i++){ // for(int j = 0; j < W;j++){ // cout << yoko[i][j] << " "; // }cout << endl; // } fill(*dist,*dist+1010*1010,INF); dist[0][0] = 0; queue<pii> q; q.push(make_pair(0, 0)); while(q.size()){ int y,x; tie(y,x)= q.front(); q.pop(); if(tate[y][x]>0){ if(dist[y+1][x] > dist[y][x] + 1){ dist[y+1][x] = dist[y][x] + 1; q.push(make_pair(y+1, x)); } } if(yoko[y][x]>0){ if(dist[y][x+1] > dist[y][x] + 1){ dist[y][x+1] = dist[y][x] + 1; q.push(make_pair(y, x+1)); } } if(y){ if(tate[y-1][x]>0){ if(dist[y-1][x] > dist[y][x] + 1){ dist[y-1][x] = dist[y][x] + 1; q.push(make_pair(y-1, x)); } } } if(x){ if(yoko[y][x-1]>0){ if(dist[y][x-1] > dist[y][x] + 1){ dist[y][x-1] = dist[y][x] + 1; q.push(make_pair(y, x-1)); } } } } res = to_string(dist[H-1][W-1]); if(dist[H-1][W-1] == INF) return "Odekakedekinai.."; return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }