Tontti

input/code.cpp: In function 'int main()':
input/code.cpp:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int i = 0; i < height; ++i )
                     ^
input/code.cpp:48:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for ( int j = 0; j < width; ++j )
                      ^
input/code.cpp:56:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int i = 0; i < height; ++i )
                     ^
input/code.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for ( int j = 0; j < width; ++j )
                      ^
input/code.cpp:68:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if ( ( width - j ) < maxSize )
                        ^
input/code.cpp:90:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      i...

#include <iostream>
#include <string>

int main()
{
	std::ios_base::sync_with_stdio( false );

	std::string input;

	std::getline( std::cin, input );

	unsigned long width = 0;
	unsigned long height = 0;
	unsigned long trees = 0;

	unsigned long long index = 0;
	unsigned long long cursor = 0;

	for ( unsigned long long i = 0; i < input.length(); ++i )
	{
		if ( input[ i ] == ' ' )
		{
			if ( index == 0 )
			{
				height = atoi( input.substr( cursor, i - cursor ).c_str() );
			}
			else if ( index == 1 )
			{
				width = atoi( input.substr( cursor, i - cursor ).c_str() );
			}
			
			index++;
			cursor = i + 1;
		}
	}

	trees = atoi( input.substr( cursor, input.npos ).c_str() );

	bool** forest = new bool*[ height ];

	for ( int i = 0; i < height; ++i )
	{
		std::string line;
		std::getline( std::cin, line );

		forest[ i ] = new bool[ width ];

		for ( int j = 0; j < width; ++j )
		{
			forest[ i ][ j ] = line[ j ] == '*';
		}
	}

	unsigned long result = 0;

	for ( int i = 0; i < height; ++i )
	{
		for ( int j = 0; j < width; ++j )
		{
			if ( trees == 1 && forest[ i ][ j ] )
			{
				result++;
			}
			else if ( trees > 1 )
			{
				int maxSize = height - i;
				
				if ( ( width - j ) < maxSize )
				{
					maxSize = width - j;
				}

			    int size = 2;

				while ( size <= maxSize )
				{
					int treesFound = 0;

					for ( int y = i; y < i + size; ++y )
					{
						for ( int x = j; x < j + size; ++x )
						{
							if ( forest[ y ][ x ] )
							{
								treesFound++;
							}
						}
					}

					if ( treesFound == trees )
					{
						result++;
					}

					size++;
				}
			}
		}
	}

	std::cout << result << "\n";
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED