Submission #11370158
Source Code Expand
#include <bits/stdc++.h> using namespace std; int R,C; char c[51][51]; int check[51][51]; void search(int x,int y,int from){ if(c[x][y]=='#' || x>=R || x<0 || y>=C || y<0)return; if(from>R+C)return; if(check[x][y]>from)check[x][y]=from; search(x+1,y,from+1); search(x-1,y,from+1); search(x,y+1,from+1); search(x,y-1,from+1); } int main(){ int i,j; int sx,sy; int gx,gy; cin >> R >> C; cin >> sx >> sy; cin >> gx >> gy; for(i=0;i<R;i++)for(j=0;j<C;j++){cin >> c[i][j]; check[i][j]=1e9;} search(sx-1,sy-1,0); cout << check[gx-1][gy-1] << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 幅優先探索 |
User | takezo25 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 641 Byte |
Status | TLE |
Exec Time | 2103 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 | AC | 1 ms | 256 KB |
subtask0_sample02.txt | AC | 5 ms | 256 KB |
subtask0_sample03.txt | TLE | 2103 ms | 256 KB |
subtask1_01.txt | TLE | 2103 ms | 256 KB |
subtask1_02.txt | TLE | 2103 ms | 256 KB |
subtask1_03.txt | TLE | 2103 ms | 256 KB |
subtask1_04.txt | TLE | 2103 ms | 256 KB |
subtask1_05.txt | TLE | 2103 ms | 256 KB |
subtask1_06.txt | TLE | 2103 ms | 256 KB |
subtask1_07.txt | TLE | 2103 ms | 256 KB |
subtask1_08.txt | TLE | 2103 ms | 256 KB |
subtask1_09.txt | TLE | 2103 ms | 256 KB |
subtask1_10.txt | TLE | 2103 ms | 256 KB |
subtask1_11.txt | TLE | 2103 ms | 256 KB |
subtask1_12.txt | TLE | 2103 ms | 256 KB |
subtask1_13.txt | TLE | 2103 ms | 256 KB |
subtask1_14.txt | TLE | 2103 ms | 256 KB |
subtask1_15.txt | TLE | 2103 ms | 256 KB |
subtask1_16.txt | TLE | 2103 ms | 256 KB |
subtask1_17.txt | TLE | 2103 ms | 256 KB |
subtask1_18.txt | TLE | 2103 ms | 256 KB |
subtask1_19.txt | TLE | 2103 ms | 256 KB |
subtask1_20.txt | TLE | 2103 ms | 256 KB |
subtask1_21.txt | TLE | 2103 ms | 256 KB |
subtask1_22.txt | TLE | 2103 ms | 256 KB |