Hypyt

input/code.cpp: In function 'void setIO(std::string)':
input/code.cpp:9:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |                 freopen((name+".in").c_str(), "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:10:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |                 freopen((name+".out").c_str(), "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int bfs(int, int, int, int)':
input/code.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
   56 | }
      | ^

#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
void setIO(string name="") {
	if(name.length()) {
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << "\n"
#define ar array
#define fi first
#define se second
 
const int mxN=251;
int n, m, q;
char grid[mxN][mxN];
vector<int> adj[mxN][2]; // 0 for rows, 1 for columns
bool rowVis[mxN], colVis[mxN];
 
int bfs(int sx, int sy, int ex, int ey) {
	queue<ar<int, 3>> q;
	memset(rowVis, 0, sizeof(rowVis));
	memset(colVis, 0, sizeof(colVis));
	q.push({sx, sy, 0});
	while(q.size()) {
		int x=q.front()[0], y=q.front()[1], d=q.front()[2];
		q.pop();
		if(x==ex && y==ey)
			return d;
		if(!rowVis[x]) {
			for(int a:adj[x][0]) {
				q.push({x, a, d+1});
			}
			rowVis[x]=1;
		}
		if(!colVis[y]) {
			for(int a:adj[y][1]) {
				q.push({a, y, d+1});
			}
			colVis[y]=1;
		}
	}
}
 
void solve() {
	cin >> n >> m >> q;
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=m; j++) {
			cin >> grid[i][j];
			if(grid[i][j]=='.') {
				adj[i][0].pb(j);
			}
		}
	}
	for(int j=1; j<=m; j++) {
		for(int i=1; i<=n; i++) {
			if(grid[i][j]=='.') adj[j][1].pb(i);
		}
	}
	for(int i=0; i<q; i++) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if((adj[x1][0].size()==1 && adj[y1][1].size()==1) || (adj[x2][0].size()==1 && adj[y2][1].size()==1)) {
			cout << "-1\n"; 
		} else {
			cout << bfs(x1, y1, x2, y2) << "\n";
		}
	}
}
 
int main() {
	cin.tie(0) -> sync_with_stdio(0);
	//setIO("sleepy");
	int T=1;
	//cin >> T;
	while(T--)
		solve();
	return 0;
}

Test 1 (public)

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 6

Group: 2, 5

Verdict: ACCEPTED

Test 7

Group: 2, 5

Verdict: ACCEPTED

Test 8

Group: 2, 5

Verdict: ACCEPTED

Test 9

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 23

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 24

Group: 5

Verdict: ACCEPTED

Test 25

Group: 5

Verdict: ACCEPTED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: WRONG ANSWER