Submission #4137311
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define MOD 1000000007 #define BIG 1000000010 #define repi(i,x,n) for(int i=x;i<n;i++) #define rep(i,n) repi(i,0,n) #define repn(i,n) for(int i=n;i>=0;i--) typedef long long int ll; struct xy{ int x,y; }; int main(){ int r,c; xy s,g,t; int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0}; char mp[50][50];int mmp[50][50]; for(int i=0;i<50;i++){ for(int j=0;j<50;j++){ mmp[i][j]=BIG; } } cin>>r>>c; cin>>s.y>>s.x>>g.y>>g.x; for(int i=0;i<r;i++){ for(int j=0;j<c;j++){ cin>>mp[i][j]; } } s.x--;s.y--;g.x--;g.y--; mmp[s.y][s.x]=0; queue<xy> q; q.push(s); while(!q.empty()){ xy p=q.front(); q.pop(); for(int i=0;i<4;i++){ if(mmp[p.y + dy[i]][p.x + dx[i]]==BIG && mp[p.y + dy[i]][p.x + dx[i]]=='.'){ mmp[p.y + dy[i]][p.x + dx[i]]=mmp[p.y][p.x]+1; t.y=p.y+dy[i];t.x=p.x+dx[i]; q.push(t); } } } /*for(int i=0;i<r;i++){ for(int j=0;j<c;j++){ cout<<mmp[i][j]<<" "; } cout<<endl; }*/ cout<<mmp[g.y][g.x]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | cr0p |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1123 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 |