Search found 1 match

by Ridowan_Ahmed
Thu Nov 10, 2016 4:59 am
Forum: Volume 2 (200-299)
Topic: 260 - Il Gioco dell'X
Replies: 19
Views: 9434

Re: 260 - Il Gioco dell'X

My code pass all the test cases in udebug but I'm getting WA. I've use simple bfs to find the path from row 1 to row N
#include<bits/stdc++.h>
using namespace std ;
#define MAX 202
char grid[MAX][MAX] ;
bool vis[MAX][MAX] ;
int fx[]={-1,-1,+0,+0,+1,+1};
int fy[]={-1,+0,-1,+1,+0,+1};
int dir = 6 ...

Go to advanced search