Task: | Tontti |
Sender: | BigKappa |
Submission time: | 2015-10-11 18:35:45 +0300 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.14 s | 1 | details |
#2 | RUNTIME ERROR | 0.14 s | 1 | details |
#3 | RUNTIME ERROR | 0.15 s | 1 | details |
#4 | RUNTIME ERROR | 0.13 s | 1 | details |
#5 | RUNTIME ERROR | 0.15 s | 1 | details |
#6 | RUNTIME ERROR | 0.14 s | 2 | details |
#7 | RUNTIME ERROR | 0.17 s | 2 | details |
#8 | RUNTIME ERROR | 0.14 s | 2 | details |
#9 | RUNTIME ERROR | 0.12 s | 2 | details |
#10 | RUNTIME ERROR | 0.12 s | 2 | details |
#11 | RUNTIME ERROR | 0.14 s | 3 | details |
#12 | RUNTIME ERROR | 0.15 s | 3 | details |
#13 | RUNTIME ERROR | 0.15 s | 3 | details |
#14 | RUNTIME ERROR | 0.15 s | 3 | details |
#15 | RUNTIME ERROR | 0.12 s | 3 | details |
Code
#include <iostream> #include <string> #include <string.h> #include <algorithm> int** sumArray; bool* memeArray; int height; int width; int treesWanted; int out = 0; int countTrees(int x, int y, int s); int maxS; void search(int roiX1, int roiY1, int roiX2, int roiY2, int s); int main() { std::cin >> height >> width >> treesWanted >> std::ws; maxS = std::min(width - 1, height - 1); memeArray = new bool[(height+1)*(width+1)*(maxS+2)]; memset(memeArray, false, (height+1)*(width+1)*(maxS+2)*sizeof(bool*)); sumArray = new int*[height]; { std::string line; int currentRowSum = 0; for (int y = 0; y < height; y++) { sumArray[y] = new int[width]; memset(sumArray[y], 0, width*sizeof(sumArray[y])); std::getline(std::cin, line); currentRowSum = 0; for (int x = 0; x < width; x++) { if (line[x] == '*') { currentRowSum++; } sumArray[y][x] = sumArray[std::max(0, y - 1)][x] + currentRowSum; } } } search(0, 0, width - 1, height - 1, maxS); std::cout << out; //getchar(); return 0; } void search(int roiX1, int roiY1, int roiX2, int roiY2, int s) { int c; for (int y = roiY1; y <= roiY2 - s; y++) { for (int x = roiX1; x <= roiX2 - s; x++) { c = countTrees(x, y, s); //std::cout << c << std::endl; if (c > treesWanted && s > 0) search(x, y, x + s, y + s, s - 1); else if (c == treesWanted && !memeArray[(y+1)*width*height+(x+1)*height+maxS]) { //std::cout << "x: " << x << " y: " << y << " s: " << s << std::endl; memeArray[(y + 1)*width*height + (x + 1)*height + maxS] = true; out++; if (s > 0) { search(x, y, x + s, y + s, s - 1); } } } } } int countTrees(int x, int y, int s) { int trees = sumArray[y + s][x + s]; if (x != 0) trees -= sumArray[y + s][x - 1]; if (y != 0) trees -= sumArray[y - 1][x + s]; if (x != 0 && y != 0) trees += sumArray[y-1][x-1]; return trees; }
Test details
Test 1
Group: 1
Verdict: RUNTIME ERROR
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
(empty) |
Error:
code: malloc.c:2372: sysmalloc: Assertion `(old_top == (((mbinptr) (((char *) &((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd)))) && old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))+((2 *(sizeof(size_t))) - 1)) & ~((2 *(sizeof(size_t))) - 1))) && ((old_top)->size & 0x1) && ((unsigned long) old_end & pagemask) == 0)' failed.
Test 2
Group: 1
Verdict: RUNTIME ERROR
input |
---|
10 10 5 ********** ********** ********** ********** ... |
correct output |
---|
0 |
user output |
---|
(empty) |
Error:
code: malloc.c:2372: sysmalloc: Assertion `(old_top == (((mbinptr) (((char *) &((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd)))) && old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))+((2 *(sizeof(size_t))) - 1)) & ~((2 *(sizeof(size_t))) - 1))) && ((old_top)->size & 0x1) && ((unsigned long) old_end & pagemask) == 0)' failed.
Test 3
Group: 1
Verdict: RUNTIME ERROR
input |
---|
10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
correct output |
---|
4 |
user output |
---|
(empty) |
Error:
code: malloc.c:2372: sysmalloc: Assertion `(old_top == (((mbinptr) (((char *) &((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd)))) && old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))+((2 *(sizeof(size_t))) - 1)) & ~((2 *(sizeof(size_t))) - 1))) && ((old_top)->size & 0x1) && ((unsigned long) old_end & pagemask) == 0)' failed.
Test 4
Group: 1
Verdict: RUNTIME ERROR
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
(empty) |
Error:
code: malloc.c:2372: sysmalloc: Assertion `(old_top == (((mbinptr) (((char *) &((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd)))) && old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))+((2 *(sizeof(size_t))) - 1)) & ~((2 *(sizeof(size_t))) - 1))) && ((old_top)->size & 0x1) && ((unsigned long) old_end & pagemask) == 0)' failed.
Test 5
Group: 1
Verdict: RUNTIME ERROR
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
(empty) |
Error:
code: malloc.c:2372: sysmalloc: Assertion `(old_top == (((mbinptr) (((char *) &((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd)))) && old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))+((2 *(sizeof(size_t))) - 1)) & ~((2 *(sizeof(size_t))) - 1))) && ((old_top)->size & 0x1) && ((unsigned long) old_end & pagemask) == 0)' failed.
Test 6
Group: 2
Verdict: RUNTIME ERROR
input |
---|
500 500 1 ................................. |
correct output |
---|
9552040 |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: RUNTIME ERROR
input |
---|
500 500 5 ................................. |
correct output |
---|
1536063 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: RUNTIME ERROR
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
(empty) |
Test 9
Group: 2
Verdict: RUNTIME ERROR
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: RUNTIME ERROR
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
(empty) |
Test 11
Group: 3
Verdict: RUNTIME ERROR
input |
---|
2000 2000 1 ................................. |
correct output |
---|
489611392 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 12
Group: 3
Verdict: RUNTIME ERROR
input |
---|
2000 2000 5 ................................. |
correct output |
---|
120725884 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 13
Group: 3
Verdict: RUNTIME ERROR
input |
---|
2000 2000 400000 ..*..**.**.**.*.***...**.*..**... |
correct output |
---|
1849 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 14
Group: 3
Verdict: RUNTIME ERROR
input |
---|
2000 2000 200000 ***.*....*.*..*....**..*..*.*.... |
correct output |
---|
2665 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 15
Group: 3
Verdict: RUNTIME ERROR
input |
---|
2000 2000 80000 **.**...*.***.**....**.*....*.... |
correct output |
---|
5587 |
user output |
---|
(empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc