| Task: | Niitty |
| Sender: | DLPS |
| Submission time: | 2024-10-30 13:55:08 +0200 |
| Language: | C++ (C++20) |
| 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 | 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 | WRONG ANSWER | 0.00 s | 2, 3, 4, 5, 6 | details |
| #7 | WRONG ANSWER | 0.00 s | 2, 3, 4, 5, 6 | details |
| #8 | ACCEPTED | 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.02 s | 3, 4, 5, 6 | details |
| #11 | WRONG ANSWER | 0.05 s | 3, 4, 5, 6 | details |
| #12 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
| #13 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #14 | WRONG ANSWER | 0.24 s | 4, 5, 6 | details |
| #15 | WRONG ANSWER | 0.42 s | 4, 5, 6 | details |
| #16 | ACCEPTED | 0.08 s | 4, 5, 6 | details |
| #17 | WRONG ANSWER | 0.10 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:1:25: warning: extra tokens at end of #include directive
1 | #include "bits/stdc++.h";
| ^
input/code.cpp:2:25: warning: extra tokens at end of #include directive
2 | #include "unordered_map";
| ^
input/code.cpp: In function 'int main()':
input/code.cpp:58:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | for (int x = 0; x < row.size(); x++)
| ~~^~~~~~~~~~~~Code
#include "bits/stdc++.h";
#include "unordered_map";
using namespace std;
struct flowerData
{
flowerData()
{
}
int left = 0;
int right = 0;
int top = 0;
int bottom = 0;
bool set = false;
};
unordered_map<char, flowerData> flowers;
int ContainsAllFlowers(int left, int right, int top, int bottom)
{
for (auto& flower : flowers)
{
if (flower.second.right < left)
{
return 0;
}
if (flower.second.left > right)
{
return 0;
}
if (flower.second.bottom < top)
{
return 0;
}
if (flower.second.top > bottom)
{
return 0;
}
}
return 1;
}
int main()
{
int size = 0;
cin >> size;
for (int y = 0; y < size; y++)
{
string row;
cin >> row;
//map.push_back(move(row));
for (int x = 0; x < row.size(); x++)
{
flowerData& currentFlower = flowers[row[x]];
if (!currentFlower.set)
{
currentFlower.left = x;
currentFlower.right = x;
currentFlower.top = y;
currentFlower.bottom = y;
currentFlower.set = true;
}
else
{
if (x > currentFlower.right)
{
currentFlower.right = x;
}
if (y > currentFlower.bottom)
{
currentFlower.bottom = y;
}
}
}
}
int count = 0;
for (int x1 = 0; x1 < size; x1++)
{
for (int x2 = x1; x2 < size; x2++)
{
for (int y1 = 0; y1 < size; y1++)
{
for (int y2 = y1; y2 < size; y2++)
{
count += ContainsAllFlowers(x1, x2, y1, y2);
}
}
}
}
cout << count;
}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 |
|---|
| 2200 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
| correct output |
|---|
| 9 |
| user output |
|---|
| 3 |
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: WRONG ANSWER
| input |
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
| correct output |
|---|
| 38724 |
| user output |
|---|
| 39690 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
| correct output |
|---|
| 8334 |
| user output |
|---|
| 4296 |
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: WRONG ANSWER
| input |
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 12 |
Test 10
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
| correct output |
|---|
| 1584665 |
| user output |
|---|
| 1541475 |
Test 11
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
| correct output |
|---|
| 1077746 |
| user output |
|---|
| 577034 |
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: WRONG ANSWER
| input |
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
| correct output |
|---|
| 1680 |
| user output |
|---|
| 3024 |
Test 14
Group: 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
| correct output |
|---|
| 25325366 |
| user output |
|---|
| 25452000 |
Test 15
Group: 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
| correct output |
|---|
| 22342463 |
| user output |
|---|
| 6171100 |
Test 16
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
| correct output |
|---|
| 25502500 |
| user output |
|---|
| 25502500 |
Test 17
Group: 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
| correct output |
|---|
| 25650 |
| user output |
|---|
| 150696 |
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) |
