Submission #4316462
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define MM 1000000000 #define MOD MM+7 #define MAX 10000 #define MAP 100 #define MAX_N 100000 #define Pair pair<int,int> int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, -1, 0, 1}; int dist[MAP][MAP]; int h[MAX_N]; int dp[MAX_N]; int R,C; Pair s, g; char c[MAP][MAP]; int bfs(){ queue<Pair> que; que.push(Pair(s.first-1,s.second-1)); for(int i = 0; i < R; i++){ for(int j = 0; j < C; j++){ dist[i][j] = MM; } } dist[s.first-1][s.second-1] = 0; while(que.size()){ Pair p = que.front(); que.pop(); for(int i = 0; i < 4; i++){ int ny = p.first + dy[i]; int nx = p.second + dx[i]; if(c[ny][nx] == '.' && dist[ny][nx] == MM){ que.push(Pair(ny,nx)); dist[ny][nx] = dist[p.first][p.second]+1; } } } return dist[g.first-1][g.second-1]; } int main(){ cin >> R >> C; cin >> s.first >> s.second; cin >> g.first >> g.second; for(int i = 0; i < R; i++){ for(int j = 0; j < C; j++){ cin >> c[i][j]; } } int ans = bfs(); cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | Kant |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1272 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 1 ms | 256 KB |
subtask0_sample02.txt | AC | 1 ms | 256 KB |
subtask0_sample03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | AC | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask1_20.txt | AC | 1 ms | 256 KB |
subtask1_21.txt | AC | 1 ms | 256 KB |
subtask1_22.txt | AC | 1 ms | 256 KB |