Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
input/code.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf("%s", buf);
      |         ~~~~~^~~~~~~~~~~

#define to_bit(c) (1<<(c - 'A'))
#define bitmap uint32_t
 
#include <stdio.h>
#include <stdint.h>

int n;
bitmap found_flowers = 0;
bitmap **board = new bitmap*[500];

int main() {
    scanf("%d", &n);
 
    char *buf = new char[501];
    
    for (int i = 0; i < n; i++) {
        bitmap *row = new bitmap[500];
        scanf("%s", buf);
        for (int j = 0; j < n; j++) {
            found_flowers = found_flowers | to_bit(buf[j]);
            row[j] = to_bit(buf[j]);
        }
        board[i] = row;
    }

    long solutions = 0;
    
    bitmap *columns = new bitmap[500];
    bitmap cols_bwise_ored;
    int right;
    int bottom;
    int iters_to_skip;

    for (int left = 0; left < n; left++) {
        for (int top = 0; top < n; top++) {
            right = n-1;
            bottom = top;
            /*for (int c_col = left; c_col <= right; c_col++) {
                columns[c_col] = board[c_col][top];
            }*/
            
            begin:
                cols_bwise_ored = 0;
                for (int c_col = left; c_col <= right; c_col++) {
                    cols_bwise_ored |= columns[c_col];
                    
                    if (cols_bwise_ored == found_flowers) {
                        iters_to_skip = right - c_col + 1;
                        goto valid;
                    }
                }
                goto invalid;

            
            valid:
                //std::cout << "valid!\n";
                solutions += (n - bottom) * iters_to_skip;
                right -= iters_to_skip;
                if (right < left) {
                    goto next;
                }
                goto begin;
            
            invalid:
                //std::cout << "invalid...\n";
                if (++bottom >= n) {
                    goto next;
                }

                for (int c_col = left; c_col <= right; c_col++) {
                    columns[c_col] |= board[c_col][bottom];
                }
                goto begin;
                
                //std::cout << std::endl;
            
            next:
            if (bottom == n && right == n-1) {
                goto next_column;
            }
            continue;
        }
        next_column: continue;
    }

    printf("%ld", solutions);
 
    return 0;
}

Test 1

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

Verdict: WRONG ANSWER

Test 2

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

Verdict: WRONG ANSWER

Test 3

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

Verdict: WRONG ANSWER

Test 4

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

Verdict: WRONG ANSWER

Test 5

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

Verdict: WRONG ANSWER

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER

Test 23

Group: 6

Verdict: WRONG ANSWER

Test 24

Group: 6

Verdict: WRONG ANSWER

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED