Ruudukko

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <array>

int main(void)
{
	int n, m;
	std::cin >> n >> m;
	std::cin.ignore();

	std::vector<std::array<int, 4>> subs(m);

	for (auto& sub : subs)
	{
		std::cin >> sub[0] >> sub[1] >> sub[2] >> sub[3];
		sub[0]--;
		sub[1]--;
		sub[2]--;
		sub[3]--;
	}
	std::sort(subs.begin(), subs.end());
	std::string ruudukko;
	ruudukko.reserve(n * n + n);

	for (int i = 0; i < n * n; ++i)
	{
		int vaihdot = 0;
		for (const auto& sub : subs)
		{
			int y = i / n;
			int x = i % n;

			if (y < sub[0])
				break;
			if (x < sub[1])
				break;
			if (y > sub[2])
				continue;
			if (x > sub[3])
				continue;
			vaihdot++;
		}
		if (i % n == 0 && i != 0)
			ruudukko += '\n';
		if (vaihdot % 2 == 0)
			ruudukko += '.';
		else
			ruudukko += '#';
	}
	std::cout << ruudukko << std::endl;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: WRONG ANSWER

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED