## Editorial for DMOPC '17 Contest 1 P1 - Fujō Neko

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

For the first subtask, we can loop through the column and row and check if there's an X.

Time Complexity:

For the second subtask, we can preprocess the grid and create two arrays, and . Let be true if there is an X on column and be true if there is an X on row . To answer each query, we just check if or is true.

Time Complexity: