Submission #3884873


Source Code Expand

#include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const array<pair<int,int>,4> fd{make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)}; 
//ll
int r,c,sy,sx,gy,gx;
bool m[52][52];int an[52][52];
queue<pair<int,int>> q;

void bfs(){
  while(!q.empty()){
    pair<int,int> t = q.front();q.pop();
    m[t.first][t.second] = false;
    rep(i,4){
      if(!m[t.first + fd[i].first][t.second + fd[i].second])continue;
      an[t.first + fd[i].first][t.second + fd[i].second] = an[t.first][t.second] + 1;
      q.push(make_pair(t.first + fd[i].first, t.second + fd[i].second));
    }
  }
}

int main(){
  cin>>r>>c>>sy>>sx>>gy>>gx;
  rep(i,52)rep(j,52)m[i][j] = false;
  repd(i,1,r+1)repd(j,1,c+1){
    char a;cin>>a;
    if(a == '.')m[j][i] = true;
  }
  q.push(make_pair(sx,sy));
  bfs();
  cout << an[gx][gy];
}

Submission Info

Submission Time
Task C - 幅優先探索
User okitz
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1027 Byte
Status WA
Exec Time 2146 ms
Memory 713680 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 2
TLE × 1
WA × 14
TLE × 11
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 TLE 2146 ms 710720 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 TLE 2145 ms 711384 KB
subtask1_05.txt TLE 2146 ms 713680 KB
subtask1_06.txt TLE 2120 ms 294808 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt TLE 2124 ms 355380 KB
subtask1_10.txt WA 2 ms 256 KB
subtask1_11.txt TLE 2145 ms 709500 KB
subtask1_12.txt TLE 2141 ms 631200 KB
subtask1_13.txt WA 80 ms 2892 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt TLE 2112 ms 144648 KB
subtask1_16.txt WA 407 ms 23340 KB
subtask1_17.txt TLE 2133 ms 493528 KB
subtask1_18.txt TLE 2123 ms 332116 KB
subtask1_19.txt WA 1 ms 256 KB
subtask1_20.txt WA 2 ms 256 KB
subtask1_21.txt TLE 2141 ms 634568 KB
subtask1_22.txt WA 3 ms 384 KB