CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Chatne
Submission time:2015-10-01 22:38:32 +0300
Language:C++
Status:READY
Result:14
Feedback
groupverdictscore
#1ACCEPTED14
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6--2details
#7--2details
#8--2details
#9--2details
#10--2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

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
......*...
.......*..
*..*....*.
*....*....
...

correct output
94

user output
94

Test 2

Group: 1

Verdict: ACCEPTED

input
10 10 5
**********
**********
**********
**********
...

correct output
0

user output
0

Test 3

Group: 1

Verdict: ACCEPTED

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...

correct output
4

user output
4

Test 4

Group: 1

Verdict: ACCEPTED

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...

correct output
16

user output
16

Test 5

Group: 1

Verdict: ACCEPTED

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...

correct output
30

user output
30

Test 6

Group: 2

Verdict:

input
500 500 1
.................................

correct output
9552040

user output
(empty)

Test 7

Group: 2

Verdict:

input
500 500 5
.................................

correct output
1536063

user output
(empty)

Test 8

Group: 2

Verdict:

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....

correct output
288

user output
(empty)

Test 9

Group: 2

Verdict:

input
500 500 12500
**.**.*..*...*.**...*.***........

correct output
786

user output
(empty)

Test 10

Group: 2

Verdict:

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....

correct output
1763

user output
(empty)

Test 11

Group: 3

Verdict:

input
2000 2000 1
.................................

correct output
489611392

user output
(empty)

Test 12

Group: 3

Verdict:

input
2000 2000 5
.................................

correct output
120725884

user output
(empty)

Test 13

Group: 3

Verdict:

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...

correct output
1849

user output
(empty)

Test 14

Group: 3

Verdict:

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....

correct output
2665

user output
(empty)

Test 15

Group: 3

Verdict:

input
2000 2000 80000
**.**...*.***.**....**.*....*....

correct output
5587

user output
(empty)