Hypyt

input/code.cpp: In function 'int main()':
input/code.cpp:53:23: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   53 |     for (int i = 0; i < query_count; i++) {
      |                     ~~^~~~~~~~~~~~~

#include <iostream>
#include <unordered_map>
#include <string.h> // memset
#include <vector>



typedef unsigned char uchar;

// row/column
class Row {
public:
    std::vector<uchar> connected_columns;

    Row() {}

    void connect_with(uchar other_idx) {
        connected_columns.push_back(other_idx);
    }
};



unsigned short height, width;
unsigned int query_count;
int main() {
    Row rows[250];
    Row columns[250];

    std::cin >> height >> width >> query_count;

    for (int i = 0; i < width; i++) {
        columns[i] = Row();
    }

    for (int i = 0; i < height; i++) {
        Row row = Row();
        // <------
        
        char buf[251];
        std::cin >> buf;

        for (int j = 0; j < width; j++) {
            if (buf[j] == '.') {
                row.connect_with(j);
                columns[j].connect_with(i);
                //std::cout << "Connect row idx " << i << " to column idx " << j << std::endl;
            }
        }
        rows[i] = row;
    }

    for (int i = 0; i < query_count; i++) {
        bool available_rows[250], available_cols[250];
        unsigned short start_y, start_x, end_y, end_x;
        std::cin >> start_y >> start_x >> end_y >> end_x;
        start_y--; start_x--; end_y--; end_x--;

        if (start_x == end_x && start_y == end_y) {
            std::cout << "0\n";
            continue;
        }

        if (start_x == end_x || start_y == end_y) {
            std::cout << "1\n";
            continue;
        }

        memset(&available_rows, 0, 250);
        memset(&available_cols, 0, 250);

        bool just_added_rows[250];
        bool just_added_cols[250];

        available_cols[start_x] = true;
        available_rows[start_y] = true;
        
        memset(&just_added_rows, 0, 250);
        memset(&just_added_cols, 0, 250);

        just_added_cols[start_x] = true;
        just_added_rows[start_y] = true;
        
        for (int cost = 2;; cost++) {
            bool rows_to_add[250];
            bool cols_to_add[250];
            memset(&rows_to_add, 0, 250);
            memset(&cols_to_add, 0, 250);
        
            // set to false when modifying rows_to_add and cols_to_add, if no modifications are made then break out with -1
            bool no_solution = true;

            for (uchar row_idx = 0; row_idx < 250; row_idx++) {
                if (!just_added_rows[row_idx]) { continue; }
                
                //std::cout << "Row " << (int) row_idx << std::endl;
                just_added_rows[row_idx] = false;

                Row row = rows[row_idx];
                for (uchar col_idx : row.connected_columns) {
                    //std::cout << "Add col " << (int) col_idx << std::endl;
                    cols_to_add[col_idx] = true;
                    no_solution = false;
                }
            }

            for (uchar col_idx = 0; col_idx < 250; col_idx++) {
                if (!just_added_cols[col_idx]) { continue; }

                //std::cout << "Col " << (int) col_idx << std::endl;
                just_added_cols[col_idx] = false;

                Row col = columns[col_idx];
                for (uchar row_idx : col.connected_columns) {
                    //std::cout << "Add row " << (int) row_idx << std::endl;
                    rows_to_add[row_idx] = true;
                    no_solution = false;
                }
            }

            if (no_solution) { std::cout << -1 << '\n'; goto complete; }


            if (rows_to_add[end_y] || cols_to_add[end_x]) { std::cout << cost << '\n'; goto complete; }
            for (uchar idx = 0; idx < 250; idx++) {
                if (rows_to_add[idx]) {
                    rows_to_add[idx] = false;

                    if (!available_rows[idx]) {
                        available_rows[idx] = true;
                        just_added_rows[idx] = true;
                    }
                    
                    //if (idx == end_y) { std::cout << cost << '\n'; goto complete; }
                }

                if (cols_to_add[idx]) {
                    cols_to_add[idx] = false;

                    if (!available_cols[idx]) {
                        available_rows[idx] = true;
                        just_added_cols[idx] = true;
                    }

                    //if (idx == end_x) { std::cout << cost << '\n'; goto complete; }
                }
            }
        }
complete:
        continue;
    }




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

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: ACCEPTED

Test 10

Group: 3, 4, 5

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5

Verdict: ACCEPTED

Test 12

Group: 4, 5

Verdict: ACCEPTED

Test 13

Group: 4, 5

Verdict: ACCEPTED

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: ACCEPTED

Test 27

Group: 5

Verdict: ACCEPTED