CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	OorigamiK
Submission time:	2024-11-04 23:01:08 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	RUNTIME ERROR	0
#4	RUNTIME ERROR	0
#5	RUNTIME ERROR	0
#6	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.00 s	1, 3, 4, 5, 6	details
#2	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#3	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#4	RUNTIME ERROR	0.00 s	1, 4, 5, 6	details
#5	RUNTIME ERROR	0.00 s	2, 5, 6	details
#6	RUNTIME ERROR	0.00 s	2, 5, 6	details
#7	RUNTIME ERROR	0.00 s	3, 5, 6	details
#8	RUNTIME ERROR	0.00 s	3, 5, 6	details
#9	RUNTIME ERROR	0.00 s	3, 5, 6	details
#10	RUNTIME ERROR	0.00 s	3, 5, 6	details
#11	RUNTIME ERROR	0.00 s	3, 5, 6	details
#12	RUNTIME ERROR	0.01 s	4, 5, 6	details
#13	RUNTIME ERROR	0.01 s	4, 5, 6	details
#14	RUNTIME ERROR	0.00 s	4, 5, 6	details
#15	RUNTIME ERROR	0.01 s	4, 5, 6	details
#16	RUNTIME ERROR	0.01 s	5, 6	details
#17	RUNTIME ERROR	0.00 s	5, 6	details
#18	RUNTIME ERROR	0.05 s	5, 6	details
#19	RUNTIME ERROR	0.00 s	5, 6	details
#20	RUNTIME ERROR	0.04 s	6	details
#21	RUNTIME ERROR	0.01 s	6	details
#22	RUNTIME ERROR	0.04 s	6	details

Compiler report

input/code.cpp: In function 'bool recArea(int, int, int, int, int, std::vector<std::vector<std::vector<int> > >&)':
input/code.cpp:6:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int color = 0; color < flowerSums.size(); color++) {
      |                         ~~~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:77:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int color = 0; color < flowerSums.size(); color++) {
      |                         ~~~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:92:17: warning: variable 'step1' set but not used [-Wunused-but-set-variable]
   92 |             int step1 = 0;
      |                 ^~~~~

Code

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

bool recArea(int n, int x1, int x2, int y1, int y2, std::vector<std::vector<std::vector<int>>>& flowerSums) {
    for (int color = 0; color < flowerSums.size(); color++) {
        int sum = 0;
        sum += flowerSums[color][x2][y2];
        if (x1 > 0) {
            if (y1 > 0) {
                sum += flowerSums[color][x1 - 1][y1-1];
            }
            sum -= flowerSums[color][x1-1][y2];
        }
        if (y1 > 0) {
            sum -= flowerSums[color][x2][y1-1];
        
        }
        if (sum <= 0) {
            return false;
        }
     }
    return true;
}

int main()
{
    std::vector<std::string> flowers;
    int n;
    //n = 200;
    std::cin >> n;
    for (int i = 0; i < n; i++) {
        std::string s;
        std::cin >> s;
        //s = "AAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBB";
        flowers.push_back(s);
    }
    std::vector<bool> theFlowers;
    for (int i = 0; i < 26; i++) {
        theFlowers.push_back(false);
    }
    for (std::string s : flowers) {
        for (int i = 0; i < n; i++) {
            int k = int(s[i]) - int('A');
            theFlowers[k] = true;
        }
    }
    std::vector<std::vector<std::vector<int>>> flowerSums;
    int y = 0;
    for (int j = 0; j < 26; j++) {
        if (theFlowers[j]) {
            flowerSums.push_back({});
            for (int i = 0; i < n; i++) {
                flowerSums[y].push_back({});
                for (int k = 0; k < n; k++) {
                    flowerSums[y][i].push_back(0);

                }
            }
            y++;
        }
    }

    y = 0;
    for (int color = 0; color < 26; color++) {
        if (theFlowers[color]) {
            for (int k = 0; k < n; k++) {
                for (int t = 0; t < n; t++) {
                    if (int(flowers[k][t]) - int('A') == color) {
                        flowerSums[y][k][t]++;
                    }
                }
            }
            y++;
        }
    }
    for (int color = 0; color < flowerSums.size(); color++) {
        for (int i = 1; i < n; i++) {
            for (int j = 0; j < n; j++) {
                flowerSums[color][i][j] += flowerSums[color][i - 1][j];
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 1; j < n; j++) {
                flowerSums[color][i][j] += flowerSums[color][i][j - 1];
            }
        }
    }
    int numOfRec = 0;
    for (int x1 = 0; x1 < n; x1++) {
        for (int x2 = x1; x2 < n; x2++) {
            int step1 = 0;
            int y1 = 0;
            //std::cout << "hi" << std::endl;
            while (y1 < n) {
                int ceiling2 = n - 1;
                int flooring2 = y1;
                int step2 = (ceiling2 + flooring2) / 2;
                while (ceiling2 - flooring2 > 1) {
                    if (recArea(n, x1, x2, y1, step2, flowerSums)) {
                        ceiling2 = (ceiling2 + flooring2) / 2 + (ceiling2 + flooring2) % 2;
                    }
                    else {
                        flooring2 = (ceiling2 + flooring2) / 2;
                    }
                    step2 = (ceiling2 + flooring2) / 2;

                }
                if (recArea(n, x1, x2, y1, flooring2, flowerSums)) {
                    step2 = flooring2;
                }
                else if (recArea(n, x1, x2, y1, ceiling2, flowerSums)) {
                    step2 = ceiling2;
                }
                else {
                    step2 = n;
                }
                step1 = y1;
                int ceiling1 = step2;
                int flooring1 = y1;
                int step1 = (ceiling1 + flooring1) / 2;
                while (ceiling1 - flooring1 > 1) {
                    if (recArea(n, x1, x2, step1, step2, flowerSums)) {
                        flooring1 = (ceiling1 + flooring1) / 2;
                    }
                    else {
                        ceiling1 = (ceiling1 + flooring1) / 2 + (ceiling1 + flooring1) % 2;
                    }
                    step1 = (ceiling1 + flooring1) / 2;

                }
                if (recArea(n, x1, x2, flooring1, step2, flowerSums)) {
                   step1 = ceiling1;
                }
                else if (recArea(n, x1, x2, ceiling1, step2, flowerSums)) {
                    step1 = flooring1;
                }
                else {
                    step1 = n;
                }
                numOfRec += (1 + step1 - y1) * (n - step2);
                //std::cout << 1 + step1 - y1 << " " << n - step2<<" "<<x1<<" "<<x2<<" "<< (1 + step1 - y1) * (n - step2)<<" "<<y1<<" "<<step1<<" "<<step2 << std::endl;
                y1 = step1+1;
            }
           /*
                
                
                
                for (int y1 = 0; y1 < n; y1++) {
                if (recArea(n, x1, x2, y1, step, flowerSums)) {
                    numOfRec += n - step;
                }
                else {
                    int ceiling = n - 1;
                    int flooring = step;
                    int step = (ceiling + flooring) / 2;
                    while (ceiling - flooring > 1) {
                        if (recArea(n, x1, x2, y1, step, flowerSums)) {
                            ceiling = (ceiling + flooring) / 2 + (ceiling + flooring) % 2;
                        }
                        else {
                            flooring = (ceiling + flooring) / 2;
                        }
                        step = (ceiling + flooring) / 2;

                    }
                    if (recArea(n, x1, x2, y1, flooring, flowerSums)) {
                        step = flooring;
                    }
                    else if (recArea(n, x1, x2, y1, ceiling, flowerSums)) {
                        step = ceiling;
                    }
                    else {
                        step = n;
                    }
                    numOfRec += n - step;
                }
            }*/
        }
    }
    std::cout << numOfRec << std::endl;
}

Test details

Test 1

Group: 1, 3, 4, 5, 6

Verdict: RUNTIME ERROR

input
`1 1 6` view save

correct output
`0` view save

user output
`1` view save

Error:

double free or corruption (out)

Test 2

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 4 8 6 2 7` view save

correct output
`5 4 2 2 2 1 1 1 1 1` view save

user output
`225` view save

Error:

double free or corruption (out)

Test 3

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 5 5 8 6 7` view save

correct output
`3 3 2 3 2 2 1 1 1 2` view save

user output
`225` view save

Error:

double free or corruption (out)

Test 4

Group: 1, 4, 5, 6

Verdict: RUNTIME ERROR

input
`5 10 8 7 9 6 10` view save

correct output
`4 4 3 3 2 2 1 2 2 1` view save

user output
`225` view save

Error:

double free or corruption (out)

Test 5

Group: 2, 5, 6

Verdict: RUNTIME ERROR

input
`1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 6

Group: 2, 5, 6

Verdict: RUNTIME ERROR

input
`1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
(empty)

Test 7

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 15 710 210 347 398 66 318 277 ...` view save

correct output
`994 994` view save

user output
(empty)

Test 8

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 743 890 592 942 736 969 616 50...` view save

correct output
`498 496` view save

user output
(empty)

Test 9

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 987 968 920 994 988 918 914 95...` view save

correct output
`500 500` view save

user output
(empty)

Test 10

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 996 1000 998 998 999 997 997 9...` view save

correct output
`500 500` view save

user output
(empty)

Test 11

Group: 3, 5, 6

Verdict: RUNTIME ERROR

input
`1000 2 501 501 501 501 501 501 501 50...` view save

correct output
`1 168` view save

user output
(empty)

Test 12

Group: 4, 5, 6

Verdict: RUNTIME ERROR

input
`100 200 145 136 74 83 73 36 196 115 11...` view save

correct output
`194 190 189 183 182 181 181 17...` view save

user output
`0` view save

Error:

double free or corruption (out)

Test 13

Group: 4, 5, 6

Verdict: RUNTIME ERROR

input
`100 200 157 110 168 155 192 107 146 15...` view save

correct output
`95 96 96 95 93 94 94 94 90 91 ...` view save

user output
`0` view save

Error:

double free or corruption (out)

Test 14

Group: 4, 5, 6

Verdict: RUNTIME ERROR

input
`50 200 137 118 160 118 146 160 140 18...` view save

correct output
`98 98 98 96 90 91 88 88 84 86 ...` view save

user output
`0` view save

Error:

double free or corruption (out)

Test 15

Group: 4, 5, 6

Verdict: RUNTIME ERROR

input
`100 200 147 174 186 148 155 128 158 18...` view save

correct output
`99 99 98 98 97 97 96 96 95 95 ...` view save

user output
`0` view save

Error:

double free or corruption (out)

Test 16

Group: 5, 6

Verdict: RUNTIME ERROR

input
`1000 2000 928772177 816188227 216592201 ...` view save

correct output
`991676844 990940224 990685481 ...` view save

user output
(empty)

Test 17

Group: 5, 6

Verdict: RUNTIME ERROR

input
`1000 2000 665759876 597950008 615453266 ...` view save

correct output
`498801198 498681904 498504321 ...` view save

user output
(empty)

Test 18

Group: 5, 6

Verdict: RUNTIME ERROR

input
`500 2000 683288817 784230412 626685186 ...` view save

correct output
`497667621 498434895 495465990 ...` view save

user output
`0` view save

Test 19

Group: 5, 6

Verdict: RUNTIME ERROR

input
`1000 2000 666667000 809309500 571572000 ...` view save

correct output
`499499500 499249250 498999000 ...` view save

user output
(empty)

Test 20

Group: 6

Verdict: RUNTIME ERROR

input
`100000 200000 861772559 734298084 983382252 ...` view save

correct output
`499973914 499985299 499985141 ...` view save

user output
(empty)

Test 21

Group: 6

Verdict: RUNTIME ERROR

input
`30000 200000 691834579 617419813 514778075 ...` view save

correct output
`499967533 499976270 499969810 ...` view save

user output
(empty)

Test 22

Group: 6

Verdict: RUNTIME ERROR

input
`100000 200000 820255000 960780000 741965000 ...` view save

correct output
`499995000 499992500 499990000 ...` view save

user output
(empty)

Datatähti 2025 alku

Tikut

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Tasks

Submissions (OorigamiK)