Task: | Niitty |
Sender: | OorigamiK |
Submission time: | 2024-10-31 13:45:36 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 20 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 4 |
#2 | ACCEPTED | 6 |
#3 | ACCEPTED | 10 |
#4 | TIME LIMIT EXCEEDED | 0 |
#5 | TIME LIMIT EXCEEDED | 0 |
#6 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
#3 | ACCEPTED | 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 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
#7 | ACCEPTED | 0.01 s | 2, 3, 4, 5, 6 | details |
#8 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
#9 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
#10 | ACCEPTED | 0.02 s | 3, 4, 5, 6 | details |
#11 | ACCEPTED | 0.09 s | 3, 4, 5, 6 | details |
#12 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
#13 | ACCEPTED | 0.02 s | 3, 4, 5, 6 | details |
#14 | ACCEPTED | 0.30 s | 4, 5, 6 | details |
#15 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
#16 | ACCEPTED | 0.17 s | 4, 5, 6 | details |
#17 | ACCEPTED | 0.22 s | 4, 5, 6 | details |
#18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#20 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
#21 | TIME LIMIT EXCEEDED | -- | 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 '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:79: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] 79 | for (int color = 0; color < flowerSums.size(); color++) { | ~~~~~~^~~~~~~~~~~~~~~~~~~
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) { //std::cout << color << " " << sum<<" "<<flowerSums[color][x2][y2] << std::endl; return false; } } return true; } int main() { std::vector<std::string> flowers; int n; std::cin >> n; for (int i = 0; i < n; i++) { std::string s; std::cin >> s; //std::cout << s << std::endl; 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++) { //std::cout << flowers[k][t] <<" " << int(flowers[k][t]) << " " << int('A') << " " << k << " " << t << std::endl; if (int(flowers[k][t]) - int('A') == color) { flowerSums[y][k][t]++; //std::cout << "debug " << y << " " << k << " " << t << std::endl; } } } 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]; } } } /*for (int color = 0; color < flowerSums.size(); color++) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { std::cout << flowerSums[color][i][j] << " "; } std::cout << std::endl; } std::cout << std::endl; }*/ int numOfRec = 0; recArea(n, 0, 0, 3, 3, flowerSums); for (int x1 = 0; x1 < n; x1++) { for (int x2 = x1; x2 < n; x2++) { for (int y1 = 0; y1 < n; y1++) { for (int y2 = y1; y2 < n; y2++) { //std::cout << x1 << " " << x2 << " " << y1 << " " << y2 << std::endl; if (recArea(n, x1, x2, y1, y2, flowerSums)) { numOfRec++; //std::cout << "hu" << std::endl; } } } } } std::cout << numOfRec << std::endl; }
Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
correct output |
---|
2035 |
user output |
---|
2035 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
correct output |
---|
9 |
user output |
---|
9 |
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
correct output |
---|
3025 |
user output |
---|
3025 |
Test 4
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
correct output |
---|
12 |
user output |
---|
12 |
Test 5
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
1 X |
correct output |
---|
1 |
user output |
---|
1 |
Test 6
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
correct output |
---|
38724 |
user output |
---|
38724 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
correct output |
---|
8334 |
user output |
---|
8334 |
Test 8
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
correct output |
---|
44100 |
user output |
---|
44100 |
Test 9
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
correct output |
---|
18 |
user output |
---|
18 |
Test 10
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
correct output |
---|
1584665 |
user output |
---|
1584665 |
Test 11
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
correct output |
---|
1077746 |
user output |
---|
1077746 |
Test 12
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
correct output |
---|
1625625 |
user output |
---|
1625625 |
Test 13
Group: 3, 4, 5, 6
Verdict: ACCEPTED
input |
---|
50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
correct output |
---|
1680 |
user output |
---|
1680 |
Test 14
Group: 4, 5, 6
Verdict: ACCEPTED
input |
---|
100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
correct output |
---|
25325366 |
user output |
---|
25325366 |
Test 15
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
correct output |
---|
22342463 |
user output |
---|
(empty) |
Test 16
Group: 4, 5, 6
Verdict: ACCEPTED
input |
---|
100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
correct output |
---|
25502500 |
user output |
---|
25502500 |
Test 17
Group: 4, 5, 6
Verdict: ACCEPTED
input |
---|
100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
correct output |
---|
25650 |
user output |
---|
25650 |
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
correct output |
---|
403292767 |
user output |
---|
(empty) |
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
correct output |
---|
388111321 |
user output |
---|
(empty) |
Test 20
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
correct output |
---|
404010000 |
user output |
---|
(empty) |
Test 21
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
correct output |
---|
14159445 |
user output |
---|
(empty) |
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) |