CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Chatne
Submission time:2015-10-01 22:35:46
Language:C++
Status:COMPILE ERROR

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:34:27: error: 'sqrt' was not declared in this scope
  dlim = (int)ceil(sqrt(trc));
                           ^
input/code.cpp:34:28: error: 'ceil' was not declared in this scope
  dlim = (int)ceil(sqrt(trc));
                            ^
input/code.cpp:56:17: warning: ignoring return value of 'int system(const char*)', declared with attribute warn_unused_result [-Wunused-result]
  system("pause");
                 ^

Code

#include <iostream>
#include <string>
#include <vector>

using namespace std;

vector<vector<int>> forest;
int dlim, ulim;

int main() {

	cin.sync_with_stdio(false);

	int forh, forw, trc; cin >> forh >> forw >> trc;

	forest = vector<vector<int> >(forw, vector<int>(forh));

	int treecorner(int sx, int sy, int lvl);

	for (int i = 0; i < forh; i++) {
		string rw; cin >> rw;
		for (int j = 0; j < forw; j++) {
			if (rw[j] == '*') {
				forest[j][i] = 1;
			}
		}
	}

	//for (int i = 0; i < forh; i++) {
	//	cout << endl;
	//	for (int j = 0; j < forw; j++) cout << forest[j][i] << " ";
	//}

	dlim = (int)ceil(sqrt(trc));
	ulim = (forh > forw) ? forh : forw;

	int retcount = 0;
	
	for (int j = 0; j <= forw - dlim; j++) {
		for (int k = 0; k <= forh - dlim; k++) {
			int areacount = 0;
			for (int i = dlim; i <= ((forw - j < forh - k) ? forw - j : forh - k); i++) {
				areacount += treecorner(j, k, i);
				if (areacount > trc) {
					break;
				}
				if (areacount == trc) {
					retcount++;
				}
				
			}
		}
	}

	cout << retcount;
	system("pause");
}

int treecorner(int sx, int sy, int lvl) {
	int retval = 0;
	if (lvl == dlim) {
		for (int i = 0; i < dlim; i++) {
			for (int j = 0; j < dlim; j++) {
				if (forest[sx + i][sy + j] == 1) {
					retval++;
				}
			}
		}
	}
	else {
		for (int i = 0; i < lvl - 1; i++) {
			if (forest[sx + i][sy + lvl - 1] == 1) {
				retval++;
			}
		}
		if (forest[sx + lvl - 1][sy + lvl - 1] == 1) {
			retval++;
		}
		for (int i = 0; i < lvl - 1; i++) {
			if (forest[sx + lvl - 1][sy + i] == 1) {
				retval++;
			}
		}
	}
	return retval;
}