Hypyt

#include <bits/stdc++.h>
 
using namespace std;


int bfs(map<int, bitset<250>> table, int start, int end){
    bitset<250> visited;
    
    queue<pair<int, int>> q; // {current, move_count}
    q.push({start, 0});
    

    while (q.size() > 0){
        int current = q.front().first;
        int move_count = q.front().second;
        q.pop();
        
        if(current == end){
            return move_count;
        }
        
        visited.set(current);
        for(int c=0; c<250; c++){
            bitset<250> filter;
            filter.set(c);

            if(table[current][c] && (visited & filter).count() == 0){
                q.push({c, move_count+1});
                visited.set(c);
            }
        }
    }

    return -1;
}

int main() {
   
    int n, m, q;
    cin >> n >> m >> q;
   
    vector<vector<char>> grid(n, vector<char>(m, 0));
    
    map<int, bitset<250>> x_table;
    map<int, bitset<250>> y_table;
    
    for(int i=0; i < n; i++){
        for(int j=0; j < m; j++){
            cin >> grid[i][j];
        }
    }
    
    vector<bitset<250>> rows;
    for(int i=0; i < n; i++){
        bitset<250> row;
        for(int j=0; j < m; j++){
            if(grid[i][j] != '*' || false){
                row.set(j);
            }
        }
        rows.push_back(row);
    }
    for(int j=0; j < m; j++){
        bitset<250> r;
        for(int i=0; i < n; i++){
            if(rows[i][j]){
                r |= rows[i];
            }
        }
        x_table[j] = r;
    }
    
    vector<bitset<250>> columns;
    for(int j=0; j < m; j++){
        bitset<250> column;
        for(int i=0; i < n; i++){
            if(grid[i][j] != '*' || false){
                column.set(i);
            }
        }
        columns.push_back(column);
    }
    for(int i=0; i < n; i++){
        bitset<250> c;
        for(int j=0; j < m; j++){
            if(columns[j][i]){
                c |= columns[j];
            }
        }
        y_table[i] = c;
    }

    
    for(int i=0; i < q; i++){
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2;
 
        int x = bfs(x_table, x1-1, x2-1);
        int y = bfs(y_table, y1-1, y2-1);
 
        if(x == -1 || y == -1){
            cout << -1 << "\n";
        }
        else{
            cout << x+y << "\n";
        }
    }
 
    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: WRONG ANSWER

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: WRONG ANSWER

Test 7

Group: 2, 5

Verdict: WRONG ANSWER

Test 8

Group: 2, 5

Verdict: WRONG ANSWER

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: TIME LIMIT EXCEEDED

Test 25

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 5

Verdict: TIME LIMIT EXCEEDED