Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-11 23:57:5447
2015-10-11 23:55:1047
2015-10-11 23:52:4247
2015-10-11 23:06:3747
2015-10-11 22:52:3447
2015-10-11 22:15:1847
2015-10-11 21:58:2647
2015-10-11 21:31:3347
2015-10-11 20:41:3547
2015-10-11 19:20:0447
2015-10-11 19:19:34
2015-10-11 19:17:140
2015-10-11 18:43:3447
2015-10-05 00:03:1614
2015-10-04 23:29:0814
2015-10-04 23:02:570
2015-10-02 01:14:3814
2015-10-01 18:34:0914
2015-10-01 18:20:4214
2015-10-01 17:43:100
2015-10-01 17:29:300
2015-09-28 17:36:400
Task:Tontti
Sender:rxz9000
Submission time:2015-10-11 23:57:54
Language:C++
Status:READY
Score:47

Feedback

groupverdictscore
#1ACCEPTED14
#2ACCEPTED33
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.05 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.06 / 1.001details
#5ACCEPTED0.06 / 1.001details
#6ACCEPTED0.07 / 1.002details
#7ACCEPTED0.06 / 1.002details
#8ACCEPTED0.07 / 1.002details
#9ACCEPTED0.06 / 1.002details
#10ACCEPTED0.06 / 1.002details
#11TIME LIMIT EXCEEDED-- / 1.003details
#12ACCEPTED0.46 / 1.003details
#13ACCEPTED0.20 / 1.003details
#14ACCEPTED0.22 / 1.003details
#15ACCEPTED0.24 / 1.003details

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
	ios::sync_with_stdio(false);

	int height;
	cin >> height;

	int width;
	cin >> width;

	int idealAmountOfTrees;
	cin >> idealAmountOfTrees;

	vector<string> forest;
	forest.resize(height);

	for (int i = 0; i < height; i++) {
		cin >> forest[i];
	}

	vector<vector<int> > sums;
	sums.resize(height + 1);
	for (int i = 0; i <= height; i++) {
		sums[i].resize(width + 1);
	}

	for (int i = 0; i <= height; i++) {
		sums[i][0] = 0;
	}

	for (int j = 1; j <= width; j++) {
		sums[0][j] = 0;
	}

	int amountOfTrees = 0;
	for (int i = 1; i <= height; i++) {
		for (int j = 1; j <= width; j++) {
			sums[i][j] = sums[i - 1][j] - sums[i - 1][j - 1] + sums[i][j - 1];
			if (forest[i - 1].at(j - 1) == '*') {
				sums[i][j]++;
				amountOfTrees++;
			}
		}
	}

	if (amountOfTrees < idealAmountOfTrees) {
		cout << "0" << endl;
	}
	else {

		int waysOfChoosing = 0;
		const int firstMSL = (int)ceil(sqrt(idealAmountOfTrees));

		for (int i = 0; i < height; i++) {
			int previousSidelength = 0;
			for (int j = 0; j < width; j++) {
				int minSl = firstMSL;
				int maxSl = min(height - i, width - j);
				int midSl;
				bool first = true;

				while (minSl <= maxSl) {
					if (first && previousSidelength != 0 && previousSidelength <= maxSl) {
						midSl = previousSidelength;
						first = false;
					}
					else {
						midSl = (minSl + maxSl) / 2;
					}
					int treesInSquare = sums[i + midSl][j + midSl] - sums[i + midSl][j] - sums[i][j + midSl] + sums[i][j];
					if (treesInSquare == idealAmountOfTrees) {
						previousSidelength = midSl;
						waysOfChoosing++;
						int l1 = midSl - 1;
						while (l1 >= minSl && (sums[i + l1][j + l1] - sums[i + l1][j] - sums[i][j + l1] + sums[i][j]) == idealAmountOfTrees) {
							waysOfChoosing++;
							l1--;
						}
						int l2 = midSl + 1;
						while (l2 <= maxSl && (sums[i + l2][j + l2] - sums[i + l2][j] - sums[i][j + l2] + sums[i][j]) == idealAmountOfTrees) {
							waysOfChoosing++;
							l2++;
						}
						break;
					}
					else if (treesInSquare < idealAmountOfTrees) {
						minSl = midSl + 1;
					}
					else {
						maxSl = midSl - 1;
					}
				}
			}
		}

		cout << waysOfChoosing << endl;

	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...
view   save

correct output
94

view   save

user output
94

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10 5
**********
**********
**********
**********
...
view   save

correct output
0

view   save

user output
0

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...
view   save

correct output
4

view   save

user output
4

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...
view   save

correct output
16

view   save

user output
16

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...
view   save

correct output
30

view   save

user output
30

view   save

Test 6

Group: 2

Verdict: ACCEPTED

input
500 500 1
.................................
view   save

correct output
9552040

view   save

user output
9552040

view   save

Test 7

Group: 2

Verdict: ACCEPTED

input
500 500 5
.................................
view   save

correct output
1536063

view   save

user output
1536063

view   save

Test 8

Group: 2

Verdict: ACCEPTED

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....
view   save

correct output
288

view   save

user output
288

view   save

Test 9

Group: 2

Verdict: ACCEPTED

input
500 500 12500
**.**.*..*...*.**...*.***........
view   save

correct output
786

view   save

user output
786

view   save

Test 10

Group: 2

Verdict: ACCEPTED

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....
view   save

correct output
1763

view   save

user output
1763

view   save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 1
.................................
view   save

correct output
489611392

view   save

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
2000 2000 5
.................................
view   save

correct output
120725884

view   save

user output
120725884

view   save

Test 13

Group: 3

Verdict: ACCEPTED

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...
view   save

correct output
1849

view   save

user output
1849

view   save

Test 14

Group: 3

Verdict: ACCEPTED

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....
view   save

correct output
2665

view   save

user output
2665

view   save

Test 15

Group: 3

Verdict: ACCEPTED

input
2000 2000 80000
**.**...*.***.**....**.*....*....
view   save

correct output
5587

view   save

user output
5587

view   save