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-10 18:45:100
2015-10-10 18:43:450
2015-10-10 18:40:430
2015-10-10 18:39:110
2015-10-10 18:36:070
2015-10-10 18:34:540
2015-10-10 18:28:310
2015-10-01 22:38:3214
2015-10-01 22:36:2714
2015-10-01 22:35:46
Task:Tontti
Sender:Chatne
Submission time:2015-10-01 22:38:32
Language:C++
Status:READY
Score:14

Feedback

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

Test results

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

Code

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

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;
}

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;
}

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: TIME LIMIT EXCEEDED

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

correct output
9552040

view   save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
1536063

view   save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
288

view   save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
786

view   save

user output
(empty)

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
1763

view   save

user output
(empty)

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: TIME LIMIT EXCEEDED

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

correct output
120725884

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
1849

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
2665

view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
5587

view   save

user output
(empty)