Submission #691259
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <list> #include <bitset> #include <cmath> #include <cstdio> #include <map> using namespace std; int field[51][51]; int main(){ int i, j, k, l, m, n,x,y; char c; int w,h; int sx,sy,gx,gy; cin >> h>>w; cin >> sy>>sx>>gy>>gx; for (y=1;y<=h;y++) for(x=1;x<=w;x++){ cin>>c; if (c!='.' && c!='#'){x--;continue;} field[x][y]=c=='#'?0:1; } queue<vector<int>> que; que.push(vector<int>{sx,sy,0}); while(!que.empty()){ vector<int> &v=que.front(); x=v[0];y=v[1];k=v[2]; que.pop(); if (x==gx && y==gy){ cout << k << endl; return 0; } if (field[x-1][y]) que.push(vector<int>{x-1,y,k+1}); if (field[x+1][y]) que.push(vector<int>{x+1,y,k+1}); if (field[x][y-1]) que.push(vector<int>{x,y-1,k+1}); if (field[x][y+1]) que.push(vector<int>{x,y+1,k+1}); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 幅優先探索 |
User | m_buyoh |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1159 Byte |
Status | TLE |
Exec Time | 2169 ms |
Memory | 716884 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 | 4 ms | 256 KB |
subtask0_sample02.txt | AC | 6 ms | 768 KB |
subtask0_sample03.txt | TLE | 2168 ms | 692840 KB |
subtask1_01.txt | TLE | 2148 ms | 497252 KB |
subtask1_02.txt | TLE | 2146 ms | 493540 KB |
subtask1_03.txt | TLE | 2153 ms | 525904 KB |
subtask1_04.txt | TLE | 2166 ms | 709096 KB |
subtask1_05.txt | TLE | 2165 ms | 701672 KB |
subtask1_06.txt | TLE | 2151 ms | 500580 KB |
subtask1_07.txt | TLE | 2155 ms | 540772 KB |
subtask1_08.txt | TLE | 2150 ms | 490084 KB |
subtask1_09.txt | TLE | 2155 ms | 594884 KB |
subtask1_10.txt | TLE | 2152 ms | 556492 KB |
subtask1_11.txt | TLE | 2163 ms | 673256 KB |
subtask1_12.txt | TLE | 2169 ms | 716884 KB |
subtask1_13.txt | TLE | 2159 ms | 641640 KB |
subtask1_14.txt | TLE | 2149 ms | 482660 KB |
subtask1_15.txt | TLE | 2160 ms | 609876 KB |
subtask1_16.txt | TLE | 2161 ms | 611964 KB |
subtask1_17.txt | TLE | 2160 ms | 641164 KB |
subtask1_18.txt | TLE | 2162 ms | 627668 KB |
subtask1_19.txt | TLE | 2145 ms | 483940 KB |
subtask1_20.txt | TLE | 2147 ms | 496100 KB |
subtask1_21.txt | TLE | 2152 ms | 505828 KB |
subtask1_22.txt | TLE | 2146 ms | 492900 KB |