CSES - Datatähti 2025 alku

Submission details
Task:	Niitty
Sender:	rottis
Submission time:	2024-10-31 09:19:39 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#2	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#3	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#4	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#5	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#6	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#7	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#8	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#9	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#10	WRONG ANSWER	0.00 s	3, 4, 5, 6	details
#11	WRONG ANSWER	0.00 s	3, 4, 5, 6	details
#12	WRONG ANSWER	0.00 s	3, 4, 5, 6	details
#13	WRONG ANSWER	0.45 s	3, 4, 5, 6	details
#14	WRONG ANSWER	0.00 s	4, 5, 6	details
#15	WRONG ANSWER	0.00 s	4, 5, 6	details
#16	WRONG ANSWER	0.01 s	4, 5, 6	details
#17	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#18	WRONG ANSWER	0.01 s	5, 6	details
#19	WRONG ANSWER	0.01 s	5, 6	details
#20	WRONG ANSWER	0.00 s	5, 6	details
#21	TIME LIMIT EXCEEDED	--	5, 6	details
#22	WRONG ANSWER	0.01 s	6	details
#23	WRONG ANSWER	0.03 s	6	details
#24	WRONG ANSWER	0.01 s	6	details
#25	TIME LIMIT EXCEEDED	--	6	details

Code

// IDEA: use mipmaps to reduce repeated calculations!

#define print_board for (int i = 0; i < n; i++) { std::cout << board[i] << '\n'; } std::cout << std::endl
#define print_flowers(flowers) for (int i = 0; i < 26; i++) { std::cout << ((flowers & (1<<i)) >> i); } std::cout << '\n' << "abcdefghijklmnopqrstuvwxyz" << std::endl
#define print_rect(r) std::cout << r.left << ' ' << r.right << ' ' << r.top << ' ' << r.bottom << std::endl
#define to_bit(c) (1<<(c - 'a'))
#define MAX_RECT ((rect) { .left = 0, .right = (int16_t) (n-1), .top = 0, .bottom = (int16_t) (n-1) })
#define rect_size(r) ((1 + r.right - r.left) * (1 + r.bottom - r.top))
#define LEFT 0
#define RIGHT 1
#define TOP 2
#define BOTTOM 3
#define rect_side(r, s) (&((int16_t*) &r)[s])
#define bitmap uint32_t
 
#include <iostream>
#include <stdlib.h>
#include <stdint.h>
 
// note: int16_t only needed for last part!
// other parts can do with int8_t
typedef struct {
    int16_t left;
    int16_t right;
    int16_t top;
    int16_t bottom;
} rect;
 
bool valid_rect(char **board, uint16_t n, bitmap flowers, rect rectangle) {
    bitmap flowers_in_rect = 0;
    for (uint16_t x = rectangle.left; x <= rectangle.right; x++) {
        for (uint16_t y = rectangle.top; y <= rectangle.bottom; y++) {
            flowers_in_rect = flowers_in_rect | to_bit(board[x][y]);
            if (flowers == flowers_in_rect) { return true; }
        }
    }
    return false;
}

int abs(int v) {
    return (v < 0 ? -v : v);
}

int main() {
    uint16_t n;
    bitmap found_flowers = 0;
    std::cin >> n;
 
    char **board = (char**) malloc((n) * sizeof(char*));
    
    for (unsigned int i = 0; i < n; i++) {
        char *row = (char*) malloc((n+1) * sizeof(char));
        std::cin >> row;
        for (unsigned int j = 0; j < n; j++) {
            found_flowers = found_flowers | to_bit(row[j]);
        }
        board[i] = row;
    }
 
    //print_flowers(found_flowers);
    unsigned int solutions = 0;
    
    rect smallest_rect = MAX_RECT;
    // we can optimize out one side; check which side is best to optimize
    int best_side = -1;
    int best_score = -1;
    rect best_rect;     
    for (int side : (int[]) {LEFT, RIGHT, TOP, BOTTOM}) {
        rect smallest_rect_copy = smallest_rect;
        
        int16_t *ref = rect_side(smallest_rect_copy, side);
        
        if (side % 2) { // right, bottom 
            do { 
                (*ref)--;
            } while (valid_rect(board, n, found_flowers, smallest_rect_copy));
            (*ref)++;
        } else { // left, top
            do {
                (*ref)++;
            } while (valid_rect(board, n, found_flowers, smallest_rect_copy));
            (*ref)--;
        }
        int c_score = abs(*rect_side(smallest_rect, side) - (*ref));
        if (best_score < c_score) {
            best_side = side;
            best_score = c_score;
            best_rect = smallest_rect_copy;
        }
    }

    smallest_rect = best_rect;
    unsigned int solutions_bordering_best_side = 0;

    // scuffed as fuck but i don't care

    bool on_best_side;        
    switch (best_side) {
        case LEFT:
            for (int16_t left = smallest_rect.left; left <= smallest_rect.right; left++) {
                on_best_side = (left == smallest_rect.left);

                for (int16_t right = left; right <= smallest_rect.right; right++) {
                    for (int16_t top = smallest_rect.top; top <= smallest_rect.bottom; top++) {
                        for (int16_t bottom = top; bottom <= smallest_rect.bottom; bottom++) {
                            if (valid_rect(board, n, found_flowers, (rect) {.left=left, .right=right, .top=top, .bottom=bottom})) {
                                solutions++;
                                if (on_best_side) {
                                    solutions_bordering_best_side++;
                                }
                            }
                        }
                    }
                }
            }
            break;

        case RIGHT:
            for (int16_t right = smallest_rect.right; right >= smallest_rect.left; right--) {
                on_best_side = (right == smallest_rect.right);
                
                for (int16_t left = right; left >= smallest_rect.left; left--) {
                    for (int16_t top = smallest_rect.top; top <= smallest_rect.bottom; top++) {
                        for (int16_t bottom = top; bottom <= smallest_rect.bottom; bottom++) {
                            if (valid_rect(board, n, found_flowers, (rect) {.left=left, .right=right, .top=top, .bottom=bottom})) {
                                solutions++;
                                if (on_best_side) {
                                    solutions_bordering_best_side++;
                                }
                            }
                        }
                    }
                }
            }
            break;

        case TOP:
            for (int16_t top = smallest_rect.top; top <= smallest_rect.bottom; top++) {
                on_best_side = (top == smallest_rect.top);

                for (int16_t bottom = top; bottom <= smallest_rect.bottom; bottom++) {
                    for (int16_t left = smallest_rect.left; left <= smallest_rect.right; left++) {
                        for (int16_t right = left; right <= smallest_rect.right; right++) {
                            if (valid_rect(board, n, found_flowers, (rect) {.left=left, .right=right, .top=top, .bottom=bottom})) {
                                solutions++;
                                if (on_best_side) {
                                    solutions_bordering_best_side++;
                                }
                            }
                        }
                    }
                }
            }
            break;

        case BOTTOM:
            for (int16_t bottom = smallest_rect.bottom; bottom >= smallest_rect.top; bottom--) {
                on_best_side = (bottom == smallest_rect.bottom);

                for (int16_t top = bottom; top >= smallest_rect.top; top--) {
                    for (int16_t left = smallest_rect.left; left <= smallest_rect.right; left++) {
                        for (int16_t right = left; right <= smallest_rect.right; right++) {
                            if (valid_rect(board, n, found_flowers, (rect) {.left=left, .right=right, .top=top, .bottom=bottom})) {
                                solutions++;
                                if (on_best_side) {
                                    solutions_bordering_best_side++;
                                }
                            }
                        }
                    }
                }
            }
            break;
    }
    
    solutions += solutions_bordering_best_side * best_score;
 
    std::cout << solutions << std::endl;
 
    /*
    for (unsigned int i = 0; i < n; i++) {
        free(board[i]);
    }
    free(board);
    */
 
    return 0;
}

Test details

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ...` view save

correct output
`2035` view save

user output
`40` view save

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ...` view save

correct output
`9` view save

user output
`8` view save

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ...` view save

correct output
`3025` view save

user output
`550` view save

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 X` view save

correct output
`1` view save

user output
`1` view save

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ...` view save

correct output
`38724` view save

user output
`1900` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ...` view save

correct output
`8334` view save

user output
`18` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ...` view save

correct output
`44100` view save

user output
`4200` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
`20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ...` view save

correct output
`18` view save

user output
`18` view save

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`48450` view save

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`11858` view save

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`63750` view save

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1296` view save

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
`443800` view save

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
`13800` view save

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`505000` view save

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
(empty)

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
`3778600` view save

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
`1256800` view save

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
`4020000` view save

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
(empty)

Test 22

Group: 6

Verdict: WRONG ANSWER

input
`500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...` view save

correct output
`15683003812` view save

user output
`60842500` view save

Test 23

Group: 6

Verdict: WRONG ANSWER

input
`500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...` view save

correct output
`15575906951` view save

user output
`39979000` view save

Test 24

Group: 6

Verdict: WRONG ANSWER

input
`500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`15687562500` view save

user output
`62625000` view save

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...` view save

correct output
`3058970930` view save

user output
(empty)

Datatähti 2025 alku

Niitty

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

Test 23

Test 24

Test 25

Tasks

Submissions (rottis)