Help in a problem - - Codeforces

aryan_cp's blog

Help in a problem -

By aryan_cp, history, 6 years ago, In English

Hello CodeForces can any body help me as to how to solve this problem? link : Problem Link I wanted help in Problem B — Horse Routes (when translated in English ) Thanks!

#help, #newbie, #problem solving, #help me

aryan_cp
6 years ago
6

Comments (4)

Show archived | Write comment?

Makise_Kurisu

6 years ago, hide # |

Hey just do the usual bfs on the grid that should be good. I got that accepted check out the code for assistance there's nothing much to explain, it's quiet neat.

AC_CODE

#include <bits/stdc++.h>
#define ar array 
using namespace std;
const int di[4]={1,-1,2,-2},dj[4]={2,2,-1,-1} ;
int n, d[101][101];
bool e(int i,int j){
  return(i>=0&&j>=0&&i<n&&j<n&&d[i][j]==-1);  
}
signed main() {
  cin >> n ;
  memset(d,-1,sizeof(d)) ;
  queue<ar<int,2>>qu ; 
  qu.push({0,0})  ;d[0][0]=0;
  while(qu.size()){
    ar<int,2> u = qu.front() ;
    qu.pop() ;
    for(int k=0;k<4;k++){
      int ni = u[0]+ di[k],nj= u[1]+dj[k] ;
      if(!e(ni,nj))
        continue ;
      qu.push({ni,nj}) ;
      d[ni][nj] = d[u[0]][u[1]]+1 ;
    }
    for(int k=0;k<4;k++){
      int ni = u[0]+ di[k],nj= u[1]-dj[k] ;
      if(!e(ni,nj))
        continue ;
      qu.push({ni,nj}) ;
      d[ni][nj] = d[u[0]][u[1]]+1 ;
    }
  }
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++)
      cout << d[i][j] << ' ' ;
    cout << '\n' ;
  }
}

→ Reply

aryan_cp

6 years ago, hide # ^ |

Thanks! For your help , Its my mistake I forgot to mention in the blog I wanted ython. Solution? I am new to competitive programming and I have no knowledge in BFS could you please suggest some links to study? Thanks!

→ Reply