Task: | Niitty |
Sender: | rottis |
Submission time: | 2024-10-31 10:09:53 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
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 | 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 | WRONG ANSWER | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#5 | WRONG ANSWER | 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 | WRONG ANSWER | 0.00 s | 2, 3, 4, 5, 6 | details |
#10 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
#11 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
#12 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
#13 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
#14 | WRONG ANSWER | 0.04 s | 4, 5, 6 | details |
#15 | WRONG ANSWER | 0.04 s | 4, 5, 6 | details |
#16 | WRONG ANSWER | 0.04 s | 4, 5, 6 | details |
#17 | WRONG ANSWER | 0.04 s | 4, 5, 6 | details |
#18 | WRONG ANSWER | 0.56 s | 5, 6 | details |
#19 | WRONG ANSWER | 0.56 s | 5, 6 | details |
#20 | WRONG ANSWER | 0.56 s | 5, 6 | details |
#21 | WRONG ANSWER | 0.56 s | 5, 6 | details |
#22 | TIME LIMIT EXCEEDED | -- | 6 | details |
#23 | TIME LIMIT EXCEEDED | -- | 6 | details |
#24 | TIME LIMIT EXCEEDED | -- | 6 | details |
#25 | TIME LIMIT EXCEEDED | -- | 6 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:29:13: warning: 'found_flowers' may be used uninitialized in this function [-Wmaybe-uninitialized] 29 | if (flowers == flowers_in_rect) { return true; } | ^~ input/code.cpp:41:12: note: 'found_flowers' was declared here 41 | bitmap found_flowers; | ^~~~~~~~~~~~~
Code
#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 CENTER_RECT ((rect) { .left = (int16_t (n>>1)), .right = (int16_t (n>>1)), .top = (int16_t (n>>1)), .bottom = (int16_t (n>>1)) }) #define rect_size(r) ((1 + r.right - r.left) * (1 + r.bottom - r.top)) #define enclosed_by(a, b) (a.left >= b.left && a.right <= b.right && a.top >= b.top && a.bottom <= b.bottom) #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; inline bool valid_rect_nobiggest(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; } inline bool valid_rect(char **board, uint16_t n, bitmap flowers, rect biggest_invalid_rect, rect rectangle) { return (!enclosed_by(rectangle, biggest_invalid_rect)) && valid_rect_nobiggest(board, n, flowers, rectangle); } int main() { uint16_t n; bitmap found_flowers; 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; } rect biggest_invalid_rect = CENTER_RECT; if (valid_rect_nobiggest(board, n, found_flowers, biggest_invalid_rect)) { biggest_invalid_rect.left = 501; } // naive solution for biggest invalid rect do { biggest_invalid_rect.left--; } while (biggest_invalid_rect.left >= 0 && !valid_rect_nobiggest(board, n, found_flowers, biggest_invalid_rect)); biggest_invalid_rect.left++; do { biggest_invalid_rect.right++; } while (biggest_invalid_rect.right < n && !valid_rect_nobiggest(board, n, found_flowers, biggest_invalid_rect)); biggest_invalid_rect.right--; do { biggest_invalid_rect.top--; } while (biggest_invalid_rect.top >= 0 && !valid_rect_nobiggest(board, n, found_flowers, biggest_invalid_rect)); biggest_invalid_rect.top++; do { biggest_invalid_rect.bottom++; } while (biggest_invalid_rect.bottom < n && !valid_rect_nobiggest(board, n, found_flowers, biggest_invalid_rect)); biggest_invalid_rect.bottom--; // brute force solution unsigned int solutions = 0; for (int16_t left = 0; left < n; left++) { for (int16_t right = left; right < n; right++) { for (int16_t top = 0; top < n; top++) { for (int16_t bottom = top; bottom < n; bottom++) { if (valid_rect(board, n, found_flowers, biggest_invalid_rect, (rect) {.left=left, .right=right, .top=top, .bottom=bottom})) { solutions++; } } } } } 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 ... |
correct output |
---|
2035 |
user output |
---|
0 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
correct output |
---|
9 |
user output |
---|
0 |
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
correct output |
---|
3025 |
user output |
---|
0 |
Test 4
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
correct output |
---|
12 |
user output |
---|
0 |
Test 5
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
1 X |
correct output |
---|
1 |
user output |
---|
0 |
Test 6
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
correct output |
---|
38724 |
user output |
---|
0 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
correct output |
---|
8334 |
user output |
---|
0 |
Test 8
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
correct output |
---|
44100 |
user output |
---|
0 |
Test 9
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
correct output |
---|
18 |
user output |
---|
0 |
Test 10
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
correct output |
---|
1584665 |
user output |
---|
0 |
Test 11
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
correct output |
---|
1077746 |
user output |
---|
0 |
Test 12
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
correct output |
---|
1625625 |
user output |
---|
0 |
Test 13
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
correct output |
---|
1680 |
user output |
---|
0 |
Test 14
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
correct output |
---|
25325366 |
user output |
---|
0 |
Test 15
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
correct output |
---|
22342463 |
user output |
---|
0 |
Test 16
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
correct output |
---|
25502500 |
user output |
---|
0 |
Test 17
Group: 4, 5, 6
Verdict: WRONG ANSWER
input |
---|
100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
correct output |
---|
25650 |
user output |
---|
0 |
Test 18
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
correct output |
---|
403292767 |
user output |
---|
0 |
Test 19
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
correct output |
---|
388111321 |
user output |
---|
0 |
Test 20
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
correct output |
---|
404010000 |
user output |
---|
0 |
Test 21
Group: 5, 6
Verdict: WRONG ANSWER
input |
---|
200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
correct output |
---|
14159445 |
user output |
---|
0 |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW... |
correct output |
---|
15683003812 |
user output |
---|
(empty) |
Test 23
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE... |
correct output |
---|
15575906951 |
user output |
---|
(empty) |
Test 24
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
correct output |
---|
15687562500 |
user output |
---|
(empty) |
Test 25
Group: 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW... |
correct output |
---|
3058970930 |
user output |
---|
(empty) |