Submission #3772616
Source Code Expand
#include <bits/stdc++.h> using namespace std; int R,C; int S[2],G[2]; char Map[50][50]; int Num[50][50]; typedef pair<int,int> P; P p; int d[4][2] = {{1,0},{-1,0},{0,1},{0,-1}}; int solve(int i,int j){ Num[i][j] = 0; queue<P> que; que.push(P(i,j)); while(que.size()!=0){ p = que.front(); if(p.first==G[0] && p.second==G[1]) return Num[p.first][p.second]; que.pop(); for(int i=0;i<4;i++){ int x = p.first + d[i][0]; int y = p.second + d[i][1]; if(x>=0 && x<R && y>=0 && y<C && Num[x][y]==-1){ if(Map[x][y] == '.'){ que.push(P(x,y)); Num[x][y] = Num[p.first][p.second] + 1; } } } } } int main(){ cin >> R >> C; cin >> S[0] >> S[1] >> G[0] >> G[1]; for(int i=0;i<R;i++){ for(int j=0;j<C;j++){ cin >> Map[i][j]; Num[i][j] = -1; } } cout << solve(S[0],S[1]) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | youjo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1064 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
subtask0_sample02.txt | WA | 1 ms | 256 KB |
subtask0_sample03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 1 ms | 256 KB |
subtask1_10.txt | WA | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | WA | 1 ms | 256 KB |
subtask1_14.txt | WA | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | WA | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | WA | 1 ms | 256 KB |
subtask1_19.txt | WA | 1 ms | 256 KB |
subtask1_20.txt | WA | 1 ms | 256 KB |
subtask1_21.txt | WA | 1 ms | 256 KB |
subtask1_22.txt | WA | 1 ms | 256 KB |